/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 08:30:59,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 08:30:59,714 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 08:30:59,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 08:30:59,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 08:30:59,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 08:30:59,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 08:30:59,740 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 08:30:59,741 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 08:30:59,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 08:30:59,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 08:30:59,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 08:30:59,745 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 08:30:59,745 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 08:30:59,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 08:30:59,747 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 08:30:59,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 08:30:59,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 08:30:59,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 08:30:59,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 08:30:59,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 08:30:59,756 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 08:30:59,761 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 08:30:59,762 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 08:30:59,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 08:30:59,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 08:30:59,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 08:30:59,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 08:30:59,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 08:30:59,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 08:30:59,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 08:30:59,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 08:30:59,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 08:30:59,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 08:30:59,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 08:30:59,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 08:30:59,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 08:30:59,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 08:30:59,782 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 08:30:59,783 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 08:30:59,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 08:30:59,788 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-VariableLbe.epf [2019-12-27 08:30:59,810 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 08:30:59,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 08:30:59,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 08:30:59,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 08:30:59,814 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 08:30:59,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 08:30:59,814 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 08:30:59,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 08:30:59,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 08:30:59,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 08:30:59,816 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 08:30:59,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 08:30:59,816 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 08:30:59,817 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 08:30:59,817 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 08:30:59,817 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 08:30:59,817 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 08:30:59,818 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 08:30:59,818 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 08:30:59,818 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 08:30:59,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 08:30:59,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:30:59,819 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 08:30:59,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 08:30:59,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 08:30:59,820 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 08:30:59,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 08:30:59,820 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 08:30:59,820 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 08:30:59,820 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 08:31:00,094 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 08:31:00,114 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 08:31:00,117 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 08:31:00,119 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 08:31:00,119 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 08:31:00,120 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 08:31:00,197 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ab67f716/77e0633aa8c741d384d36ed9576c6778/FLAGc6aa6a611 [2019-12-27 08:31:00,711 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 08:31:00,712 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-2.i [2019-12-27 08:31:00,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ab67f716/77e0633aa8c741d384d36ed9576c6778/FLAGc6aa6a611 [2019-12-27 08:31:01,077 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ab67f716/77e0633aa8c741d384d36ed9576c6778 [2019-12-27 08:31:01,086 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 08:31:01,088 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 08:31:01,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 08:31:01,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 08:31:01,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 08:31:01,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:31:01" (1/1) ... [2019-12-27 08:31:01,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55b8252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:01, skipping insertion in model container [2019-12-27 08:31:01,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:31:01" (1/1) ... [2019-12-27 08:31:01,106 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 08:31:01,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 08:31:01,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:31:01,662 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 08:31:01,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:31:01,811 INFO L208 MainTranslator]: Completed translation [2019-12-27 08:31:01,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:01 WrapperNode [2019-12-27 08:31:01,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 08:31:01,812 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 08:31:01,812 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 08:31:01,812 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 08:31:01,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:01" (1/1) ... [2019-12-27 08:31:01,839 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:01" (1/1) ... [2019-12-27 08:31:01,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 08:31:01,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 08:31:01,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 08:31:01,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 08:31:01,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:01" (1/1) ... [2019-12-27 08:31:01,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:01" (1/1) ... [2019-12-27 08:31:01,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:01" (1/1) ... [2019-12-27 08:31:01,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:01" (1/1) ... [2019-12-27 08:31:01,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:01" (1/1) ... [2019-12-27 08:31:01,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:01" (1/1) ... [2019-12-27 08:31:01,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:01" (1/1) ... [2019-12-27 08:31:01,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 08:31:01,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 08:31:01,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 08:31:01,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 08:31:01,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:01" (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 08:31:01,957 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-27 08:31:01,958 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-27 08:31:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-27 08:31:01,958 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-27 08:31:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 08:31:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 08:31:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 08:31:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 08:31:01,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 08:31:01,961 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 08:31:02,300 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 08:31:02,301 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-27 08:31:02,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:31:02 BoogieIcfgContainer [2019-12-27 08:31:02,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 08:31:02,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 08:31:02,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 08:31:02,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 08:31:02,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:31:01" (1/3) ... [2019-12-27 08:31:02,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36eab368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:31:02, skipping insertion in model container [2019-12-27 08:31:02,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:31:01" (2/3) ... [2019-12-27 08:31:02,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36eab368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:31:02, skipping insertion in model container [2019-12-27 08:31:02,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:31:02" (3/3) ... [2019-12-27 08:31:02,311 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-2.i [2019-12-27 08:31:02,321 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 08:31:02,322 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 08:31:02,330 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 08:31:02,330 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 08:31:02,367 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,367 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,367 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,368 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,368 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,369 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,369 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,373 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,373 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,374 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,374 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,376 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,376 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,376 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,382 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,383 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,383 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,383 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,384 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,395 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,395 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,396 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,396 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,396 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,396 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:02,412 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 08:31:02,430 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:31:02,430 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:31:02,430 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:31:02,431 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:31:02,431 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:31:02,431 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:31:02,431 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:31:02,431 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:31:02,445 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 53 transitions [2019-12-27 08:31:02,447 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 57 places, 53 transitions [2019-12-27 08:31:02,494 INFO L132 PetriNetUnfolder]: 3/63 cut-off events. [2019-12-27 08:31:02,494 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:31:02,501 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 08:31:02,504 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 57 places, 53 transitions [2019-12-27 08:31:02,526 INFO L132 PetriNetUnfolder]: 3/63 cut-off events. [2019-12-27 08:31:02,526 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:31:02,527 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 08:31:02,530 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 592 [2019-12-27 08:31:02,531 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:31:03,940 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-27 08:31:04,041 INFO L206 etLargeBlockEncoding]: Checked pairs total: 489 [2019-12-27 08:31:04,041 INFO L214 etLargeBlockEncoding]: Total number of compositions: 46 [2019-12-27 08:31:04,045 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions [2019-12-27 08:31:04,058 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2019-12-27 08:31:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-27 08:31:04,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 08:31:04,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:04,074 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 08:31:04,075 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:31:04,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:04,084 INFO L82 PathProgramCache]: Analyzing trace with hash 210014, now seen corresponding path program 1 times [2019-12-27 08:31:04,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:04,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833787234] [2019-12-27 08:31:04,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:04,410 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 08:31:04,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833787234] [2019-12-27 08:31:04,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:04,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:31:04,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110494584] [2019-12-27 08:31:04,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:31:04,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:04,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:31:04,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:31:04,437 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-12-27 08:31:04,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:04,485 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2019-12-27 08:31:04,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:31:04,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 08:31:04,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:04,514 INFO L225 Difference]: With dead ends: 35 [2019-12-27 08:31:04,515 INFO L226 Difference]: Without dead ends: 31 [2019-12-27 08:31:04,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:31:04,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-27 08:31:04,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-27 08:31:04,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-27 08:31:04,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-12-27 08:31:04,569 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2019-12-27 08:31:04,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:04,570 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-12-27 08:31:04,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:31:04,570 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-12-27 08:31:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 08:31:04,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:04,572 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:04,572 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:31:04,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:04,572 INFO L82 PathProgramCache]: Analyzing trace with hash 647068079, now seen corresponding path program 1 times [2019-12-27 08:31:04,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:04,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419417664] [2019-12-27 08:31:04,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:04,679 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 08:31:04,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419417664] [2019-12-27 08:31:04,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:04,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:31:04,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654479390] [2019-12-27 08:31:04,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:31:04,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:04,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:31:04,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:31:04,685 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-12-27 08:31:04,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:04,710 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2019-12-27 08:31:04,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 08:31:04,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-27 08:31:04,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:04,712 INFO L225 Difference]: With dead ends: 26 [2019-12-27 08:31:04,712 INFO L226 Difference]: Without dead ends: 24 [2019-12-27 08:31:04,713 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 08:31:04,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-27 08:31:04,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-27 08:31:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-27 08:31:04,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2019-12-27 08:31:04,718 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2019-12-27 08:31:04,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:04,718 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2019-12-27 08:31:04,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:31:04,719 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2019-12-27 08:31:04,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 08:31:04,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:04,720 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:04,720 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 08:31:04,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:04,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1415732781, now seen corresponding path program 1 times [2019-12-27 08:31:04,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:04,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894061565] [2019-12-27 08:31:04,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:31:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:31:04,787 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:31:04,790 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:31:04,790 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 08:31:04,791 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-27 08:31:04,800 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,801 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,801 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,801 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,801 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,801 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,802 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,802 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,803 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,803 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,803 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,803 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,803 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,804 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,804 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,804 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,805 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,805 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,805 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,806 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,806 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,806 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,806 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,806 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,807 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,807 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,807 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,807 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,808 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,809 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,809 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,809 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,810 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,810 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,810 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,811 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,811 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,811 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,811 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,828 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,828 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,828 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,828 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,829 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,831 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,832 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,832 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,832 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,832 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,832 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,834 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,834 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,834 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,834 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,834 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,835 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:04,836 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 08:31:04,836 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:31:04,836 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:31:04,836 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:31:04,836 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:31:04,836 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:31:04,836 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:31:04,837 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:31:04,837 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:31:04,839 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions [2019-12-27 08:31:04,839 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-27 08:31:04,860 INFO L132 PetriNetUnfolder]: 4/84 cut-off events. [2019-12-27 08:31:04,860 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 08:31:04,862 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 08:31:04,866 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-27 08:31:04,883 INFO L132 PetriNetUnfolder]: 4/84 cut-off events. [2019-12-27 08:31:04,883 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 08:31:04,885 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 08:31:04,888 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 920 [2019-12-27 08:31:04,888 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:31:06,251 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-27 08:31:06,349 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1034 [2019-12-27 08:31:06,349 INFO L214 etLargeBlockEncoding]: Total number of compositions: 57 [2019-12-27 08:31:06,349 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions [2019-12-27 08:31:06,361 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2019-12-27 08:31:06,362 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-12-27 08:31:06,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 08:31:06,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:06,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 08:31:06,363 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:31:06,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:06,363 INFO L82 PathProgramCache]: Analyzing trace with hash 353600, now seen corresponding path program 1 times [2019-12-27 08:31:06,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:06,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987585297] [2019-12-27 08:31:06,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:31:06,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987585297] [2019-12-27 08:31:06,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:06,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:31:06,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593154643] [2019-12-27 08:31:06,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:31:06,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:06,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:31:06,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:31:06,408 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-12-27 08:31:06,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:06,437 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2019-12-27 08:31:06,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:31:06,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 08:31:06,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:06,442 INFO L225 Difference]: With dead ends: 185 [2019-12-27 08:31:06,442 INFO L226 Difference]: Without dead ends: 171 [2019-12-27 08:31:06,443 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 08:31:06,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-27 08:31:06,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-12-27 08:31:06,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-27 08:31:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 417 transitions. [2019-12-27 08:31:06,467 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 417 transitions. Word has length 3 [2019-12-27 08:31:06,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:06,467 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 417 transitions. [2019-12-27 08:31:06,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:31:06,468 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 417 transitions. [2019-12-27 08:31:06,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 08:31:06,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:06,469 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:06,469 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:31:06,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:06,469 INFO L82 PathProgramCache]: Analyzing trace with hash -677960350, now seen corresponding path program 1 times [2019-12-27 08:31:06,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:06,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242407663] [2019-12-27 08:31:06,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:06,524 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 08:31:06,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242407663] [2019-12-27 08:31:06,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:06,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:31:06,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865919451] [2019-12-27 08:31:06,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:31:06,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:06,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:31:06,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:31:06,526 INFO L87 Difference]: Start difference. First operand 169 states and 417 transitions. Second operand 5 states. [2019-12-27 08:31:06,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:06,605 INFO L93 Difference]: Finished difference Result 204 states and 460 transitions. [2019-12-27 08:31:06,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:31:06,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 08:31:06,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:06,609 INFO L225 Difference]: With dead ends: 204 [2019-12-27 08:31:06,609 INFO L226 Difference]: Without dead ends: 201 [2019-12-27 08:31:06,609 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 08:31:06,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-12-27 08:31:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2019-12-27 08:31:06,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-27 08:31:06,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2019-12-27 08:31:06,629 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2019-12-27 08:31:06,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:06,629 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2019-12-27 08:31:06,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:31:06,629 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2019-12-27 08:31:06,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 08:31:06,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:06,631 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:06,631 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:31:06,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:06,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1901960811, now seen corresponding path program 1 times [2019-12-27 08:31:06,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:06,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622114472] [2019-12-27 08:31:06,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:06,725 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 08:31:06,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622114472] [2019-12-27 08:31:06,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:06,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:31:06,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359900876] [2019-12-27 08:31:06,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:31:06,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:06,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:31:06,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:31:06,727 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2019-12-27 08:31:06,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:06,812 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2019-12-27 08:31:06,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:31:06,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 08:31:06,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:06,816 INFO L225 Difference]: With dead ends: 189 [2019-12-27 08:31:06,816 INFO L226 Difference]: Without dead ends: 185 [2019-12-27 08:31:06,816 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 08:31:06,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-27 08:31:06,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2019-12-27 08:31:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-27 08:31:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2019-12-27 08:31:06,829 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2019-12-27 08:31:06,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:06,830 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2019-12-27 08:31:06,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:31:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2019-12-27 08:31:06,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 08:31:06,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:06,832 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:06,832 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:31:06,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:06,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1166778350, now seen corresponding path program 1 times [2019-12-27 08:31:06,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:06,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716011709] [2019-12-27 08:31:06,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:31:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:31:06,870 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:31:06,871 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:31:06,871 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 08:31:06,871 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-27 08:31:06,881 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,881 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,881 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,881 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,881 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,882 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,882 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,882 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,882 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,882 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,882 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,883 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,883 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,883 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,883 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,884 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,884 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,884 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,884 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,884 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,884 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,885 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,885 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,885 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,885 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,886 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,886 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,886 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,886 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,886 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,886 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,887 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,887 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,887 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,887 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,888 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,888 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,888 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,888 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,888 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,888 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,889 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,889 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,889 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,889 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,890 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,890 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,890 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,890 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,890 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,891 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,891 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,891 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,891 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,892 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,892 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,893 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,893 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,894 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,894 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,894 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,896 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,896 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,896 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,896 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,897 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,898 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,898 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,898 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,899 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,899 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,899 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,900 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,901 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,901 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,901 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,901 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,901 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,903 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,903 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,903 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,903 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,903 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,904 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:06,905 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 08:31:06,905 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:31:06,906 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:31:06,906 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:31:06,906 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:31:06,906 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:31:06,906 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:31:06,906 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:31:06,906 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:31:06,909 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 85 transitions [2019-12-27 08:31:06,909 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 95 places, 85 transitions [2019-12-27 08:31:06,928 INFO L132 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-27 08:31:06,928 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 08:31:06,930 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 08:31:06,933 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 95 places, 85 transitions [2019-12-27 08:31:06,954 INFO L132 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-27 08:31:06,955 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 08:31:06,958 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 08:31:06,963 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1308 [2019-12-27 08:31:06,963 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:31:08,334 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-27 08:31:08,413 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1615 [2019-12-27 08:31:08,413 INFO L214 etLargeBlockEncoding]: Total number of compositions: 69 [2019-12-27 08:31:08,414 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 27 transitions [2019-12-27 08:31:08,442 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2019-12-27 08:31:08,442 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-12-27 08:31:08,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 08:31:08,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:08,443 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 08:31:08,443 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 08:31:08,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:08,444 INFO L82 PathProgramCache]: Analyzing trace with hash 525945, now seen corresponding path program 1 times [2019-12-27 08:31:08,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:08,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719916586] [2019-12-27 08:31:08,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:08,510 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 08:31:08,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719916586] [2019-12-27 08:31:08,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:08,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:31:08,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067736490] [2019-12-27 08:31:08,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:31:08,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:08,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:31:08,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:31:08,513 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2019-12-27 08:31:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:08,552 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2019-12-27 08:31:08,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:31:08,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 08:31:08,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:08,562 INFO L225 Difference]: With dead ends: 600 [2019-12-27 08:31:08,562 INFO L226 Difference]: Without dead ends: 559 [2019-12-27 08:31:08,563 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 08:31:08,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-27 08:31:08,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 547. [2019-12-27 08:31:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-27 08:31:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1723 transitions. [2019-12-27 08:31:08,614 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1723 transitions. Word has length 3 [2019-12-27 08:31:08,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:08,614 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1723 transitions. [2019-12-27 08:31:08,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:31:08,615 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1723 transitions. [2019-12-27 08:31:08,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 08:31:08,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:08,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:08,616 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 08:31:08,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:08,616 INFO L82 PathProgramCache]: Analyzing trace with hash -2106616436, now seen corresponding path program 1 times [2019-12-27 08:31:08,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:08,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885995682] [2019-12-27 08:31:08,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:08,693 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 08:31:08,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885995682] [2019-12-27 08:31:08,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:08,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:31:08,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386310510] [2019-12-27 08:31:08,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:31:08,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:08,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:31:08,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:31:08,696 INFO L87 Difference]: Start difference. First operand 547 states and 1723 transitions. Second operand 5 states. [2019-12-27 08:31:08,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:08,799 INFO L93 Difference]: Finished difference Result 802 states and 2304 transitions. [2019-12-27 08:31:08,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:31:08,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 08:31:08,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:08,806 INFO L225 Difference]: With dead ends: 802 [2019-12-27 08:31:08,806 INFO L226 Difference]: Without dead ends: 799 [2019-12-27 08:31:08,807 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 08:31:08,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-12-27 08:31:08,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 576. [2019-12-27 08:31:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-27 08:31:08,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1822 transitions. [2019-12-27 08:31:08,832 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1822 transitions. Word has length 9 [2019-12-27 08:31:08,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:08,832 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1822 transitions. [2019-12-27 08:31:08,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:31:08,833 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1822 transitions. [2019-12-27 08:31:08,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 08:31:08,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:08,834 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:08,834 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 08:31:08,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:08,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1813947824, now seen corresponding path program 1 times [2019-12-27 08:31:08,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:08,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462880755] [2019-12-27 08:31:08,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:08,883 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 08:31:08,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462880755] [2019-12-27 08:31:08,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:08,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:31:08,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134544759] [2019-12-27 08:31:08,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:31:08,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:08,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:31:08,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:31:08,885 INFO L87 Difference]: Start difference. First operand 576 states and 1822 transitions. Second operand 5 states. [2019-12-27 08:31:08,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:08,963 INFO L93 Difference]: Finished difference Result 832 states and 2399 transitions. [2019-12-27 08:31:08,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:31:08,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 08:31:08,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:08,970 INFO L225 Difference]: With dead ends: 832 [2019-12-27 08:31:08,970 INFO L226 Difference]: Without dead ends: 828 [2019-12-27 08:31:08,970 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 08:31:08,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-12-27 08:31:08,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 605. [2019-12-27 08:31:08,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 08:31:08,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1901 transitions. [2019-12-27 08:31:08,993 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1901 transitions. Word has length 13 [2019-12-27 08:31:08,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:08,994 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1901 transitions. [2019-12-27 08:31:08,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:31:08,994 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1901 transitions. [2019-12-27 08:31:08,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 08:31:08,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:08,995 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:08,995 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 08:31:08,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:08,996 INFO L82 PathProgramCache]: Analyzing trace with hash -693557262, now seen corresponding path program 1 times [2019-12-27 08:31:08,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:08,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122278405] [2019-12-27 08:31:08,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:09,060 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 08:31:09,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122278405] [2019-12-27 08:31:09,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158247564] [2019-12-27 08:31:09,061 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 08:31:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:09,148 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 08:31:09,151 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:09,244 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 08:31:09,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:09,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 08:31:09,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115001418] [2019-12-27 08:31:09,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:31:09,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:09,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:31:09,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:31:09,247 INFO L87 Difference]: Start difference. First operand 605 states and 1901 transitions. Second operand 12 states. [2019-12-27 08:31:09,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:09,566 INFO L93 Difference]: Finished difference Result 1052 states and 2813 transitions. [2019-12-27 08:31:09,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:31:09,566 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-27 08:31:09,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:09,573 INFO L225 Difference]: With dead ends: 1052 [2019-12-27 08:31:09,574 INFO L226 Difference]: Without dead ends: 1048 [2019-12-27 08:31:09,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:31:09,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-12-27 08:31:09,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 587. [2019-12-27 08:31:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-12-27 08:31:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1837 transitions. [2019-12-27 08:31:09,601 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1837 transitions. Word has length 15 [2019-12-27 08:31:09,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:09,601 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 1837 transitions. [2019-12-27 08:31:09,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:31:09,601 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1837 transitions. [2019-12-27 08:31:09,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 08:31:09,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:09,602 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:09,806 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:09,806 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 08:31:09,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:09,806 INFO L82 PathProgramCache]: Analyzing trace with hash -552862538, now seen corresponding path program 2 times [2019-12-27 08:31:09,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:09,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017873510] [2019-12-27 08:31:09,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:09,908 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 08:31:09,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017873510] [2019-12-27 08:31:09,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:09,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:31:09,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685611454] [2019-12-27 08:31:09,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:31:09,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:09,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:31:09,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:31:09,930 INFO L87 Difference]: Start difference. First operand 587 states and 1837 transitions. Second operand 7 states. [2019-12-27 08:31:10,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:10,237 INFO L93 Difference]: Finished difference Result 1050 states and 2805 transitions. [2019-12-27 08:31:10,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:31:10,237 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 08:31:10,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:10,247 INFO L225 Difference]: With dead ends: 1050 [2019-12-27 08:31:10,247 INFO L226 Difference]: Without dead ends: 1045 [2019-12-27 08:31:10,248 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 08:31:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-27 08:31:10,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2019-12-27 08:31:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 08:31:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2019-12-27 08:31:10,273 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2019-12-27 08:31:10,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:10,275 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2019-12-27 08:31:10,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:31:10,275 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2019-12-27 08:31:10,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 08:31:10,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:10,276 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:10,276 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 08:31:10,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:10,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1197543999, now seen corresponding path program 1 times [2019-12-27 08:31:10,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:10,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579791842] [2019-12-27 08:31:10,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:10,366 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 08:31:10,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579791842] [2019-12-27 08:31:10,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:10,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:31:10,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487168707] [2019-12-27 08:31:10,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:31:10,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:10,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:31:10,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:31:10,368 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2019-12-27 08:31:10,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:10,462 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2019-12-27 08:31:10,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:31:10,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 08:31:10,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:10,468 INFO L225 Difference]: With dead ends: 736 [2019-12-27 08:31:10,468 INFO L226 Difference]: Without dead ends: 728 [2019-12-27 08:31:10,468 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 08:31:10,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-27 08:31:10,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2019-12-27 08:31:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-12-27 08:31:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2019-12-27 08:31:10,486 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2019-12-27 08:31:10,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:10,487 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2019-12-27 08:31:10,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:31:10,487 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2019-12-27 08:31:10,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 08:31:10,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:10,488 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:10,489 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 08:31:10,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:10,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1527881090, now seen corresponding path program 1 times [2019-12-27 08:31:10,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:10,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30080832] [2019-12-27 08:31:10,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:31:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:31:10,526 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:31:10,526 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:31:10,527 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 08:31:10,527 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-27 08:31:10,539 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,539 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,539 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,539 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,539 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,539 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,540 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,540 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,540 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,540 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,540 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,541 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,541 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,541 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,541 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,541 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,541 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,541 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,542 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,542 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,542 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,542 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,542 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,542 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,542 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,543 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,543 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,543 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,543 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,543 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,544 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,544 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,544 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,544 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,544 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,544 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,545 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,545 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,545 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,545 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,545 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,545 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,545 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,546 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,546 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,546 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,546 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,546 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,547 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,547 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,547 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,547 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,547 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,547 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,547 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,548 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,548 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,548 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,548 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,548 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,549 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,549 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,549 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,549 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,549 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,549 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,549 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,550 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,550 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,550 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,550 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,550 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,551 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,553 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,553 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,553 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,553 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,554 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,555 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,555 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,555 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,556 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,556 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,558 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,558 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,558 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,559 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,559 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,560 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,560 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,560 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,560 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,560 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,561 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,562 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,562 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,562 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,562 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,562 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,563 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,564 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,564 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,564 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,564 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,565 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,565 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,566 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,566 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,566 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,566 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,566 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,567 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:10,568 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 08:31:10,568 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:31:10,568 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:31:10,568 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:31:10,568 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:31:10,569 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:31:10,569 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:31:10,569 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:31:10,569 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:31:10,570 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 101 transitions [2019-12-27 08:31:10,570 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 114 places, 101 transitions [2019-12-27 08:31:10,590 INFO L132 PetriNetUnfolder]: 6/126 cut-off events. [2019-12-27 08:31:10,591 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 08:31:10,593 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 08:31:10,597 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 114 places, 101 transitions [2019-12-27 08:31:10,615 INFO L132 PetriNetUnfolder]: 6/126 cut-off events. [2019-12-27 08:31:10,615 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 08:31:10,618 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 08:31:10,624 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1756 [2019-12-27 08:31:10,625 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:31:12,165 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-12-27 08:31:12,393 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2111 [2019-12-27 08:31:12,393 INFO L214 etLargeBlockEncoding]: Total number of compositions: 84 [2019-12-27 08:31:12,393 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions [2019-12-27 08:31:12,525 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2019-12-27 08:31:12,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2019-12-27 08:31:12,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 08:31:12,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:12,526 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 08:31:12,526 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 08:31:12,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:12,527 INFO L82 PathProgramCache]: Analyzing trace with hash 729974, now seen corresponding path program 1 times [2019-12-27 08:31:12,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:12,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385782841] [2019-12-27 08:31:12,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:12,544 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 08:31:12,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385782841] [2019-12-27 08:31:12,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:12,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:31:12,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339504807] [2019-12-27 08:31:12,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:31:12,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:12,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:31:12,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:31:12,546 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2019-12-27 08:31:12,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:12,602 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2019-12-27 08:31:12,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:31:12,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 08:31:12,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:12,624 INFO L225 Difference]: With dead ends: 1889 [2019-12-27 08:31:12,624 INFO L226 Difference]: Without dead ends: 1767 [2019-12-27 08:31:12,625 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 08:31:12,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-12-27 08:31:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1717. [2019-12-27 08:31:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-12-27 08:31:12,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 6597 transitions. [2019-12-27 08:31:12,722 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 6597 transitions. Word has length 3 [2019-12-27 08:31:12,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:12,722 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 6597 transitions. [2019-12-27 08:31:12,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:31:12,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 6597 transitions. [2019-12-27 08:31:12,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 08:31:12,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:12,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:12,723 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 08:31:12,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:12,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1449000874, now seen corresponding path program 1 times [2019-12-27 08:31:12,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:12,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049680643] [2019-12-27 08:31:12,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:12,766 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 08:31:12,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049680643] [2019-12-27 08:31:12,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:12,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:31:12,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640199276] [2019-12-27 08:31:12,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:31:12,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:12,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:31:12,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:31:12,769 INFO L87 Difference]: Start difference. First operand 1717 states and 6597 transitions. Second operand 5 states. [2019-12-27 08:31:12,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:12,883 INFO L93 Difference]: Finished difference Result 2826 states and 10014 transitions. [2019-12-27 08:31:12,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:31:12,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 08:31:12,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:12,908 INFO L225 Difference]: With dead ends: 2826 [2019-12-27 08:31:12,909 INFO L226 Difference]: Without dead ends: 2823 [2019-12-27 08:31:12,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:31:12,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-27 08:31:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 1914. [2019-12-27 08:31:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-27 08:31:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 7409 transitions. [2019-12-27 08:31:13,013 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 7409 transitions. Word has length 9 [2019-12-27 08:31:13,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:13,013 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 7409 transitions. [2019-12-27 08:31:13,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:31:13,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 7409 transitions. [2019-12-27 08:31:13,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 08:31:13,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:13,014 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:13,015 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 08:31:13,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:13,015 INFO L82 PathProgramCache]: Analyzing trace with hash 302089454, now seen corresponding path program 1 times [2019-12-27 08:31:13,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:13,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535635492] [2019-12-27 08:31:13,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:13,069 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 08:31:13,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535635492] [2019-12-27 08:31:13,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:13,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:31:13,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032369625] [2019-12-27 08:31:13,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:31:13,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:13,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:31:13,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:31:13,072 INFO L87 Difference]: Start difference. First operand 1914 states and 7409 transitions. Second operand 5 states. [2019-12-27 08:31:13,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:13,197 INFO L93 Difference]: Finished difference Result 3124 states and 11194 transitions. [2019-12-27 08:31:13,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:31:13,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 08:31:13,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:13,238 INFO L225 Difference]: With dead ends: 3124 [2019-12-27 08:31:13,238 INFO L226 Difference]: Without dead ends: 3120 [2019-12-27 08:31:13,238 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 08:31:13,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2019-12-27 08:31:13,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2147. [2019-12-27 08:31:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-27 08:31:13,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8364 transitions. [2019-12-27 08:31:13,353 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8364 transitions. Word has length 13 [2019-12-27 08:31:13,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:13,355 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8364 transitions. [2019-12-27 08:31:13,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:31:13,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8364 transitions. [2019-12-27 08:31:13,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 08:31:13,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:13,357 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:13,357 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 08:31:13,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:13,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1953005855, now seen corresponding path program 1 times [2019-12-27 08:31:13,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:13,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657440661] [2019-12-27 08:31:13,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:13,428 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 08:31:13,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657440661] [2019-12-27 08:31:13,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413954174] [2019-12-27 08:31:13,429 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 08:31:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:13,554 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 08:31:13,557 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:13,615 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 08:31:13,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:13,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 08:31:13,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950253643] [2019-12-27 08:31:13,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:31:13,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:13,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:31:13,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:31:13,617 INFO L87 Difference]: Start difference. First operand 2147 states and 8364 transitions. Second operand 12 states. [2019-12-27 08:31:13,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:13,945 INFO L93 Difference]: Finished difference Result 4460 states and 14778 transitions. [2019-12-27 08:31:13,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:31:13,946 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-27 08:31:13,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:13,977 INFO L225 Difference]: With dead ends: 4460 [2019-12-27 08:31:13,977 INFO L226 Difference]: Without dead ends: 4456 [2019-12-27 08:31:13,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:31:13,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2019-12-27 08:31:14,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 2109. [2019-12-27 08:31:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2019-12-27 08:31:14,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 8197 transitions. [2019-12-27 08:31:14,085 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 8197 transitions. Word has length 15 [2019-12-27 08:31:14,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:14,085 INFO L462 AbstractCegarLoop]: Abstraction has 2109 states and 8197 transitions. [2019-12-27 08:31:14,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:31:14,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 8197 transitions. [2019-12-27 08:31:14,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 08:31:14,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:14,087 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:14,291 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:14,291 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 08:31:14,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:14,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1749825449, now seen corresponding path program 2 times [2019-12-27 08:31:14,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:14,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661680471] [2019-12-27 08:31:14,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:14,342 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 08:31:14,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661680471] [2019-12-27 08:31:14,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:14,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:31:14,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193806054] [2019-12-27 08:31:14,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:31:14,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:14,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:31:14,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:31:14,345 INFO L87 Difference]: Start difference. First operand 2109 states and 8197 transitions. Second operand 7 states. [2019-12-27 08:31:14,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:14,606 INFO L93 Difference]: Finished difference Result 4522 states and 14986 transitions. [2019-12-27 08:31:14,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:31:14,606 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 08:31:14,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:14,628 INFO L225 Difference]: With dead ends: 4522 [2019-12-27 08:31:14,628 INFO L226 Difference]: Without dead ends: 4517 [2019-12-27 08:31:14,629 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 08:31:14,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-27 08:31:14,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 1998. [2019-12-27 08:31:14,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-27 08:31:14,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7779 transitions. [2019-12-27 08:31:14,826 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7779 transitions. Word has length 15 [2019-12-27 08:31:14,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:14,826 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 7779 transitions. [2019-12-27 08:31:14,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:31:14,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7779 transitions. [2019-12-27 08:31:14,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 08:31:14,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:14,827 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:14,827 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 08:31:14,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:14,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1726909890, now seen corresponding path program 1 times [2019-12-27 08:31:14,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:14,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488902897] [2019-12-27 08:31:14,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:14,882 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 08:31:14,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488902897] [2019-12-27 08:31:14,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:14,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:31:14,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235921691] [2019-12-27 08:31:14,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:31:14,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:14,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:31:14,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:31:14,885 INFO L87 Difference]: Start difference. First operand 1998 states and 7779 transitions. Second operand 5 states. [2019-12-27 08:31:15,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:15,002 INFO L93 Difference]: Finished difference Result 3208 states and 11604 transitions. [2019-12-27 08:31:15,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:31:15,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 08:31:15,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:15,015 INFO L225 Difference]: With dead ends: 3208 [2019-12-27 08:31:15,015 INFO L226 Difference]: Without dead ends: 3200 [2019-12-27 08:31:15,016 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 08:31:15,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2019-12-27 08:31:15,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 2245. [2019-12-27 08:31:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-12-27 08:31:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 8702 transitions. [2019-12-27 08:31:15,099 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 8702 transitions. Word has length 17 [2019-12-27 08:31:15,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:15,099 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 8702 transitions. [2019-12-27 08:31:15,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:31:15,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 8702 transitions. [2019-12-27 08:31:15,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:31:15,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:15,101 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:15,101 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 08:31:15,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:15,101 INFO L82 PathProgramCache]: Analyzing trace with hash -2140493091, now seen corresponding path program 1 times [2019-12-27 08:31:15,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:15,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877698544] [2019-12-27 08:31:15,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:15,162 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 08:31:15,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877698544] [2019-12-27 08:31:15,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186230488] [2019-12-27 08:31:15,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 08:31:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:15,231 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 08:31:15,233 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:15,313 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 08:31:15,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:15,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 08:31:15,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438135467] [2019-12-27 08:31:15,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:31:15,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:15,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:31:15,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:31:15,316 INFO L87 Difference]: Start difference. First operand 2245 states and 8702 transitions. Second operand 12 states. [2019-12-27 08:31:15,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:15,708 INFO L93 Difference]: Finished difference Result 4759 states and 15906 transitions. [2019-12-27 08:31:15,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:31:15,709 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-27 08:31:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:15,725 INFO L225 Difference]: With dead ends: 4759 [2019-12-27 08:31:15,725 INFO L226 Difference]: Without dead ends: 4753 [2019-12-27 08:31:15,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:31:15,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4753 states. [2019-12-27 08:31:15,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4753 to 2270. [2019-12-27 08:31:15,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2019-12-27 08:31:15,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 8766 transitions. [2019-12-27 08:31:15,892 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 8766 transitions. Word has length 19 [2019-12-27 08:31:15,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:15,892 INFO L462 AbstractCegarLoop]: Abstraction has 2270 states and 8766 transitions. [2019-12-27 08:31:15,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:31:15,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 8766 transitions. [2019-12-27 08:31:15,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:31:15,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:15,895 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:16,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:16,099 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 08:31:16,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:16,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1012596352, now seen corresponding path program 1 times [2019-12-27 08:31:16,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:16,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993901404] [2019-12-27 08:31:16,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:16,153 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 08:31:16,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993901404] [2019-12-27 08:31:16,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755562081] [2019-12-27 08:31:16,154 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 08:31:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:16,231 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 08:31:16,232 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:16,313 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 08:31:16,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:16,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 08:31:16,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944914116] [2019-12-27 08:31:16,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:31:16,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:16,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:31:16,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:31:16,317 INFO L87 Difference]: Start difference. First operand 2270 states and 8766 transitions. Second operand 12 states. [2019-12-27 08:31:16,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:16,619 INFO L93 Difference]: Finished difference Result 4884 states and 16344 transitions. [2019-12-27 08:31:16,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:31:16,620 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-27 08:31:16,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:16,636 INFO L225 Difference]: With dead ends: 4884 [2019-12-27 08:31:16,636 INFO L226 Difference]: Without dead ends: 4875 [2019-12-27 08:31:16,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:31:16,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-27 08:31:16,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2267. [2019-12-27 08:31:16,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-12-27 08:31:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 8739 transitions. [2019-12-27 08:31:16,734 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 8739 transitions. Word has length 19 [2019-12-27 08:31:16,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:16,734 INFO L462 AbstractCegarLoop]: Abstraction has 2267 states and 8739 transitions. [2019-12-27 08:31:16,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:31:16,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 8739 transitions. [2019-12-27 08:31:16,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:31:16,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:16,736 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:16,946 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:16,947 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 08:31:16,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:16,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1703029164, now seen corresponding path program 2 times [2019-12-27 08:31:16,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:16,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916153162] [2019-12-27 08:31:16,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:17,011 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 08:31:17,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916153162] [2019-12-27 08:31:17,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:17,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:31:17,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841242636] [2019-12-27 08:31:17,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:31:17,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:17,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:31:17,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:31:17,018 INFO L87 Difference]: Start difference. First operand 2267 states and 8739 transitions. Second operand 7 states. [2019-12-27 08:31:17,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:17,357 INFO L93 Difference]: Finished difference Result 4884 states and 16339 transitions. [2019-12-27 08:31:17,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:31:17,357 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 08:31:17,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:17,381 INFO L225 Difference]: With dead ends: 4884 [2019-12-27 08:31:17,381 INFO L226 Difference]: Without dead ends: 4875 [2019-12-27 08:31:17,383 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 08:31:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-27 08:31:17,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2192. [2019-12-27 08:31:17,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-12-27 08:31:17,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 8446 transitions. [2019-12-27 08:31:17,471 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 8446 transitions. Word has length 19 [2019-12-27 08:31:17,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:17,472 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 8446 transitions. [2019-12-27 08:31:17,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:31:17,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 8446 transitions. [2019-12-27 08:31:17,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:31:17,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:17,474 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:17,474 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 08:31:17,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:17,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1703042649, now seen corresponding path program 2 times [2019-12-27 08:31:17,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:17,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421430190] [2019-12-27 08:31:17,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:17,520 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 08:31:17,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421430190] [2019-12-27 08:31:17,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:17,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:31:17,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217883084] [2019-12-27 08:31:17,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:31:17,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:17,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:31:17,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:31:17,522 INFO L87 Difference]: Start difference. First operand 2192 states and 8446 transitions. Second operand 7 states. [2019-12-27 08:31:17,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:17,869 INFO L93 Difference]: Finished difference Result 4737 states and 15791 transitions. [2019-12-27 08:31:17,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:31:17,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 08:31:17,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:17,886 INFO L225 Difference]: With dead ends: 4737 [2019-12-27 08:31:17,886 INFO L226 Difference]: Without dead ends: 4728 [2019-12-27 08:31:17,886 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 08:31:17,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2019-12-27 08:31:17,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 2133. [2019-12-27 08:31:17,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-12-27 08:31:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 8224 transitions. [2019-12-27 08:31:17,971 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 8224 transitions. Word has length 19 [2019-12-27 08:31:17,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:17,971 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 8224 transitions. [2019-12-27 08:31:17,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:31:17,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 8224 transitions. [2019-12-27 08:31:17,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:31:17,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:17,973 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 08:31:17,974 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 08:31:17,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:17,974 INFO L82 PathProgramCache]: Analyzing trace with hash 269937843, now seen corresponding path program 1 times [2019-12-27 08:31:17,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:17,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242596862] [2019-12-27 08:31:17,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:18,040 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 08:31:18,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242596862] [2019-12-27 08:31:18,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485266220] [2019-12-27 08:31:18,041 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 08:31:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:18,115 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:31:18,117 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:18,235 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 08:31:18,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:18,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:31:18,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611717965] [2019-12-27 08:31:18,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:31:18,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:18,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:31:18,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:31:18,237 INFO L87 Difference]: Start difference. First operand 2133 states and 8224 transitions. Second operand 16 states. [2019-12-27 08:31:19,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:19,111 INFO L93 Difference]: Finished difference Result 5995 states and 18718 transitions. [2019-12-27 08:31:19,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:31:19,111 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 08:31:19,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:19,126 INFO L225 Difference]: With dead ends: 5995 [2019-12-27 08:31:19,126 INFO L226 Difference]: Without dead ends: 5991 [2019-12-27 08:31:19,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:31:19,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2019-12-27 08:31:19,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 2101. [2019-12-27 08:31:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-12-27 08:31:19,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 8089 transitions. [2019-12-27 08:31:19,274 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 8089 transitions. Word has length 21 [2019-12-27 08:31:19,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:19,275 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 8089 transitions. [2019-12-27 08:31:19,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:31:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 8089 transitions. [2019-12-27 08:31:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:31:19,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:19,277 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 08:31:19,480 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:19,480 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 08:31:19,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:19,481 INFO L82 PathProgramCache]: Analyzing trace with hash 275473203, now seen corresponding path program 2 times [2019-12-27 08:31:19,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:19,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270184071] [2019-12-27 08:31:19,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:19,573 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 08:31:19,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270184071] [2019-12-27 08:31:19,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693327779] [2019-12-27 08:31:19,573 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 08:31:19,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:31:19,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:31:19,662 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:31:19,664 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:19,774 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 08:31:19,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:19,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:31:19,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754252664] [2019-12-27 08:31:19,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:31:19,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:19,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:31:19,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:31:19,776 INFO L87 Difference]: Start difference. First operand 2101 states and 8089 transitions. Second operand 16 states. [2019-12-27 08:31:20,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:20,621 INFO L93 Difference]: Finished difference Result 5889 states and 18361 transitions. [2019-12-27 08:31:20,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:31:20,621 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 08:31:20,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:20,634 INFO L225 Difference]: With dead ends: 5889 [2019-12-27 08:31:20,634 INFO L226 Difference]: Without dead ends: 5883 [2019-12-27 08:31:20,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:31:20,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5883 states. [2019-12-27 08:31:20,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5883 to 2071. [2019-12-27 08:31:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-12-27 08:31:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7960 transitions. [2019-12-27 08:31:20,717 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7960 transitions. Word has length 21 [2019-12-27 08:31:20,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:20,717 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 7960 transitions. [2019-12-27 08:31:20,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:31:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7960 transitions. [2019-12-27 08:31:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:31:20,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:20,720 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:20,923 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:20,923 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 08:31:20,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:20,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1870977495, now seen corresponding path program 3 times [2019-12-27 08:31:20,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:20,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293460464] [2019-12-27 08:31:20,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:20,988 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 08:31:20,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293460464] [2019-12-27 08:31:20,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704215912] [2019-12-27 08:31:20,989 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 08:31:21,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 08:31:21,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:31:21,068 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:31:21,071 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:21,242 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 08:31:21,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:21,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:31:21,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311317900] [2019-12-27 08:31:21,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:31:21,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:21,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:31:21,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:31:21,244 INFO L87 Difference]: Start difference. First operand 2071 states and 7960 transitions. Second operand 16 states. [2019-12-27 08:31:22,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:22,031 INFO L93 Difference]: Finished difference Result 5888 states and 18357 transitions. [2019-12-27 08:31:22,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:31:22,032 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 08:31:22,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:22,041 INFO L225 Difference]: With dead ends: 5888 [2019-12-27 08:31:22,041 INFO L226 Difference]: Without dead ends: 5884 [2019-12-27 08:31:22,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:31:22,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5884 states. [2019-12-27 08:31:22,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5884 to 1997. [2019-12-27 08:31:22,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-12-27 08:31:22,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 7687 transitions. [2019-12-27 08:31:22,112 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 7687 transitions. Word has length 21 [2019-12-27 08:31:22,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:22,112 INFO L462 AbstractCegarLoop]: Abstraction has 1997 states and 7687 transitions. [2019-12-27 08:31:22,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:31:22,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 7687 transitions. [2019-12-27 08:31:22,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:31:22,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:22,114 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 08:31:22,325 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:22,325 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 08:31:22,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:22,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1852496535, now seen corresponding path program 4 times [2019-12-27 08:31:22,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:22,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542763112] [2019-12-27 08:31:22,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:22,385 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 08:31:22,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542763112] [2019-12-27 08:31:22,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246594743] [2019-12-27 08:31:22,386 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 08:31:22,465 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 08:31:22,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:31:22,467 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:31:22,469 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:22,598 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 08:31:22,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:22,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:31:22,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608040722] [2019-12-27 08:31:22,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:31:22,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:22,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:31:22,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:31:22,601 INFO L87 Difference]: Start difference. First operand 1997 states and 7687 transitions. Second operand 16 states. [2019-12-27 08:31:23,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:23,473 INFO L93 Difference]: Finished difference Result 5819 states and 18141 transitions. [2019-12-27 08:31:23,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:31:23,474 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 08:31:23,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:23,482 INFO L225 Difference]: With dead ends: 5819 [2019-12-27 08:31:23,482 INFO L226 Difference]: Without dead ends: 5813 [2019-12-27 08:31:23,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:31:23,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5813 states. [2019-12-27 08:31:23,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5813 to 1967. [2019-12-27 08:31:23,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-12-27 08:31:23,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 7558 transitions. [2019-12-27 08:31:23,548 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 7558 transitions. Word has length 21 [2019-12-27 08:31:23,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:23,549 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 7558 transitions. [2019-12-27 08:31:23,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:31:23,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 7558 transitions. [2019-12-27 08:31:23,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:31:23,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:23,551 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:23,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:23,754 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 08:31:23,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:23,755 INFO L82 PathProgramCache]: Analyzing trace with hash -748339188, now seen corresponding path program 1 times [2019-12-27 08:31:23,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:23,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957404501] [2019-12-27 08:31:23,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:23,820 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 08:31:23,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957404501] [2019-12-27 08:31:23,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:23,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:31:23,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374467590] [2019-12-27 08:31:23,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:31:23,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:23,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:31:23,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:31:23,822 INFO L87 Difference]: Start difference. First operand 1967 states and 7558 transitions. Second operand 5 states. [2019-12-27 08:31:23,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:23,940 INFO L93 Difference]: Finished difference Result 3010 states and 10835 transitions. [2019-12-27 08:31:23,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:31:23,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 08:31:23,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:23,949 INFO L225 Difference]: With dead ends: 3010 [2019-12-27 08:31:23,950 INFO L226 Difference]: Without dead ends: 2994 [2019-12-27 08:31:23,950 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 08:31:23,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2019-12-27 08:31:23,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2174. [2019-12-27 08:31:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2019-12-27 08:31:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 8201 transitions. [2019-12-27 08:31:24,003 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 8201 transitions. Word has length 21 [2019-12-27 08:31:24,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:24,004 INFO L462 AbstractCegarLoop]: Abstraction has 2174 states and 8201 transitions. [2019-12-27 08:31:24,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:31:24,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 8201 transitions. [2019-12-27 08:31:24,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:31:24,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:24,005 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:24,006 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 08:31:24,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:24,006 INFO L82 PathProgramCache]: Analyzing trace with hash -228501443, now seen corresponding path program 5 times [2019-12-27 08:31:24,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:24,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659551337] [2019-12-27 08:31:24,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:24,077 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 08:31:24,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659551337] [2019-12-27 08:31:24,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:24,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:31:24,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598546825] [2019-12-27 08:31:24,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:31:24,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:24,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:31:24,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:31:24,079 INFO L87 Difference]: Start difference. First operand 2174 states and 8201 transitions. Second operand 9 states. [2019-12-27 08:31:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:24,720 INFO L93 Difference]: Finished difference Result 6140 states and 19238 transitions. [2019-12-27 08:31:24,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:31:24,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:31:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:24,734 INFO L225 Difference]: With dead ends: 6140 [2019-12-27 08:31:24,734 INFO L226 Difference]: Without dead ends: 6133 [2019-12-27 08:31:24,735 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 08:31:24,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2019-12-27 08:31:24,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 2090. [2019-12-27 08:31:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2019-12-27 08:31:24,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7871 transitions. [2019-12-27 08:31:24,832 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7871 transitions. Word has length 21 [2019-12-27 08:31:24,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:24,832 INFO L462 AbstractCegarLoop]: Abstraction has 2090 states and 7871 transitions. [2019-12-27 08:31:24,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:31:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7871 transitions. [2019-12-27 08:31:24,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:31:24,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:24,834 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 08:31:24,834 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 08:31:24,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:24,835 INFO L82 PathProgramCache]: Analyzing trace with hash -241447043, now seen corresponding path program 6 times [2019-12-27 08:31:24,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:24,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026340035] [2019-12-27 08:31:24,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:24,911 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 08:31:24,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026340035] [2019-12-27 08:31:24,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:24,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:31:24,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46344613] [2019-12-27 08:31:24,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:31:24,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:24,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:31:24,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:31:24,913 INFO L87 Difference]: Start difference. First operand 2090 states and 7871 transitions. Second operand 9 states. [2019-12-27 08:31:25,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:25,670 INFO L93 Difference]: Finished difference Result 6012 states and 18787 transitions. [2019-12-27 08:31:25,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:31:25,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:31:25,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:25,680 INFO L225 Difference]: With dead ends: 6012 [2019-12-27 08:31:25,680 INFO L226 Difference]: Without dead ends: 6002 [2019-12-27 08:31:25,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:31:25,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2019-12-27 08:31:25,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 1965. [2019-12-27 08:31:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2019-12-27 08:31:25,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2019-12-27 08:31:25,764 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2019-12-27 08:31:25,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:25,765 INFO L462 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2019-12-27 08:31:25,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:31:25,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2019-12-27 08:31:25,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 08:31:25,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:25,767 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:25,767 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 08:31:25,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:25,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1727522141, now seen corresponding path program 1 times [2019-12-27 08:31:25,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:25,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79747830] [2019-12-27 08:31:25,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:31:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:31:25,791 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:31:25,791 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:31:25,792 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 08:31:25,792 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-27 08:31:25,804 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,804 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,805 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,805 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,805 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,805 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,805 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,805 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,806 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,806 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,806 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,806 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,806 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,806 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,806 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,807 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,807 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,807 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,807 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,807 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,807 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,807 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,808 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,808 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,808 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,808 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,808 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,808 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,809 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,809 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,809 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,809 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,809 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,809 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,809 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,810 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,810 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,810 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,810 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,810 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,810 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,811 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,811 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,811 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,811 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,811 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,811 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,811 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,812 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,812 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,812 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,812 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,812 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,812 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,813 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,813 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,813 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,813 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,813 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,813 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,813 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,814 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,814 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,814 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,814 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,814 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,814 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,815 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,815 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,815 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,815 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,815 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,815 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,815 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,816 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,816 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,816 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,816 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,816 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,816 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,817 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,817 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,817 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,817 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,817 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,818 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,818 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,818 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,818 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,818 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,820 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,820 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,820 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,821 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,821 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,822 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,822 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,822 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,823 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,823 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,825 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,825 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,825 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,826 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,826 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,828 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,828 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,828 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,829 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,829 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,830 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,830 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,830 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,830 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,830 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,831 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,832 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,832 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,832 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,832 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,832 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,833 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,834 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,834 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,834 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,834 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,834 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,835 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,836 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,836 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,836 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,837 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,837 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,837 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,839 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,839 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,839 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,839 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,840 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,840 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:31:25,842 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 08:31:25,842 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:31:25,842 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:31:25,843 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:31:25,843 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:31:25,843 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:31:25,843 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:31:25,843 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:31:25,843 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:31:25,845 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 117 transitions [2019-12-27 08:31:25,845 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 133 places, 117 transitions [2019-12-27 08:31:25,866 INFO L132 PetriNetUnfolder]: 7/147 cut-off events. [2019-12-27 08:31:25,866 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 08:31:25,869 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 08:31:25,875 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 133 places, 117 transitions [2019-12-27 08:31:25,900 INFO L132 PetriNetUnfolder]: 7/147 cut-off events. [2019-12-27 08:31:25,900 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 08:31:25,903 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 08:31:25,911 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2264 [2019-12-27 08:31:25,911 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:31:27,500 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-27 08:31:27,739 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2604 [2019-12-27 08:31:27,740 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 08:31:27,740 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 39 transitions [2019-12-27 08:31:28,037 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2019-12-27 08:31:28,037 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2019-12-27 08:31:28,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 08:31:28,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:28,038 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 08:31:28,038 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 08:31:28,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:28,038 INFO L82 PathProgramCache]: Analyzing trace with hash 963853, now seen corresponding path program 1 times [2019-12-27 08:31:28,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:28,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897572268] [2019-12-27 08:31:28,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:28,060 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 08:31:28,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897572268] [2019-12-27 08:31:28,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:28,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:31:28,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610666685] [2019-12-27 08:31:28,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:31:28,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:28,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:31:28,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:31:28,061 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2019-12-27 08:31:28,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:28,140 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2019-12-27 08:31:28,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:31:28,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 08:31:28,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:28,158 INFO L225 Difference]: With dead ends: 5844 [2019-12-27 08:31:28,159 INFO L226 Difference]: Without dead ends: 5479 [2019-12-27 08:31:28,159 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 08:31:28,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2019-12-27 08:31:28,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5299. [2019-12-27 08:31:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-27 08:31:28,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 24031 transitions. [2019-12-27 08:31:28,273 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 24031 transitions. Word has length 3 [2019-12-27 08:31:28,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:28,273 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 24031 transitions. [2019-12-27 08:31:28,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:31:28,274 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 24031 transitions. [2019-12-27 08:31:28,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 08:31:28,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:28,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:28,274 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 08:31:28,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:28,275 INFO L82 PathProgramCache]: Analyzing trace with hash 91439009, now seen corresponding path program 1 times [2019-12-27 08:31:28,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:28,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852439697] [2019-12-27 08:31:28,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:28,319 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 08:31:28,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852439697] [2019-12-27 08:31:28,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:28,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:31:28,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590177430] [2019-12-27 08:31:28,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:31:28,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:28,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:31:28,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:31:28,321 INFO L87 Difference]: Start difference. First operand 5299 states and 24031 transitions. Second operand 5 states. [2019-12-27 08:31:28,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:28,478 INFO L93 Difference]: Finished difference Result 9358 states and 39616 transitions. [2019-12-27 08:31:28,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:31:28,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 08:31:28,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:28,516 INFO L225 Difference]: With dead ends: 9358 [2019-12-27 08:31:28,516 INFO L226 Difference]: Without dead ends: 9355 [2019-12-27 08:31:28,517 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 08:31:28,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9355 states. [2019-12-27 08:31:28,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9355 to 6120. [2019-12-27 08:31:28,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2019-12-27 08:31:28,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 28016 transitions. [2019-12-27 08:31:28,767 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 28016 transitions. Word has length 9 [2019-12-27 08:31:28,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:28,768 INFO L462 AbstractCegarLoop]: Abstraction has 6120 states and 28016 transitions. [2019-12-27 08:31:28,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:31:28,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 28016 transitions. [2019-12-27 08:31:28,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 08:31:28,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:28,769 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:28,769 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 08:31:28,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:28,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1001063187, now seen corresponding path program 1 times [2019-12-27 08:31:28,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:28,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150025840] [2019-12-27 08:31:28,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:29,447 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 08:31:29,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150025840] [2019-12-27 08:31:29,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:29,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:31:29,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202552298] [2019-12-27 08:31:29,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:31:29,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:29,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:31:29,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:31:29,449 INFO L87 Difference]: Start difference. First operand 6120 states and 28016 transitions. Second operand 5 states. [2019-12-27 08:31:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:29,611 INFO L93 Difference]: Finished difference Result 10720 states and 46025 transitions. [2019-12-27 08:31:29,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:31:29,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 08:31:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:29,638 INFO L225 Difference]: With dead ends: 10720 [2019-12-27 08:31:29,638 INFO L226 Difference]: Without dead ends: 10716 [2019-12-27 08:31:29,640 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 08:31:29,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10716 states. [2019-12-27 08:31:29,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10716 to 7145. [2019-12-27 08:31:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-12-27 08:31:29,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 33093 transitions. [2019-12-27 08:31:29,849 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 33093 transitions. Word has length 13 [2019-12-27 08:31:29,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:29,849 INFO L462 AbstractCegarLoop]: Abstraction has 7145 states and 33093 transitions. [2019-12-27 08:31:29,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:31:29,850 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 33093 transitions. [2019-12-27 08:31:29,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 08:31:29,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:29,850 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:29,850 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 08:31:29,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:29,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1798371701, now seen corresponding path program 1 times [2019-12-27 08:31:29,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:29,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067564089] [2019-12-27 08:31:29,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:29,904 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 08:31:29,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067564089] [2019-12-27 08:31:29,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695170842] [2019-12-27 08:31:29,905 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 08:31:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:29,974 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 08:31:29,975 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:30,032 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 08:31:30,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:30,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 08:31:30,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852498083] [2019-12-27 08:31:30,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:31:30,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:30,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:31:30,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:31:30,034 INFO L87 Difference]: Start difference. First operand 7145 states and 33093 transitions. Second operand 12 states. [2019-12-27 08:31:30,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:30,445 INFO L93 Difference]: Finished difference Result 16250 states and 64977 transitions. [2019-12-27 08:31:30,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:31:30,445 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-27 08:31:30,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:30,480 INFO L225 Difference]: With dead ends: 16250 [2019-12-27 08:31:30,481 INFO L226 Difference]: Without dead ends: 16246 [2019-12-27 08:31:30,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:31:30,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16246 states. [2019-12-27 08:31:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16246 to 7067. [2019-12-27 08:31:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7067 states. [2019-12-27 08:31:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7067 states to 7067 states and 32681 transitions. [2019-12-27 08:31:30,811 INFO L78 Accepts]: Start accepts. Automaton has 7067 states and 32681 transitions. Word has length 15 [2019-12-27 08:31:30,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:30,811 INFO L462 AbstractCegarLoop]: Abstraction has 7067 states and 32681 transitions. [2019-12-27 08:31:30,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:31:30,811 INFO L276 IsEmpty]: Start isEmpty. Operand 7067 states and 32681 transitions. [2019-12-27 08:31:30,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 08:31:30,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:30,812 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:31,014 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:31,015 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 08:31:31,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:31,016 INFO L82 PathProgramCache]: Analyzing trace with hash -50954293, now seen corresponding path program 2 times [2019-12-27 08:31:31,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:31,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438565710] [2019-12-27 08:31:31,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:31,069 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 08:31:31,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438565710] [2019-12-27 08:31:31,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:31,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:31:31,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845371569] [2019-12-27 08:31:31,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:31:31,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:31,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:31:31,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:31:31,071 INFO L87 Difference]: Start difference. First operand 7067 states and 32681 transitions. Second operand 7 states. [2019-12-27 08:31:31,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:31,391 INFO L93 Difference]: Finished difference Result 16584 states and 66357 transitions. [2019-12-27 08:31:31,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:31:31,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 08:31:31,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:31,428 INFO L225 Difference]: With dead ends: 16584 [2019-12-27 08:31:31,428 INFO L226 Difference]: Without dead ends: 16579 [2019-12-27 08:31:31,428 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 08:31:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16579 states. [2019-12-27 08:31:31,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16579 to 6836. [2019-12-27 08:31:31,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6836 states. [2019-12-27 08:31:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 31606 transitions. [2019-12-27 08:31:31,634 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 31606 transitions. Word has length 15 [2019-12-27 08:31:31,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:31,634 INFO L462 AbstractCegarLoop]: Abstraction has 6836 states and 31606 transitions. [2019-12-27 08:31:31,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:31:31,634 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 31606 transitions. [2019-12-27 08:31:31,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 08:31:31,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:31,635 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:31,635 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 08:31:31,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:31,635 INFO L82 PathProgramCache]: Analyzing trace with hash 2086390321, now seen corresponding path program 1 times [2019-12-27 08:31:31,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:31,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663592660] [2019-12-27 08:31:31,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:31,665 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 08:31:31,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663592660] [2019-12-27 08:31:31,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:31,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:31:31,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965494035] [2019-12-27 08:31:31,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:31:31,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:31,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:31:31,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:31:31,667 INFO L87 Difference]: Start difference. First operand 6836 states and 31606 transitions. Second operand 5 states. [2019-12-27 08:31:31,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:31,782 INFO L93 Difference]: Finished difference Result 11876 states and 51707 transitions. [2019-12-27 08:31:31,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:31:31,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 08:31:31,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:31,810 INFO L225 Difference]: With dead ends: 11876 [2019-12-27 08:31:31,811 INFO L226 Difference]: Without dead ends: 11868 [2019-12-27 08:31:31,811 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 08:31:31,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2019-12-27 08:31:31,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 8095. [2019-12-27 08:31:31,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8095 states. [2019-12-27 08:31:32,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8095 states to 8095 states and 37697 transitions. [2019-12-27 08:31:32,168 INFO L78 Accepts]: Start accepts. Automaton has 8095 states and 37697 transitions. Word has length 17 [2019-12-27 08:31:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:32,169 INFO L462 AbstractCegarLoop]: Abstraction has 8095 states and 37697 transitions. [2019-12-27 08:31:32,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:31:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 8095 states and 37697 transitions. [2019-12-27 08:31:32,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:31:32,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:32,170 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:32,170 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 08:31:32,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:32,171 INFO L82 PathProgramCache]: Analyzing trace with hash 2036081631, now seen corresponding path program 1 times [2019-12-27 08:31:32,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:32,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584342365] [2019-12-27 08:31:32,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:32,216 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 08:31:32,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584342365] [2019-12-27 08:31:32,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953431312] [2019-12-27 08:31:32,216 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 08:31:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:32,299 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 08:31:32,300 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:32,379 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 08:31:32,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:32,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 08:31:32,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012855780] [2019-12-27 08:31:32,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:31:32,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:32,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:31:32,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:31:32,381 INFO L87 Difference]: Start difference. First operand 8095 states and 37697 transitions. Second operand 12 states. [2019-12-27 08:31:32,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:32,725 INFO L93 Difference]: Finished difference Result 18509 states and 75177 transitions. [2019-12-27 08:31:32,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:31:32,726 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-27 08:31:32,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:32,766 INFO L225 Difference]: With dead ends: 18509 [2019-12-27 08:31:32,766 INFO L226 Difference]: Without dead ends: 18503 [2019-12-27 08:31:32,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:31:32,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18503 states. [2019-12-27 08:31:32,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18503 to 8204. [2019-12-27 08:31:32,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2019-12-27 08:31:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 38127 transitions. [2019-12-27 08:31:32,993 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 38127 transitions. Word has length 19 [2019-12-27 08:31:32,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:32,994 INFO L462 AbstractCegarLoop]: Abstraction has 8204 states and 38127 transitions. [2019-12-27 08:31:32,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:31:32,994 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 38127 transitions. [2019-12-27 08:31:32,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:31:32,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:32,997 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:33,200 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:33,201 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 08:31:33,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:33,201 INFO L82 PathProgramCache]: Analyzing trace with hash -728631447, now seen corresponding path program 2 times [2019-12-27 08:31:33,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:33,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664748011] [2019-12-27 08:31:33,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:33,266 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 08:31:33,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664748011] [2019-12-27 08:31:33,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:33,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:31:33,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658070661] [2019-12-27 08:31:33,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:31:33,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:33,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:31:33,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:31:33,267 INFO L87 Difference]: Start difference. First operand 8204 states and 38127 transitions. Second operand 7 states. [2019-12-27 08:31:33,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:33,707 INFO L93 Difference]: Finished difference Result 18912 states and 76848 transitions. [2019-12-27 08:31:33,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:31:33,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 08:31:33,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:33,774 INFO L225 Difference]: With dead ends: 18912 [2019-12-27 08:31:33,774 INFO L226 Difference]: Without dead ends: 18903 [2019-12-27 08:31:33,774 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 08:31:33,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18903 states. [2019-12-27 08:31:34,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18903 to 7911. [2019-12-27 08:31:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7911 states. [2019-12-27 08:31:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7911 states to 7911 states and 36783 transitions. [2019-12-27 08:31:34,162 INFO L78 Accepts]: Start accepts. Automaton has 7911 states and 36783 transitions. Word has length 19 [2019-12-27 08:31:34,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:34,163 INFO L462 AbstractCegarLoop]: Abstraction has 7911 states and 36783 transitions. [2019-12-27 08:31:34,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:31:34,163 INFO L276 IsEmpty]: Start isEmpty. Operand 7911 states and 36783 transitions. [2019-12-27 08:31:34,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:31:34,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:34,164 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:34,164 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 08:31:34,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:34,164 INFO L82 PathProgramCache]: Analyzing trace with hash -728623232, now seen corresponding path program 1 times [2019-12-27 08:31:34,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:34,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822431232] [2019-12-27 08:31:34,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:34,205 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 08:31:34,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822431232] [2019-12-27 08:31:34,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:34,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:31:34,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722958916] [2019-12-27 08:31:34,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:31:34,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:34,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:31:34,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:31:34,207 INFO L87 Difference]: Start difference. First operand 7911 states and 36783 transitions. Second operand 7 states. [2019-12-27 08:31:34,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:34,547 INFO L93 Difference]: Finished difference Result 18895 states and 76839 transitions. [2019-12-27 08:31:34,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:31:34,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 08:31:34,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:34,591 INFO L225 Difference]: With dead ends: 18895 [2019-12-27 08:31:34,591 INFO L226 Difference]: Without dead ends: 18886 [2019-12-27 08:31:34,592 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 08:31:34,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18886 states. [2019-12-27 08:31:34,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18886 to 8150. [2019-12-27 08:31:34,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8150 states. [2019-12-27 08:31:34,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8150 states to 8150 states and 37871 transitions. [2019-12-27 08:31:34,841 INFO L78 Accepts]: Start accepts. Automaton has 8150 states and 37871 transitions. Word has length 19 [2019-12-27 08:31:34,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:34,841 INFO L462 AbstractCegarLoop]: Abstraction has 8150 states and 37871 transitions. [2019-12-27 08:31:34,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:31:34,841 INFO L276 IsEmpty]: Start isEmpty. Operand 8150 states and 37871 transitions. [2019-12-27 08:31:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:31:34,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:34,842 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:34,842 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 08:31:34,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:34,842 INFO L82 PathProgramCache]: Analyzing trace with hash -718028672, now seen corresponding path program 2 times [2019-12-27 08:31:34,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:34,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763298557] [2019-12-27 08:31:34,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:34,905 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 08:31:34,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763298557] [2019-12-27 08:31:34,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:34,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:31:34,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911057842] [2019-12-27 08:31:34,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:31:34,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:34,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:31:34,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:31:34,907 INFO L87 Difference]: Start difference. First operand 8150 states and 37871 transitions. Second operand 7 states. [2019-12-27 08:31:35,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:35,234 INFO L93 Difference]: Finished difference Result 19087 states and 77644 transitions. [2019-12-27 08:31:35,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:31:35,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 08:31:35,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:35,277 INFO L225 Difference]: With dead ends: 19087 [2019-12-27 08:31:35,277 INFO L226 Difference]: Without dead ends: 19078 [2019-12-27 08:31:35,277 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 08:31:35,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19078 states. [2019-12-27 08:31:35,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19078 to 8107. [2019-12-27 08:31:35,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8107 states. [2019-12-27 08:31:35,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8107 states to 8107 states and 37697 transitions. [2019-12-27 08:31:35,666 INFO L78 Accepts]: Start accepts. Automaton has 8107 states and 37697 transitions. Word has length 19 [2019-12-27 08:31:35,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:35,666 INFO L462 AbstractCegarLoop]: Abstraction has 8107 states and 37697 transitions. [2019-12-27 08:31:35,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:31:35,667 INFO L276 IsEmpty]: Start isEmpty. Operand 8107 states and 37697 transitions. [2019-12-27 08:31:35,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:31:35,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:35,668 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 08:31:35,668 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 08:31:35,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:35,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1830634066, now seen corresponding path program 1 times [2019-12-27 08:31:35,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:35,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684741212] [2019-12-27 08:31:35,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:35,745 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 08:31:35,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684741212] [2019-12-27 08:31:35,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902644457] [2019-12-27 08:31:35,746 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 08:31:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:35,821 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:31:35,822 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:35,919 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 08:31:35,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:35,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:31:35,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227228737] [2019-12-27 08:31:35,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:31:35,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:35,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:31:35,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:31:35,921 INFO L87 Difference]: Start difference. First operand 8107 states and 37697 transitions. Second operand 16 states. [2019-12-27 08:31:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:36,987 INFO L93 Difference]: Finished difference Result 26399 states and 100480 transitions. [2019-12-27 08:31:36,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:31:36,987 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 08:31:36,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:37,045 INFO L225 Difference]: With dead ends: 26399 [2019-12-27 08:31:37,046 INFO L226 Difference]: Without dead ends: 26395 [2019-12-27 08:31:37,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:31:37,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26395 states. [2019-12-27 08:31:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26395 to 8003. [2019-12-27 08:31:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8003 states. [2019-12-27 08:31:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8003 states to 8003 states and 37166 transitions. [2019-12-27 08:31:37,347 INFO L78 Accepts]: Start accepts. Automaton has 8003 states and 37166 transitions. Word has length 21 [2019-12-27 08:31:37,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:37,348 INFO L462 AbstractCegarLoop]: Abstraction has 8003 states and 37166 transitions. [2019-12-27 08:31:37,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:31:37,348 INFO L276 IsEmpty]: Start isEmpty. Operand 8003 states and 37166 transitions. [2019-12-27 08:31:37,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:31:37,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:37,349 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 08:31:37,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:37,550 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 08:31:37,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:37,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1820039506, now seen corresponding path program 2 times [2019-12-27 08:31:37,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:37,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293401734] [2019-12-27 08:31:37,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:37,613 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 08:31:37,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293401734] [2019-12-27 08:31:37,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99658800] [2019-12-27 08:31:37,614 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 08:31:37,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:31:37,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:31:37,706 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:31:37,708 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:37,843 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 08:31:37,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:37,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:31:37,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233046563] [2019-12-27 08:31:37,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:31:37,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:37,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:31:37,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:31:37,845 INFO L87 Difference]: Start difference. First operand 8003 states and 37166 transitions. Second operand 16 states. [2019-12-27 08:31:39,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:39,148 INFO L93 Difference]: Finished difference Result 26117 states and 99264 transitions. [2019-12-27 08:31:39,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:31:39,149 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 08:31:39,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:39,229 INFO L225 Difference]: With dead ends: 26117 [2019-12-27 08:31:39,229 INFO L226 Difference]: Without dead ends: 26111 [2019-12-27 08:31:39,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:31:39,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26111 states. [2019-12-27 08:31:39,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26111 to 7893. [2019-12-27 08:31:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7893 states. [2019-12-27 08:31:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 36616 transitions. [2019-12-27 08:31:39,567 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 36616 transitions. Word has length 21 [2019-12-27 08:31:39,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:39,567 INFO L462 AbstractCegarLoop]: Abstraction has 7893 states and 36616 transitions. [2019-12-27 08:31:39,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:31:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 36616 transitions. [2019-12-27 08:31:39,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:31:39,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:39,568 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:39,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:39,769 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 08:31:39,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:39,770 INFO L82 PathProgramCache]: Analyzing trace with hash -135145800, now seen corresponding path program 3 times [2019-12-27 08:31:39,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:39,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616484813] [2019-12-27 08:31:39,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:39,841 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 08:31:39,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616484813] [2019-12-27 08:31:39,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:39,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:31:39,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766861957] [2019-12-27 08:31:39,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:31:39,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:39,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:31:39,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:31:39,843 INFO L87 Difference]: Start difference. First operand 7893 states and 36616 transitions. Second operand 9 states. [2019-12-27 08:31:40,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:40,727 INFO L93 Difference]: Finished difference Result 26136 states and 99362 transitions. [2019-12-27 08:31:40,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:31:40,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:31:40,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:40,788 INFO L225 Difference]: With dead ends: 26136 [2019-12-27 08:31:40,789 INFO L226 Difference]: Without dead ends: 26132 [2019-12-27 08:31:40,789 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 08:31:40,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26132 states. [2019-12-27 08:31:41,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26132 to 7683. [2019-12-27 08:31:41,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7683 states. [2019-12-27 08:31:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7683 states to 7683 states and 35650 transitions. [2019-12-27 08:31:41,225 INFO L78 Accepts]: Start accepts. Automaton has 7683 states and 35650 transitions. Word has length 21 [2019-12-27 08:31:41,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:41,226 INFO L462 AbstractCegarLoop]: Abstraction has 7683 states and 35650 transitions. [2019-12-27 08:31:41,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:31:41,226 INFO L276 IsEmpty]: Start isEmpty. Operand 7683 states and 35650 transitions. [2019-12-27 08:31:41,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:31:41,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:41,227 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 08:31:41,227 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 08:31:41,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:41,227 INFO L82 PathProgramCache]: Analyzing trace with hash -127259400, now seen corresponding path program 4 times [2019-12-27 08:31:41,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:41,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374333131] [2019-12-27 08:31:41,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:41,285 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 08:31:41,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374333131] [2019-12-27 08:31:41,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:41,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:31:41,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479049050] [2019-12-27 08:31:41,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:31:41,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:41,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:31:41,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:31:41,287 INFO L87 Difference]: Start difference. First operand 7683 states and 35650 transitions. Second operand 9 states. [2019-12-27 08:31:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:42,095 INFO L93 Difference]: Finished difference Result 25967 states and 98669 transitions. [2019-12-27 08:31:42,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:31:42,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:31:42,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:42,157 INFO L225 Difference]: With dead ends: 25967 [2019-12-27 08:31:42,157 INFO L226 Difference]: Without dead ends: 25961 [2019-12-27 08:31:42,158 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 08:31:42,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25961 states. [2019-12-27 08:31:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25961 to 7577. [2019-12-27 08:31:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7577 states. [2019-12-27 08:31:42,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7577 states to 7577 states and 35112 transitions. [2019-12-27 08:31:42,454 INFO L78 Accepts]: Start accepts. Automaton has 7577 states and 35112 transitions. Word has length 21 [2019-12-27 08:31:42,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:42,455 INFO L462 AbstractCegarLoop]: Abstraction has 7577 states and 35112 transitions. [2019-12-27 08:31:42,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:31:42,455 INFO L276 IsEmpty]: Start isEmpty. Operand 7577 states and 35112 transitions. [2019-12-27 08:31:42,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:31:42,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:42,457 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:42,457 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 08:31:42,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:42,457 INFO L82 PathProgramCache]: Analyzing trace with hash 980776630, now seen corresponding path program 1 times [2019-12-27 08:31:42,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:42,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627235355] [2019-12-27 08:31:42,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:42,498 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 08:31:42,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627235355] [2019-12-27 08:31:42,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:42,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:31:42,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193921224] [2019-12-27 08:31:42,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:31:42,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:42,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:31:42,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:31:42,499 INFO L87 Difference]: Start difference. First operand 7577 states and 35112 transitions. Second operand 5 states. [2019-12-27 08:31:42,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:42,684 INFO L93 Difference]: Finished difference Result 12960 states and 56912 transitions. [2019-12-27 08:31:42,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:31:42,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 08:31:42,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:42,726 INFO L225 Difference]: With dead ends: 12960 [2019-12-27 08:31:42,726 INFO L226 Difference]: Without dead ends: 12944 [2019-12-27 08:31:42,727 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 08:31:42,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12944 states. [2019-12-27 08:31:42,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12944 to 9056. [2019-12-27 08:31:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9056 states. [2019-12-27 08:31:42,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9056 states to 9056 states and 41951 transitions. [2019-12-27 08:31:42,929 INFO L78 Accepts]: Start accepts. Automaton has 9056 states and 41951 transitions. Word has length 21 [2019-12-27 08:31:42,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:42,929 INFO L462 AbstractCegarLoop]: Abstraction has 9056 states and 41951 transitions. [2019-12-27 08:31:42,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:31:42,929 INFO L276 IsEmpty]: Start isEmpty. Operand 9056 states and 41951 transitions. [2019-12-27 08:31:42,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:31:42,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:42,930 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 08:31:42,931 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 08:31:42,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:42,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1464178168, now seen corresponding path program 5 times [2019-12-27 08:31:42,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:42,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087138911] [2019-12-27 08:31:42,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:43,001 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 08:31:43,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087138911] [2019-12-27 08:31:43,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:43,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:31:43,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988891845] [2019-12-27 08:31:43,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:31:43,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:43,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:31:43,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:31:43,003 INFO L87 Difference]: Start difference. First operand 9056 states and 41951 transitions. Second operand 9 states. [2019-12-27 08:31:44,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:44,046 INFO L93 Difference]: Finished difference Result 29260 states and 112921 transitions. [2019-12-27 08:31:44,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:31:44,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:31:44,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:44,124 INFO L225 Difference]: With dead ends: 29260 [2019-12-27 08:31:44,124 INFO L226 Difference]: Without dead ends: 29253 [2019-12-27 08:31:44,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:31:44,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29253 states. [2019-12-27 08:31:44,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29253 to 8780. [2019-12-27 08:31:44,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8780 states. [2019-12-27 08:31:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8780 states to 8780 states and 40645 transitions. [2019-12-27 08:31:44,456 INFO L78 Accepts]: Start accepts. Automaton has 8780 states and 40645 transitions. Word has length 21 [2019-12-27 08:31:44,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:44,456 INFO L462 AbstractCegarLoop]: Abstraction has 8780 states and 40645 transitions. [2019-12-27 08:31:44,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:31:44,456 INFO L276 IsEmpty]: Start isEmpty. Operand 8780 states and 40645 transitions. [2019-12-27 08:31:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:31:44,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:44,458 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 08:31:44,458 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 08:31:44,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:44,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1466886328, now seen corresponding path program 6 times [2019-12-27 08:31:44,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:44,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521901028] [2019-12-27 08:31:44,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 08:31:44,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521901028] [2019-12-27 08:31:44,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:44,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:31:44,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084674344] [2019-12-27 08:31:44,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:31:44,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:44,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:31:44,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:31:44,525 INFO L87 Difference]: Start difference. First operand 8780 states and 40645 transitions. Second operand 9 states. [2019-12-27 08:31:45,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:45,389 INFO L93 Difference]: Finished difference Result 28874 states and 111219 transitions. [2019-12-27 08:31:45,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:31:45,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:31:45,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:45,452 INFO L225 Difference]: With dead ends: 28874 [2019-12-27 08:31:45,453 INFO L226 Difference]: Without dead ends: 28864 [2019-12-27 08:31:45,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:31:45,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28864 states. [2019-12-27 08:31:45,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28864 to 8405. [2019-12-27 08:31:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8405 states. [2019-12-27 08:31:45,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8405 states to 8405 states and 38987 transitions. [2019-12-27 08:31:45,774 INFO L78 Accepts]: Start accepts. Automaton has 8405 states and 38987 transitions. Word has length 21 [2019-12-27 08:31:45,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:45,774 INFO L462 AbstractCegarLoop]: Abstraction has 8405 states and 38987 transitions. [2019-12-27 08:31:45,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:31:45,775 INFO L276 IsEmpty]: Start isEmpty. Operand 8405 states and 38987 transitions. [2019-12-27 08:31:45,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:31:45,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:45,776 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:45,776 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 08:31:45,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:45,777 INFO L82 PathProgramCache]: Analyzing trace with hash 792940754, now seen corresponding path program 1 times [2019-12-27 08:31:45,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:45,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812442322] [2019-12-27 08:31:45,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:45,833 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 08:31:45,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812442322] [2019-12-27 08:31:45,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669080994] [2019-12-27 08:31:45,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 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 08:31:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:45,924 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 08:31:45,925 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:45,995 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 08:31:45,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:45,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 08:31:45,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147754460] [2019-12-27 08:31:45,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:31:45,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:45,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:31:45,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:31:45,996 INFO L87 Difference]: Start difference. First operand 8405 states and 38987 transitions. Second operand 12 states. [2019-12-27 08:31:46,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:46,499 INFO L93 Difference]: Finished difference Result 19371 states and 79602 transitions. [2019-12-27 08:31:46,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:31:46,499 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 08:31:46,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:46,541 INFO L225 Difference]: With dead ends: 19371 [2019-12-27 08:31:46,541 INFO L226 Difference]: Without dead ends: 19359 [2019-12-27 08:31:46,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:31:46,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19359 states. [2019-12-27 08:31:46,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19359 to 8674. [2019-12-27 08:31:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-12-27 08:31:46,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 40123 transitions. [2019-12-27 08:31:46,776 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 40123 transitions. Word has length 23 [2019-12-27 08:31:46,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:46,776 INFO L462 AbstractCegarLoop]: Abstraction has 8674 states and 40123 transitions. [2019-12-27 08:31:46,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:31:46,776 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 40123 transitions. [2019-12-27 08:31:46,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:31:46,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:46,779 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:46,981 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:46,982 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 08:31:46,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:46,983 INFO L82 PathProgramCache]: Analyzing trace with hash 568712663, now seen corresponding path program 1 times [2019-12-27 08:31:46,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:46,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006584561] [2019-12-27 08:31:46,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:47,024 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 08:31:47,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006584561] [2019-12-27 08:31:47,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792897666] [2019-12-27 08:31:47,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 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 08:31:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:47,119 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 08:31:47,134 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:47,225 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 08:31:47,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:47,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 08:31:47,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657782006] [2019-12-27 08:31:47,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:31:47,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:47,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:31:47,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:31:47,230 INFO L87 Difference]: Start difference. First operand 8674 states and 40123 transitions. Second operand 12 states. [2019-12-27 08:31:47,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:47,712 INFO L93 Difference]: Finished difference Result 20307 states and 83553 transitions. [2019-12-27 08:31:47,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:31:47,712 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 08:31:47,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:47,757 INFO L225 Difference]: With dead ends: 20307 [2019-12-27 08:31:47,757 INFO L226 Difference]: Without dead ends: 20293 [2019-12-27 08:31:47,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:31:47,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20293 states. [2019-12-27 08:31:47,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20293 to 8934. [2019-12-27 08:31:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8934 states. [2019-12-27 08:31:48,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8934 states to 8934 states and 41293 transitions. [2019-12-27 08:31:48,007 INFO L78 Accepts]: Start accepts. Automaton has 8934 states and 41293 transitions. Word has length 23 [2019-12-27 08:31:48,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:48,008 INFO L462 AbstractCegarLoop]: Abstraction has 8934 states and 41293 transitions. [2019-12-27 08:31:48,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:31:48,008 INFO L276 IsEmpty]: Start isEmpty. Operand 8934 states and 41293 transitions. [2019-12-27 08:31:48,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:31:48,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:48,010 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:48,210 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:48,211 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 08:31:48,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:48,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1942317765, now seen corresponding path program 1 times [2019-12-27 08:31:48,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:48,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548837675] [2019-12-27 08:31:48,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:48,251 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 08:31:48,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548837675] [2019-12-27 08:31:48,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:48,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:31:48,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795706761] [2019-12-27 08:31:48,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:31:48,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:48,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:31:48,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:31:48,252 INFO L87 Difference]: Start difference. First operand 8934 states and 41293 transitions. Second operand 7 states. [2019-12-27 08:31:48,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:48,569 INFO L93 Difference]: Finished difference Result 21050 states and 86745 transitions. [2019-12-27 08:31:48,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:31:48,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 08:31:48,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:48,614 INFO L225 Difference]: With dead ends: 21050 [2019-12-27 08:31:48,615 INFO L226 Difference]: Without dead ends: 21031 [2019-12-27 08:31:48,615 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 08:31:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21031 states. [2019-12-27 08:31:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21031 to 9143. [2019-12-27 08:31:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9143 states. [2019-12-27 08:31:48,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9143 states to 9143 states and 42279 transitions. [2019-12-27 08:31:48,998 INFO L78 Accepts]: Start accepts. Automaton has 9143 states and 42279 transitions. Word has length 23 [2019-12-27 08:31:48,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:48,999 INFO L462 AbstractCegarLoop]: Abstraction has 9143 states and 42279 transitions. [2019-12-27 08:31:48,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:31:48,999 INFO L276 IsEmpty]: Start isEmpty. Operand 9143 states and 42279 transitions. [2019-12-27 08:31:49,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:31:49,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:49,001 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:49,001 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 08:31:49,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:49,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1928498089, now seen corresponding path program 2 times [2019-12-27 08:31:49,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:49,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637818614] [2019-12-27 08:31:49,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:49,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 08:31:49,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637818614] [2019-12-27 08:31:49,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:49,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:31:49,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141508820] [2019-12-27 08:31:49,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:31:49,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:49,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:31:49,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:31:49,037 INFO L87 Difference]: Start difference. First operand 9143 states and 42279 transitions. Second operand 7 states. [2019-12-27 08:31:49,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:49,375 INFO L93 Difference]: Finished difference Result 21118 states and 87107 transitions. [2019-12-27 08:31:49,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:31:49,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 08:31:49,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:49,421 INFO L225 Difference]: With dead ends: 21118 [2019-12-27 08:31:49,421 INFO L226 Difference]: Without dead ends: 21099 [2019-12-27 08:31:49,421 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 08:31:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21099 states. [2019-12-27 08:31:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21099 to 9234. [2019-12-27 08:31:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-12-27 08:31:49,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 42669 transitions. [2019-12-27 08:31:49,686 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 42669 transitions. Word has length 23 [2019-12-27 08:31:49,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:49,686 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 42669 transitions. [2019-12-27 08:31:49,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:31:49,686 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 42669 transitions. [2019-12-27 08:31:49,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:31:49,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:49,689 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:49,689 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 08:31:49,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:49,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1928500910, now seen corresponding path program 2 times [2019-12-27 08:31:49,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:49,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942798430] [2019-12-27 08:31:49,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 08:31:49,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942798430] [2019-12-27 08:31:49,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:49,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:31:49,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738712351] [2019-12-27 08:31:49,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:31:49,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:49,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:31:49,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:31:49,736 INFO L87 Difference]: Start difference. First operand 9234 states and 42669 transitions. Second operand 7 states. [2019-12-27 08:31:50,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:50,082 INFO L93 Difference]: Finished difference Result 20904 states and 85935 transitions. [2019-12-27 08:31:50,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:31:50,083 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 08:31:50,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:50,132 INFO L225 Difference]: With dead ends: 20904 [2019-12-27 08:31:50,132 INFO L226 Difference]: Without dead ends: 20885 [2019-12-27 08:31:50,133 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 08:31:50,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20885 states. [2019-12-27 08:31:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20885 to 9243. [2019-12-27 08:31:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9243 states. [2019-12-27 08:31:50,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9243 states to 9243 states and 42683 transitions. [2019-12-27 08:31:50,384 INFO L78 Accepts]: Start accepts. Automaton has 9243 states and 42683 transitions. Word has length 23 [2019-12-27 08:31:50,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:50,384 INFO L462 AbstractCegarLoop]: Abstraction has 9243 states and 42683 transitions. [2019-12-27 08:31:50,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:31:50,384 INFO L276 IsEmpty]: Start isEmpty. Operand 9243 states and 42683 transitions. [2019-12-27 08:31:50,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:31:50,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:50,386 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:50,386 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 08:31:50,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:50,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1928509125, now seen corresponding path program 2 times [2019-12-27 08:31:50,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:50,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386808137] [2019-12-27 08:31:50,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:50,450 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 08:31:50,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386808137] [2019-12-27 08:31:50,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:31:50,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:31:50,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055060295] [2019-12-27 08:31:50,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:31:50,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:50,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:31:50,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:31:50,452 INFO L87 Difference]: Start difference. First operand 9243 states and 42683 transitions. Second operand 7 states. [2019-12-27 08:31:50,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:50,807 INFO L93 Difference]: Finished difference Result 20784 states and 85269 transitions. [2019-12-27 08:31:50,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:31:50,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 08:31:50,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:50,857 INFO L225 Difference]: With dead ends: 20784 [2019-12-27 08:31:50,857 INFO L226 Difference]: Without dead ends: 20765 [2019-12-27 08:31:50,857 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 08:31:50,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20765 states. [2019-12-27 08:31:51,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20765 to 9286. [2019-12-27 08:31:51,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9286 states. [2019-12-27 08:31:51,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 42799 transitions. [2019-12-27 08:31:51,175 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 42799 transitions. Word has length 23 [2019-12-27 08:31:51,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:51,175 INFO L462 AbstractCegarLoop]: Abstraction has 9286 states and 42799 transitions. [2019-12-27 08:31:51,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:31:51,175 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 42799 transitions. [2019-12-27 08:31:51,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:31:51,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:51,179 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 08:31:51,179 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 08:31:51,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:51,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1810061765, now seen corresponding path program 1 times [2019-12-27 08:31:51,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:51,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302410570] [2019-12-27 08:31:51,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:51,264 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 08:31:51,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302410570] [2019-12-27 08:31:51,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346975821] [2019-12-27 08:31:51,265 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 08:31:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:51,513 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:31:51,517 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:51,611 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 08:31:51,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:51,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:31:51,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629482769] [2019-12-27 08:31:51,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:31:51,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:51,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:31:51,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:31:51,613 INFO L87 Difference]: Start difference. First operand 9286 states and 42799 transitions. Second operand 16 states. [2019-12-27 08:31:52,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:52,506 INFO L93 Difference]: Finished difference Result 29793 states and 115235 transitions. [2019-12-27 08:31:52,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:31:52,507 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 08:31:52,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:52,568 INFO L225 Difference]: With dead ends: 29793 [2019-12-27 08:31:52,568 INFO L226 Difference]: Without dead ends: 29783 [2019-12-27 08:31:52,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:31:52,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29783 states. [2019-12-27 08:31:52,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29783 to 9208. [2019-12-27 08:31:52,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9208 states. [2019-12-27 08:31:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9208 states to 9208 states and 42351 transitions. [2019-12-27 08:31:52,885 INFO L78 Accepts]: Start accepts. Automaton has 9208 states and 42351 transitions. Word has length 25 [2019-12-27 08:31:52,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:52,886 INFO L462 AbstractCegarLoop]: Abstraction has 9208 states and 42351 transitions. [2019-12-27 08:31:52,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:31:52,886 INFO L276 IsEmpty]: Start isEmpty. Operand 9208 states and 42351 transitions. [2019-12-27 08:31:52,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:31:52,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:52,889 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:53,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:53,089 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 08:31:53,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:53,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1820667361, now seen corresponding path program 1 times [2019-12-27 08:31:53,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:53,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259832754] [2019-12-27 08:31:53,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:53,149 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 08:31:53,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259832754] [2019-12-27 08:31:53,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743962907] [2019-12-27 08:31:53,149 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 08:31:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:53,226 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:31:53,227 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:53,322 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 08:31:53,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:53,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:31:53,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035677246] [2019-12-27 08:31:53,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:31:53,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:53,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:31:53,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:31:53,323 INFO L87 Difference]: Start difference. First operand 9208 states and 42351 transitions. Second operand 16 states. [2019-12-27 08:31:54,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:54,322 INFO L93 Difference]: Finished difference Result 29371 states and 113449 transitions. [2019-12-27 08:31:54,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:31:54,323 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 08:31:54,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:54,381 INFO L225 Difference]: With dead ends: 29371 [2019-12-27 08:31:54,381 INFO L226 Difference]: Without dead ends: 29361 [2019-12-27 08:31:54,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:31:54,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29361 states. [2019-12-27 08:31:54,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29361 to 9154. [2019-12-27 08:31:54,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9154 states. [2019-12-27 08:31:54,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9154 states to 9154 states and 42049 transitions. [2019-12-27 08:31:54,691 INFO L78 Accepts]: Start accepts. Automaton has 9154 states and 42049 transitions. Word has length 25 [2019-12-27 08:31:54,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:54,691 INFO L462 AbstractCegarLoop]: Abstraction has 9154 states and 42049 transitions. [2019-12-27 08:31:54,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:31:54,691 INFO L276 IsEmpty]: Start isEmpty. Operand 9154 states and 42049 transitions. [2019-12-27 08:31:54,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:31:54,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:54,694 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 08:31:54,894 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:54,894 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 08:31:54,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:54,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1806847685, now seen corresponding path program 2 times [2019-12-27 08:31:54,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:54,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199781972] [2019-12-27 08:31:54,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:54,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 08:31:54,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199781972] [2019-12-27 08:31:54,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969254656] [2019-12-27 08:31:54,963 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 08:31:55,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:31:55,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:31:55,038 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:31:55,039 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:55,275 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 08:31:55,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:55,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:31:55,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341028631] [2019-12-27 08:31:55,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:31:55,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:55,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:31:55,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:31:55,277 INFO L87 Difference]: Start difference. First operand 9154 states and 42049 transitions. Second operand 16 states. [2019-12-27 08:31:56,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:56,259 INFO L93 Difference]: Finished difference Result 28955 states and 111688 transitions. [2019-12-27 08:31:56,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:31:56,259 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 08:31:56,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:56,324 INFO L225 Difference]: With dead ends: 28955 [2019-12-27 08:31:56,325 INFO L226 Difference]: Without dead ends: 28944 [2019-12-27 08:31:56,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:31:56,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28944 states. [2019-12-27 08:31:56,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28944 to 9151. [2019-12-27 08:31:56,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9151 states. [2019-12-27 08:31:56,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9151 states to 9151 states and 41998 transitions. [2019-12-27 08:31:56,660 INFO L78 Accepts]: Start accepts. Automaton has 9151 states and 41998 transitions. Word has length 25 [2019-12-27 08:31:56,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:56,661 INFO L462 AbstractCegarLoop]: Abstraction has 9151 states and 41998 transitions. [2019-12-27 08:31:56,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:31:56,661 INFO L276 IsEmpty]: Start isEmpty. Operand 9151 states and 41998 transitions. [2019-12-27 08:31:56,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:31:56,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:56,664 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:56,864 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:56,865 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 08:31:56,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:56,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1806858721, now seen corresponding path program 2 times [2019-12-27 08:31:56,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:56,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018882017] [2019-12-27 08:31:56,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:56,920 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 08:31:56,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018882017] [2019-12-27 08:31:56,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490145269] [2019-12-27 08:31:56,920 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 08:31:56,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:31:56,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:31:56,999 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:31:57,000 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:57,097 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 08:31:57,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:57,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:31:57,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596009649] [2019-12-27 08:31:57,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:31:57,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:57,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:31:57,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:31:57,099 INFO L87 Difference]: Start difference. First operand 9151 states and 41998 transitions. Second operand 16 states. [2019-12-27 08:31:58,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:58,083 INFO L93 Difference]: Finished difference Result 28625 states and 110367 transitions. [2019-12-27 08:31:58,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:31:58,084 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 08:31:58,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:31:58,153 INFO L225 Difference]: With dead ends: 28625 [2019-12-27 08:31:58,153 INFO L226 Difference]: Without dead ends: 28614 [2019-12-27 08:31:58,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:31:58,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28614 states. [2019-12-27 08:31:58,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28614 to 9044. [2019-12-27 08:31:58,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-12-27 08:31:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 41462 transitions. [2019-12-27 08:31:58,488 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 41462 transitions. Word has length 25 [2019-12-27 08:31:58,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:31:58,489 INFO L462 AbstractCegarLoop]: Abstraction has 9044 states and 41462 transitions. [2019-12-27 08:31:58,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:31:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 41462 transitions. [2019-12-27 08:31:58,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:31:58,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:31:58,492 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:31:58,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:31:58,693 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 08:31:58,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:31:58,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1077942095, now seen corresponding path program 3 times [2019-12-27 08:31:58,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:31:58,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342133622] [2019-12-27 08:31:58,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:31:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:31:58,763 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 08:31:58,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342133622] [2019-12-27 08:31:58,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069155646] [2019-12-27 08:31:58,764 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 08:31:58,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 08:31:58,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:31:58,853 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:31:58,854 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:31:58,947 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 08:31:58,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:31:58,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:31:58,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094358650] [2019-12-27 08:31:58,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:31:58,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:31:58,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:31:58,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:31:58,948 INFO L87 Difference]: Start difference. First operand 9044 states and 41462 transitions. Second operand 16 states. [2019-12-27 08:31:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:31:59,979 INFO L93 Difference]: Finished difference Result 28739 states and 110779 transitions. [2019-12-27 08:31:59,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:31:59,979 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 08:31:59,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:00,041 INFO L225 Difference]: With dead ends: 28739 [2019-12-27 08:32:00,042 INFO L226 Difference]: Without dead ends: 28729 [2019-12-27 08:32:00,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:32:00,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28729 states. [2019-12-27 08:32:00,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28729 to 8878. [2019-12-27 08:32:00,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8878 states. [2019-12-27 08:32:00,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 40685 transitions. [2019-12-27 08:32:00,357 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 40685 transitions. Word has length 25 [2019-12-27 08:32:00,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:00,358 INFO L462 AbstractCegarLoop]: Abstraction has 8878 states and 40685 transitions. [2019-12-27 08:32:00,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:32:00,358 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 40685 transitions. [2019-12-27 08:32:00,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:32:00,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:00,361 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 08:32:00,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:32:00,562 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 08:32:00,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:00,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1085836710, now seen corresponding path program 1 times [2019-12-27 08:32:00,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:00,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300925166] [2019-12-27 08:32:00,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:00,614 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 08:32:00,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300925166] [2019-12-27 08:32:00,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511653504] [2019-12-27 08:32:00,615 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 08:32:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:00,706 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:32:00,706 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:32:00,803 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 08:32:00,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:32:00,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:32:00,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900654698] [2019-12-27 08:32:00,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:32:00,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:00,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:32:00,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:32:00,805 INFO L87 Difference]: Start difference. First operand 8878 states and 40685 transitions. Second operand 16 states. [2019-12-27 08:32:02,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:02,008 INFO L93 Difference]: Finished difference Result 29134 states and 112632 transitions. [2019-12-27 08:32:02,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:32:02,008 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 08:32:02,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:02,066 INFO L225 Difference]: With dead ends: 29134 [2019-12-27 08:32:02,066 INFO L226 Difference]: Without dead ends: 29124 [2019-12-27 08:32:02,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:32:02,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29124 states. [2019-12-27 08:32:02,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29124 to 8860. [2019-12-27 08:32:02,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8860 states. [2019-12-27 08:32:02,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8860 states to 8860 states and 40559 transitions. [2019-12-27 08:32:02,374 INFO L78 Accepts]: Start accepts. Automaton has 8860 states and 40559 transitions. Word has length 25 [2019-12-27 08:32:02,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:02,375 INFO L462 AbstractCegarLoop]: Abstraction has 8860 states and 40559 transitions. [2019-12-27 08:32:02,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:32:02,375 INFO L276 IsEmpty]: Start isEmpty. Operand 8860 states and 40559 transitions. [2019-12-27 08:32:02,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:32:02,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:02,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 08:32:02,578 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:32:02,579 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 08:32:02,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:02,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1072019855, now seen corresponding path program 4 times [2019-12-27 08:32:02,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:02,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241535860] [2019-12-27 08:32:02,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:02,634 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 08:32:02,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241535860] [2019-12-27 08:32:02,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260755007] [2019-12-27 08:32:02,634 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 08:32:02,720 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 08:32:02,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:32:02,722 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:32:02,722 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:32:02,806 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 08:32:02,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:32:02,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:32:02,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834963233] [2019-12-27 08:32:02,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:32:02,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:02,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:32:02,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:32:02,807 INFO L87 Difference]: Start difference. First operand 8860 states and 40559 transitions. Second operand 16 states. [2019-12-27 08:32:03,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:03,730 INFO L93 Difference]: Finished difference Result 28595 states and 110187 transitions. [2019-12-27 08:32:03,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:32:03,731 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 08:32:03,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:03,792 INFO L225 Difference]: With dead ends: 28595 [2019-12-27 08:32:03,792 INFO L226 Difference]: Without dead ends: 28584 [2019-12-27 08:32:03,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:32:03,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28584 states. [2019-12-27 08:32:04,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28584 to 8857. [2019-12-27 08:32:04,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8857 states. [2019-12-27 08:32:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8857 states to 8857 states and 40508 transitions. [2019-12-27 08:32:04,242 INFO L78 Accepts]: Start accepts. Automaton has 8857 states and 40508 transitions. Word has length 25 [2019-12-27 08:32:04,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:04,242 INFO L462 AbstractCegarLoop]: Abstraction has 8857 states and 40508 transitions. [2019-12-27 08:32:04,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:32:04,242 INFO L276 IsEmpty]: Start isEmpty. Operand 8857 states and 40508 transitions. [2019-12-27 08:32:04,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:32:04,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:04,245 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 08:32:04,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:32:04,446 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 08:32:04,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:04,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1072028070, now seen corresponding path program 2 times [2019-12-27 08:32:04,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:04,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840941810] [2019-12-27 08:32:04,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:04,507 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 08:32:04,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840941810] [2019-12-27 08:32:04,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014058271] [2019-12-27 08:32:04,509 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 08:32:04,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:32:04,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:32:04,588 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:32:04,589 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:32:04,667 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 08:32:04,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:32:04,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:32:04,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598196] [2019-12-27 08:32:04,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:32:04,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:04,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:32:04,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:32:04,669 INFO L87 Difference]: Start difference. First operand 8857 states and 40508 transitions. Second operand 16 states. [2019-12-27 08:32:05,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:05,731 INFO L93 Difference]: Finished difference Result 28468 states and 109859 transitions. [2019-12-27 08:32:05,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:32:05,732 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 08:32:05,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:05,793 INFO L225 Difference]: With dead ends: 28468 [2019-12-27 08:32:05,794 INFO L226 Difference]: Without dead ends: 28454 [2019-12-27 08:32:05,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:32:05,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28454 states. [2019-12-27 08:32:06,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28454 to 8722. [2019-12-27 08:32:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8722 states. [2019-12-27 08:32:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8722 states to 8722 states and 39857 transitions. [2019-12-27 08:32:06,098 INFO L78 Accepts]: Start accepts. Automaton has 8722 states and 39857 transitions. Word has length 25 [2019-12-27 08:32:06,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:06,099 INFO L462 AbstractCegarLoop]: Abstraction has 8722 states and 39857 transitions. [2019-12-27 08:32:06,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:32:06,099 INFO L276 IsEmpty]: Start isEmpty. Operand 8722 states and 39857 transitions. [2019-12-27 08:32:06,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:32:06,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:06,103 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:32:06,305 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:32:06,305 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 08:32:06,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:06,306 INFO L82 PathProgramCache]: Analyzing trace with hash 2071430200, now seen corresponding path program 1 times [2019-12-27 08:32:06,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:06,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456956183] [2019-12-27 08:32:06,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:06,334 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 08:32:06,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456956183] [2019-12-27 08:32:06,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:32:06,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:32:06,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726500752] [2019-12-27 08:32:06,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:32:06,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:06,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:32:06,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:32:06,335 INFO L87 Difference]: Start difference. First operand 8722 states and 39857 transitions. Second operand 5 states. [2019-12-27 08:32:06,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:06,507 INFO L93 Difference]: Finished difference Result 14188 states and 62117 transitions. [2019-12-27 08:32:06,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:32:06,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 08:32:06,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:06,538 INFO L225 Difference]: With dead ends: 14188 [2019-12-27 08:32:06,539 INFO L226 Difference]: Without dead ends: 14156 [2019-12-27 08:32:06,539 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 08:32:06,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14156 states. [2019-12-27 08:32:06,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14156 to 10325. [2019-12-27 08:32:06,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10325 states. [2019-12-27 08:32:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10325 states to 10325 states and 46869 transitions. [2019-12-27 08:32:06,736 INFO L78 Accepts]: Start accepts. Automaton has 10325 states and 46869 transitions. Word has length 25 [2019-12-27 08:32:06,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:06,737 INFO L462 AbstractCegarLoop]: Abstraction has 10325 states and 46869 transitions. [2019-12-27 08:32:06,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:32:06,737 INFO L276 IsEmpty]: Start isEmpty. Operand 10325 states and 46869 transitions. [2019-12-27 08:32:06,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:32:06,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:06,740 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 08:32:06,740 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 08:32:06,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:06,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1740193032, now seen corresponding path program 3 times [2019-12-27 08:32:06,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:06,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413768070] [2019-12-27 08:32:06,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:06,813 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 08:32:06,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413768070] [2019-12-27 08:32:06,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:32:06,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:32:06,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771607498] [2019-12-27 08:32:06,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:32:06,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:06,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:32:06,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:32:06,814 INFO L87 Difference]: Start difference. First operand 10325 states and 46869 transitions. Second operand 9 states. [2019-12-27 08:32:07,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:07,688 INFO L93 Difference]: Finished difference Result 31989 states and 124702 transitions. [2019-12-27 08:32:07,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:32:07,688 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:32:07,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:07,767 INFO L225 Difference]: With dead ends: 31989 [2019-12-27 08:32:07,768 INFO L226 Difference]: Without dead ends: 31973 [2019-12-27 08:32:07,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:32:07,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31973 states. [2019-12-27 08:32:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31973 to 10175. [2019-12-27 08:32:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10175 states. [2019-12-27 08:32:08,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10175 states to 10175 states and 46142 transitions. [2019-12-27 08:32:08,186 INFO L78 Accepts]: Start accepts. Automaton has 10175 states and 46142 transitions. Word has length 25 [2019-12-27 08:32:08,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:08,186 INFO L462 AbstractCegarLoop]: Abstraction has 10175 states and 46142 transitions. [2019-12-27 08:32:08,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:32:08,186 INFO L276 IsEmpty]: Start isEmpty. Operand 10175 states and 46142 transitions. [2019-12-27 08:32:08,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:32:08,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:08,189 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 08:32:08,189 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 08:32:08,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:08,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1737482051, now seen corresponding path program 3 times [2019-12-27 08:32:08,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:08,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268289261] [2019-12-27 08:32:08,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:08,257 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 08:32:08,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268289261] [2019-12-27 08:32:08,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:32:08,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:32:08,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887578646] [2019-12-27 08:32:08,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:32:08,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:08,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:32:08,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:32:08,259 INFO L87 Difference]: Start difference. First operand 10175 states and 46142 transitions. Second operand 9 states. [2019-12-27 08:32:09,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:09,170 INFO L93 Difference]: Finished difference Result 31605 states and 123025 transitions. [2019-12-27 08:32:09,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:32:09,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:32:09,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:09,239 INFO L225 Difference]: With dead ends: 31605 [2019-12-27 08:32:09,239 INFO L226 Difference]: Without dead ends: 31589 [2019-12-27 08:32:09,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:32:09,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31589 states. [2019-12-27 08:32:09,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31589 to 10057. [2019-12-27 08:32:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10057 states. [2019-12-27 08:32:09,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10057 states to 10057 states and 45612 transitions. [2019-12-27 08:32:09,583 INFO L78 Accepts]: Start accepts. Automaton has 10057 states and 45612 transitions. Word has length 25 [2019-12-27 08:32:09,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:09,583 INFO L462 AbstractCegarLoop]: Abstraction has 10057 states and 45612 transitions. [2019-12-27 08:32:09,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:32:09,584 INFO L276 IsEmpty]: Start isEmpty. Operand 10057 states and 45612 transitions. [2019-12-27 08:32:09,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:32:09,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:09,587 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 08:32:09,587 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 08:32:09,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:09,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1743407112, now seen corresponding path program 4 times [2019-12-27 08:32:09,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:09,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224764112] [2019-12-27 08:32:09,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:09,666 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 08:32:09,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224764112] [2019-12-27 08:32:09,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:32:09,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:32:09,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208461084] [2019-12-27 08:32:09,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:32:09,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:09,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:32:09,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:32:09,668 INFO L87 Difference]: Start difference. First operand 10057 states and 45612 transitions. Second operand 9 states. [2019-12-27 08:32:10,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:10,565 INFO L93 Difference]: Finished difference Result 31999 states and 124705 transitions. [2019-12-27 08:32:10,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:32:10,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:32:10,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:10,635 INFO L225 Difference]: With dead ends: 31999 [2019-12-27 08:32:10,635 INFO L226 Difference]: Without dead ends: 31979 [2019-12-27 08:32:10,635 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 08:32:10,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31979 states. [2019-12-27 08:32:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31979 to 10010. [2019-12-27 08:32:10,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10010 states. [2019-12-27 08:32:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10010 states to 10010 states and 45376 transitions. [2019-12-27 08:32:10,992 INFO L78 Accepts]: Start accepts. Automaton has 10010 states and 45376 transitions. Word has length 25 [2019-12-27 08:32:10,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:10,992 INFO L462 AbstractCegarLoop]: Abstraction has 10010 states and 45376 transitions. [2019-12-27 08:32:10,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:32:10,992 INFO L276 IsEmpty]: Start isEmpty. Operand 10010 states and 45376 transitions. [2019-12-27 08:32:10,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:32:10,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:10,995 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 08:32:10,995 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 08:32:10,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:10,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1743404291, now seen corresponding path program 4 times [2019-12-27 08:32:10,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:10,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324902550] [2019-12-27 08:32:10,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:11,052 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 08:32:11,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324902550] [2019-12-27 08:32:11,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:32:11,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:32:11,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996126346] [2019-12-27 08:32:11,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:32:11,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:11,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:32:11,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:32:11,054 INFO L87 Difference]: Start difference. First operand 10010 states and 45376 transitions. Second operand 9 states. [2019-12-27 08:32:11,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:11,928 INFO L93 Difference]: Finished difference Result 31576 states and 122968 transitions. [2019-12-27 08:32:11,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:32:11,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:32:11,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:12,005 INFO L225 Difference]: With dead ends: 31576 [2019-12-27 08:32:12,006 INFO L226 Difference]: Without dead ends: 31556 [2019-12-27 08:32:12,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:32:12,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31556 states. [2019-12-27 08:32:12,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31556 to 9827. [2019-12-27 08:32:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9827 states. [2019-12-27 08:32:12,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9827 states to 9827 states and 44489 transitions. [2019-12-27 08:32:12,610 INFO L78 Accepts]: Start accepts. Automaton has 9827 states and 44489 transitions. Word has length 25 [2019-12-27 08:32:12,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:12,610 INFO L462 AbstractCegarLoop]: Abstraction has 9827 states and 44489 transitions. [2019-12-27 08:32:12,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:32:12,610 INFO L276 IsEmpty]: Start isEmpty. Operand 9827 states and 44489 transitions. [2019-12-27 08:32:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:32:12,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:12,614 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 08:32:12,614 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 08:32:12,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:12,614 INFO L82 PathProgramCache]: Analyzing trace with hash -2139211039, now seen corresponding path program 5 times [2019-12-27 08:32:12,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:12,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342947700] [2019-12-27 08:32:12,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:12,666 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 08:32:12,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342947700] [2019-12-27 08:32:12,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:32:12,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:32:12,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808094150] [2019-12-27 08:32:12,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:32:12,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:12,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:32:12,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:32:12,669 INFO L87 Difference]: Start difference. First operand 9827 states and 44489 transitions. Second operand 9 states. [2019-12-27 08:32:13,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:13,462 INFO L93 Difference]: Finished difference Result 31623 states and 123094 transitions. [2019-12-27 08:32:13,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:32:13,462 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:32:13,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:13,527 INFO L225 Difference]: With dead ends: 31623 [2019-12-27 08:32:13,528 INFO L226 Difference]: Without dead ends: 31607 [2019-12-27 08:32:13,528 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 08:32:13,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31607 states. [2019-12-27 08:32:13,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31607 to 9671. [2019-12-27 08:32:13,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9671 states. [2019-12-27 08:32:13,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9671 states to 9671 states and 43725 transitions. [2019-12-27 08:32:13,860 INFO L78 Accepts]: Start accepts. Automaton has 9671 states and 43725 transitions. Word has length 25 [2019-12-27 08:32:13,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:13,860 INFO L462 AbstractCegarLoop]: Abstraction has 9671 states and 43725 transitions. [2019-12-27 08:32:13,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:32:13,860 INFO L276 IsEmpty]: Start isEmpty. Operand 9671 states and 43725 transitions. [2019-12-27 08:32:13,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:32:13,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:13,863 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 08:32:13,863 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 08:32:13,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:13,863 INFO L82 PathProgramCache]: Analyzing trace with hash -2139202824, now seen corresponding path program 5 times [2019-12-27 08:32:13,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:13,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109555393] [2019-12-27 08:32:13,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:13,924 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 08:32:13,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109555393] [2019-12-27 08:32:13,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:32:13,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:32:13,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627082013] [2019-12-27 08:32:13,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:32:13,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:13,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:32:13,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:32:13,926 INFO L87 Difference]: Start difference. First operand 9671 states and 43725 transitions. Second operand 9 states. [2019-12-27 08:32:14,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:14,736 INFO L93 Difference]: Finished difference Result 31103 states and 120876 transitions. [2019-12-27 08:32:14,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:32:14,736 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:32:14,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:14,805 INFO L225 Difference]: With dead ends: 31103 [2019-12-27 08:32:14,805 INFO L226 Difference]: Without dead ends: 31087 [2019-12-27 08:32:14,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:32:14,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31087 states. [2019-12-27 08:32:15,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31087 to 9503. [2019-12-27 08:32:15,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9503 states. [2019-12-27 08:32:15,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9503 states to 9503 states and 42917 transitions. [2019-12-27 08:32:15,156 INFO L78 Accepts]: Start accepts. Automaton has 9503 states and 42917 transitions. Word has length 25 [2019-12-27 08:32:15,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:15,156 INFO L462 AbstractCegarLoop]: Abstraction has 9503 states and 42917 transitions. [2019-12-27 08:32:15,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:32:15,156 INFO L276 IsEmpty]: Start isEmpty. Operand 9503 states and 42917 transitions. [2019-12-27 08:32:15,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:32:15,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:15,159 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 08:32:15,159 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 08:32:15,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:15,159 INFO L82 PathProgramCache]: Analyzing trace with hash -2136502879, now seen corresponding path program 6 times [2019-12-27 08:32:15,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:15,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457216156] [2019-12-27 08:32:15,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:15,220 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 08:32:15,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457216156] [2019-12-27 08:32:15,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:32:15,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:32:15,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234833094] [2019-12-27 08:32:15,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:32:15,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:15,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:32:15,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:32:15,222 INFO L87 Difference]: Start difference. First operand 9503 states and 42917 transitions. Second operand 9 states. [2019-12-27 08:32:16,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:16,000 INFO L93 Difference]: Finished difference Result 30789 states and 119448 transitions. [2019-12-27 08:32:16,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:32:16,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:32:16,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:16,067 INFO L225 Difference]: With dead ends: 30789 [2019-12-27 08:32:16,067 INFO L226 Difference]: Without dead ends: 30769 [2019-12-27 08:32:16,067 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 08:32:16,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30769 states. [2019-12-27 08:32:16,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30769 to 9172. [2019-12-27 08:32:16,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9172 states. [2019-12-27 08:32:16,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9172 states to 9172 states and 41398 transitions. [2019-12-27 08:32:16,412 INFO L78 Accepts]: Start accepts. Automaton has 9172 states and 41398 transitions. Word has length 25 [2019-12-27 08:32:16,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:16,412 INFO L462 AbstractCegarLoop]: Abstraction has 9172 states and 41398 transitions. [2019-12-27 08:32:16,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:32:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 9172 states and 41398 transitions. [2019-12-27 08:32:16,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:32:16,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:16,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 08:32:16,415 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 08:32:16,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:16,415 INFO L82 PathProgramCache]: Analyzing trace with hash -2136491843, now seen corresponding path program 5 times [2019-12-27 08:32:16,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:16,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722907164] [2019-12-27 08:32:16,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:16,489 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 08:32:16,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722907164] [2019-12-27 08:32:16,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:32:16,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:32:16,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954802937] [2019-12-27 08:32:16,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:32:16,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:16,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:32:16,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:32:16,490 INFO L87 Difference]: Start difference. First operand 9172 states and 41398 transitions. Second operand 9 states. [2019-12-27 08:32:17,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:17,467 INFO L93 Difference]: Finished difference Result 30398 states and 117772 transitions. [2019-12-27 08:32:17,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:32:17,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:32:17,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:17,535 INFO L225 Difference]: With dead ends: 30398 [2019-12-27 08:32:17,536 INFO L226 Difference]: Without dead ends: 30382 [2019-12-27 08:32:17,536 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 08:32:17,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30382 states. [2019-12-27 08:32:17,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30382 to 9066. [2019-12-27 08:32:17,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9066 states. [2019-12-27 08:32:17,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9066 states to 9066 states and 40900 transitions. [2019-12-27 08:32:17,899 INFO L78 Accepts]: Start accepts. Automaton has 9066 states and 40900 transitions. Word has length 25 [2019-12-27 08:32:17,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:17,899 INFO L462 AbstractCegarLoop]: Abstraction has 9066 states and 40900 transitions. [2019-12-27 08:32:17,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:32:17,900 INFO L276 IsEmpty]: Start isEmpty. Operand 9066 states and 40900 transitions. [2019-12-27 08:32:17,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:32:17,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:17,902 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 08:32:17,902 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 08:32:17,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:17,903 INFO L82 PathProgramCache]: Analyzing trace with hash -2128608264, now seen corresponding path program 6 times [2019-12-27 08:32:17,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:17,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147573890] [2019-12-27 08:32:17,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:17,951 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 08:32:17,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147573890] [2019-12-27 08:32:17,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:32:17,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:32:17,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338154543] [2019-12-27 08:32:17,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:32:17,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:17,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:32:17,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:32:17,952 INFO L87 Difference]: Start difference. First operand 9066 states and 40900 transitions. Second operand 9 states. [2019-12-27 08:32:18,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:18,882 INFO L93 Difference]: Finished difference Result 30130 states and 116617 transitions. [2019-12-27 08:32:18,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:32:18,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:32:18,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:18,948 INFO L225 Difference]: With dead ends: 30130 [2019-12-27 08:32:18,949 INFO L226 Difference]: Without dead ends: 30110 [2019-12-27 08:32:18,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:32:18,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30110 states. [2019-12-27 08:32:19,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30110 to 8819. [2019-12-27 08:32:19,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8819 states. [2019-12-27 08:32:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8819 states to 8819 states and 39792 transitions. [2019-12-27 08:32:19,267 INFO L78 Accepts]: Start accepts. Automaton has 8819 states and 39792 transitions. Word has length 25 [2019-12-27 08:32:19,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:19,268 INFO L462 AbstractCegarLoop]: Abstraction has 8819 states and 39792 transitions. [2019-12-27 08:32:19,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:32:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 8819 states and 39792 transitions. [2019-12-27 08:32:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:32:19,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:19,271 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 08:32:19,271 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 08:32:19,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:19,271 INFO L82 PathProgramCache]: Analyzing trace with hash -2128605443, now seen corresponding path program 6 times [2019-12-27 08:32:19,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:19,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512424846] [2019-12-27 08:32:19,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:19,332 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 08:32:19,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512424846] [2019-12-27 08:32:19,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:32:19,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:32:19,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774807482] [2019-12-27 08:32:19,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:32:19,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:19,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:32:19,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:32:19,333 INFO L87 Difference]: Start difference. First operand 8819 states and 39792 transitions. Second operand 9 states. [2019-12-27 08:32:20,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:20,240 INFO L93 Difference]: Finished difference Result 29741 states and 115009 transitions. [2019-12-27 08:32:20,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:32:20,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:32:20,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:20,303 INFO L225 Difference]: With dead ends: 29741 [2019-12-27 08:32:20,303 INFO L226 Difference]: Without dead ends: 29721 [2019-12-27 08:32:20,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:32:20,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29721 states. [2019-12-27 08:32:20,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29721 to 8516. [2019-12-27 08:32:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8516 states. [2019-12-27 08:32:20,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8516 states to 8516 states and 38438 transitions. [2019-12-27 08:32:20,616 INFO L78 Accepts]: Start accepts. Automaton has 8516 states and 38438 transitions. Word has length 25 [2019-12-27 08:32:20,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:20,617 INFO L462 AbstractCegarLoop]: Abstraction has 8516 states and 38438 transitions. [2019-12-27 08:32:20,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:32:20,617 INFO L276 IsEmpty]: Start isEmpty. Operand 8516 states and 38438 transitions. [2019-12-27 08:32:20,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 08:32:20,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:20,620 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:32:20,620 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 08:32:20,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:20,620 INFO L82 PathProgramCache]: Analyzing trace with hash -214879977, now seen corresponding path program 1 times [2019-12-27 08:32:20,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:20,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824231109] [2019-12-27 08:32:20,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:32:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:32:20,640 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:32:20,640 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:32:20,640 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 08:32:20,640 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-27 08:32:20,654 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,655 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,655 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,655 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,655 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,655 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,655 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,655 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,656 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,656 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,656 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,656 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,656 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,656 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,656 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,656 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,657 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,657 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,657 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,657 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,657 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,657 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,657 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,658 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,658 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,658 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,658 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,658 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,658 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,658 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,658 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,659 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,659 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,659 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,659 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,659 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,659 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,659 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,660 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,660 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,660 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,660 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,660 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,660 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,660 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,661 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,661 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,661 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,661 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,661 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,661 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,661 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,662 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,662 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,662 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,662 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,662 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,662 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,662 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,662 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,663 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,663 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,663 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,663 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,663 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,663 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,663 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,664 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,664 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,664 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,664 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,664 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,664 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,664 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,665 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,665 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,665 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,665 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,665 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,665 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,665 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,665 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,666 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,666 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,666 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,666 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,666 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,666 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,666 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,666 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,667 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,667 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,667 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,667 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,667 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,667 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,667 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,668 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,668 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,668 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,668 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,668 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,668 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,669 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,669 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,669 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,669 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,679 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,679 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,679 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,680 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,680 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,681 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,681 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,681 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,681 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,681 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,683 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,683 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,683 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,683 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,683 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,684 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,684 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,685 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,685 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,685 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,686 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,686 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,686 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,686 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,687 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,687 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,688 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,688 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,688 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,688 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,688 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,689 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,689 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,689 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,689 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,689 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,689 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,690 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,690 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,690 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,690 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,690 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,690 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,691 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,691 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,691 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,692 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,692 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,692 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,692 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,693 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,693 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,693 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,693 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,693 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,694 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,694 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,694 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,694 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,694 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,694 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:32:20,695 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-12-27 08:32:20,695 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:32:20,695 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:32:20,695 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:32:20,695 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:32:20,695 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:32:20,696 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:32:20,696 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:32:20,696 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:32:20,698 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 133 transitions [2019-12-27 08:32:20,698 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 152 places, 133 transitions [2019-12-27 08:32:20,719 INFO L132 PetriNetUnfolder]: 8/168 cut-off events. [2019-12-27 08:32:20,719 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 08:32:20,721 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 08:32:20,729 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 152 places, 133 transitions [2019-12-27 08:32:20,751 INFO L132 PetriNetUnfolder]: 8/168 cut-off events. [2019-12-27 08:32:20,751 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 08:32:20,754 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 08:32:20,761 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2832 [2019-12-27 08:32:20,762 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:32:22,441 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-27 08:32:22,626 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-12-27 08:32:22,822 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-27 08:32:23,024 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-12-27 08:32:23,122 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3471 [2019-12-27 08:32:23,122 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 08:32:23,123 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 45 transitions [2019-12-27 08:32:24,300 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2019-12-27 08:32:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2019-12-27 08:32:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 08:32:24,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:24,300 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 08:32:24,300 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 08:32:24,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:24,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1229452, now seen corresponding path program 1 times [2019-12-27 08:32:24,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:24,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472166537] [2019-12-27 08:32:24,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:24,328 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 08:32:24,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472166537] [2019-12-27 08:32:24,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:32:24,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:32:24,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55226791] [2019-12-27 08:32:24,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:32:24,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:24,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:32:24,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:32:24,329 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2019-12-27 08:32:24,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:24,474 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2019-12-27 08:32:24,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:32:24,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 08:32:24,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:24,521 INFO L225 Difference]: With dead ends: 17885 [2019-12-27 08:32:24,521 INFO L226 Difference]: Without dead ends: 16791 [2019-12-27 08:32:24,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:32:24,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2019-12-27 08:32:24,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16189. [2019-12-27 08:32:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16189 states. [2019-12-27 08:32:24,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16189 states to 16189 states and 84585 transitions. [2019-12-27 08:32:24,920 INFO L78 Accepts]: Start accepts. Automaton has 16189 states and 84585 transitions. Word has length 3 [2019-12-27 08:32:24,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:24,920 INFO L462 AbstractCegarLoop]: Abstraction has 16189 states and 84585 transitions. [2019-12-27 08:32:24,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:32:24,920 INFO L276 IsEmpty]: Start isEmpty. Operand 16189 states and 84585 transitions. [2019-12-27 08:32:24,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 08:32:24,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:24,921 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:32:24,921 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 08:32:24,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:24,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2087713608, now seen corresponding path program 1 times [2019-12-27 08:32:24,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:24,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618483382] [2019-12-27 08:32:24,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:24,961 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 08:32:24,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618483382] [2019-12-27 08:32:24,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:32:24,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:32:24,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61721429] [2019-12-27 08:32:24,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:32:24,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:24,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:32:24,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:32:24,963 INFO L87 Difference]: Start difference. First operand 16189 states and 84585 transitions. Second operand 5 states. [2019-12-27 08:32:25,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:25,219 INFO L93 Difference]: Finished difference Result 29874 states and 147254 transitions. [2019-12-27 08:32:25,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:32:25,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 08:32:25,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:25,302 INFO L225 Difference]: With dead ends: 29874 [2019-12-27 08:32:25,303 INFO L226 Difference]: Without dead ends: 29871 [2019-12-27 08:32:25,303 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 08:32:25,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29871 states. [2019-12-27 08:32:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29871 to 19122. [2019-12-27 08:32:25,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-12-27 08:32:25,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 100971 transitions. [2019-12-27 08:32:25,852 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 100971 transitions. Word has length 9 [2019-12-27 08:32:25,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:25,852 INFO L462 AbstractCegarLoop]: Abstraction has 19122 states and 100971 transitions. [2019-12-27 08:32:25,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:32:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 100971 transitions. [2019-12-27 08:32:25,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 08:32:25,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:25,852 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:32:25,853 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 08:32:25,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:25,853 INFO L82 PathProgramCache]: Analyzing trace with hash -973722539, now seen corresponding path program 1 times [2019-12-27 08:32:25,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:25,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966370445] [2019-12-27 08:32:25,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:25,880 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 08:32:25,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966370445] [2019-12-27 08:32:25,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:32:25,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:32:25,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718397326] [2019-12-27 08:32:25,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:32:25,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:25,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:32:25,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:32:25,882 INFO L87 Difference]: Start difference. First operand 19122 states and 100971 transitions. Second operand 5 states. [2019-12-27 08:32:27,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:27,823 INFO L93 Difference]: Finished difference Result 34948 states and 174870 transitions. [2019-12-27 08:32:27,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:32:27,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 08:32:27,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:27,930 INFO L225 Difference]: With dead ends: 34948 [2019-12-27 08:32:27,931 INFO L226 Difference]: Without dead ends: 34944 [2019-12-27 08:32:27,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:32:28,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34944 states. [2019-12-27 08:32:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34944 to 22883. [2019-12-27 08:32:28,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22883 states. [2019-12-27 08:32:28,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22883 states to 22883 states and 122526 transitions. [2019-12-27 08:32:28,598 INFO L78 Accepts]: Start accepts. Automaton has 22883 states and 122526 transitions. Word has length 13 [2019-12-27 08:32:28,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:28,598 INFO L462 AbstractCegarLoop]: Abstraction has 22883 states and 122526 transitions. [2019-12-27 08:32:28,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:32:28,598 INFO L276 IsEmpty]: Start isEmpty. Operand 22883 states and 122526 transitions. [2019-12-27 08:32:28,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 08:32:28,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:28,599 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:32:28,599 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 08:32:28,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:28,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1543295844, now seen corresponding path program 1 times [2019-12-27 08:32:28,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:28,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234408779] [2019-12-27 08:32:28,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:28,636 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 08:32:28,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234408779] [2019-12-27 08:32:28,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80263148] [2019-12-27 08:32:28,637 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 08:32:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:28,725 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 08:32:28,725 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:32:28,777 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 08:32:28,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:32:28,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 08:32:28,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355785443] [2019-12-27 08:32:28,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:32:28,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:28,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:32:28,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:32:28,779 INFO L87 Difference]: Start difference. First operand 22883 states and 122526 transitions. Second operand 12 states. [2019-12-27 08:32:29,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:29,367 INFO L93 Difference]: Finished difference Result 54752 states and 257250 transitions. [2019-12-27 08:32:29,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:32:29,367 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-27 08:32:29,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:29,528 INFO L225 Difference]: With dead ends: 54752 [2019-12-27 08:32:29,528 INFO L226 Difference]: Without dead ends: 54748 [2019-12-27 08:32:29,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:32:29,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54748 states. [2019-12-27 08:32:30,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54748 to 22725. [2019-12-27 08:32:30,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-12-27 08:32:30,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 121545 transitions. [2019-12-27 08:32:30,472 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 121545 transitions. Word has length 15 [2019-12-27 08:32:30,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:30,472 INFO L462 AbstractCegarLoop]: Abstraction has 22725 states and 121545 transitions. [2019-12-27 08:32:30,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:32:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 121545 transitions. [2019-12-27 08:32:30,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 08:32:30,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:30,473 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:32:30,673 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:32:30,674 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 08:32:30,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:30,674 INFO L82 PathProgramCache]: Analyzing trace with hash 555508526, now seen corresponding path program 2 times [2019-12-27 08:32:30,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:30,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558466609] [2019-12-27 08:32:30,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:30,713 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 08:32:30,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558466609] [2019-12-27 08:32:30,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:32:30,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:32:30,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638554760] [2019-12-27 08:32:30,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:32:30,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:30,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:32:30,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:32:30,715 INFO L87 Difference]: Start difference. First operand 22725 states and 121545 transitions. Second operand 7 states. [2019-12-27 08:32:31,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:31,704 INFO L93 Difference]: Finished difference Result 56062 states and 263636 transitions. [2019-12-27 08:32:31,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:32:31,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 08:32:31,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:31,868 INFO L225 Difference]: With dead ends: 56062 [2019-12-27 08:32:31,868 INFO L226 Difference]: Without dead ends: 56057 [2019-12-27 08:32:31,868 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 08:32:32,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56057 states. [2019-12-27 08:32:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56057 to 22254. [2019-12-27 08:32:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22254 states. [2019-12-27 08:32:32,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22254 states to 22254 states and 118917 transitions. [2019-12-27 08:32:32,685 INFO L78 Accepts]: Start accepts. Automaton has 22254 states and 118917 transitions. Word has length 15 [2019-12-27 08:32:32,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:32,685 INFO L462 AbstractCegarLoop]: Abstraction has 22254 states and 118917 transitions. [2019-12-27 08:32:32,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:32:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 22254 states and 118917 transitions. [2019-12-27 08:32:32,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 08:32:32,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:32,686 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:32:32,686 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 08:32:32,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:32,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1552042877, now seen corresponding path program 1 times [2019-12-27 08:32:32,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:32,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031361202] [2019-12-27 08:32:32,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:32,715 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 08:32:32,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031361202] [2019-12-27 08:32:32,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:32:32,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:32:32,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211136778] [2019-12-27 08:32:32,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:32:32,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:32,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:32:32,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:32:32,717 INFO L87 Difference]: Start difference. First operand 22254 states and 118917 transitions. Second operand 5 states. [2019-12-27 08:32:33,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:33,026 INFO L93 Difference]: Finished difference Result 40360 states and 205156 transitions. [2019-12-27 08:32:33,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:32:33,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 08:32:33,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:33,150 INFO L225 Difference]: With dead ends: 40360 [2019-12-27 08:32:33,150 INFO L226 Difference]: Without dead ends: 40352 [2019-12-27 08:32:33,150 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 08:32:33,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40352 states. [2019-12-27 08:32:33,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40352 to 27169. [2019-12-27 08:32:33,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27169 states. [2019-12-27 08:32:33,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27169 states to 27169 states and 146914 transitions. [2019-12-27 08:32:33,945 INFO L78 Accepts]: Start accepts. Automaton has 27169 states and 146914 transitions. Word has length 17 [2019-12-27 08:32:33,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:33,945 INFO L462 AbstractCegarLoop]: Abstraction has 27169 states and 146914 transitions. [2019-12-27 08:32:33,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:32:33,945 INFO L276 IsEmpty]: Start isEmpty. Operand 27169 states and 146914 transitions. [2019-12-27 08:32:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:32:33,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:33,946 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:32:33,946 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 08:32:33,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:33,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1878511684, now seen corresponding path program 1 times [2019-12-27 08:32:33,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:33,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670451059] [2019-12-27 08:32:33,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:33,989 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 08:32:33,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670451059] [2019-12-27 08:32:33,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579137542] [2019-12-27 08:32:33,990 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 08:32:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:34,080 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 08:32:34,081 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:32:34,141 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 08:32:34,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:32:34,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 08:32:34,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918372456] [2019-12-27 08:32:34,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:32:34,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:34,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:32:34,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:32:34,143 INFO L87 Difference]: Start difference. First operand 27169 states and 146914 transitions. Second operand 12 states. [2019-12-27 08:32:35,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:35,371 INFO L93 Difference]: Finished difference Result 64531 states and 308602 transitions. [2019-12-27 08:32:35,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:32:35,371 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-27 08:32:35,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:35,576 INFO L225 Difference]: With dead ends: 64531 [2019-12-27 08:32:35,576 INFO L226 Difference]: Without dead ends: 64525 [2019-12-27 08:32:35,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:32:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64525 states. [2019-12-27 08:32:36,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64525 to 27590. [2019-12-27 08:32:36,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-27 08:32:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 148998 transitions. [2019-12-27 08:32:36,642 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 148998 transitions. Word has length 19 [2019-12-27 08:32:36,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:36,642 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 148998 transitions. [2019-12-27 08:32:36,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:32:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 148998 transitions. [2019-12-27 08:32:36,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:32:36,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:36,643 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:32:36,843 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:32:36,844 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 08:32:36,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:36,844 INFO L82 PathProgramCache]: Analyzing trace with hash -90006000, now seen corresponding path program 1 times [2019-12-27 08:32:36,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:36,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103742159] [2019-12-27 08:32:36,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:36,885 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 08:32:36,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103742159] [2019-12-27 08:32:36,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648675438] [2019-12-27 08:32:36,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 08:32:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:36,976 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 08:32:36,976 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:32:37,045 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 08:32:37,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:32:37,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 08:32:37,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880187128] [2019-12-27 08:32:37,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:32:37,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:37,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:32:37,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:32:37,047 INFO L87 Difference]: Start difference. First operand 27590 states and 148998 transitions. Second operand 12 states. [2019-12-27 08:32:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:37,746 INFO L93 Difference]: Finished difference Result 67092 states and 321768 transitions. [2019-12-27 08:32:37,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:32:37,746 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-27 08:32:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:37,951 INFO L225 Difference]: With dead ends: 67092 [2019-12-27 08:32:37,951 INFO L226 Difference]: Without dead ends: 67083 [2019-12-27 08:32:37,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:32:38,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67083 states. [2019-12-27 08:32:38,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67083 to 27791. [2019-12-27 08:32:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27791 states. [2019-12-27 08:32:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27791 states to 27791 states and 150081 transitions. [2019-12-27 08:32:42,413 INFO L78 Accepts]: Start accepts. Automaton has 27791 states and 150081 transitions. Word has length 19 [2019-12-27 08:32:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:42,413 INFO L462 AbstractCegarLoop]: Abstraction has 27791 states and 150081 transitions. [2019-12-27 08:32:42,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:32:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 27791 states and 150081 transitions. [2019-12-27 08:32:42,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:32:42,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:42,414 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:32:42,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:32:42,615 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 08:32:42,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:42,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1159551062, now seen corresponding path program 2 times [2019-12-27 08:32:42,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:42,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507018843] [2019-12-27 08:32:42,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:42,656 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 08:32:42,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507018843] [2019-12-27 08:32:42,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:32:42,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:32:42,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768404434] [2019-12-27 08:32:42,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:32:42,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:42,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:32:42,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:32:42,657 INFO L87 Difference]: Start difference. First operand 27791 states and 150081 transitions. Second operand 7 states. [2019-12-27 08:32:43,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:43,295 INFO L93 Difference]: Finished difference Result 68100 states and 326949 transitions. [2019-12-27 08:32:43,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:32:43,296 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 08:32:43,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:43,492 INFO L225 Difference]: With dead ends: 68100 [2019-12-27 08:32:43,492 INFO L226 Difference]: Without dead ends: 68091 [2019-12-27 08:32:43,492 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 08:32:43,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68091 states. [2019-12-27 08:32:44,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68091 to 27884. [2019-12-27 08:32:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27884 states. [2019-12-27 08:32:44,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27884 states to 27884 states and 150616 transitions. [2019-12-27 08:32:44,536 INFO L78 Accepts]: Start accepts. Automaton has 27884 states and 150616 transitions. Word has length 19 [2019-12-27 08:32:44,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:44,536 INFO L462 AbstractCegarLoop]: Abstraction has 27884 states and 150616 transitions. [2019-12-27 08:32:44,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:32:44,536 INFO L276 IsEmpty]: Start isEmpty. Operand 27884 states and 150616 transitions. [2019-12-27 08:32:44,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:32:44,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:44,537 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:32:44,537 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 08:32:44,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:44,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1159551992, now seen corresponding path program 2 times [2019-12-27 08:32:44,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:44,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092877183] [2019-12-27 08:32:44,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:44,577 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 08:32:44,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092877183] [2019-12-27 08:32:44,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:32:44,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:32:44,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601702201] [2019-12-27 08:32:44,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:32:44,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:44,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:32:44,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:32:44,579 INFO L87 Difference]: Start difference. First operand 27884 states and 150616 transitions. Second operand 7 states. [2019-12-27 08:32:45,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:45,200 INFO L93 Difference]: Finished difference Result 67749 states and 324931 transitions. [2019-12-27 08:32:45,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:32:45,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 08:32:45,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:45,410 INFO L225 Difference]: With dead ends: 67749 [2019-12-27 08:32:45,410 INFO L226 Difference]: Without dead ends: 67740 [2019-12-27 08:32:45,410 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 08:32:45,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67740 states. [2019-12-27 08:32:46,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67740 to 28053. [2019-12-27 08:32:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28053 states. [2019-12-27 08:32:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28053 states to 28053 states and 151628 transitions. [2019-12-27 08:32:46,982 INFO L78 Accepts]: Start accepts. Automaton has 28053 states and 151628 transitions. Word has length 19 [2019-12-27 08:32:46,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:46,982 INFO L462 AbstractCegarLoop]: Abstraction has 28053 states and 151628 transitions. [2019-12-27 08:32:46,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:32:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 28053 states and 151628 transitions. [2019-12-27 08:32:46,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:32:46,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:46,984 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 08:32:46,984 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 08:32:46,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:46,984 INFO L82 PathProgramCache]: Analyzing trace with hash 113904919, now seen corresponding path program 1 times [2019-12-27 08:32:46,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:46,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317914280] [2019-12-27 08:32:46,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:47,047 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 08:32:47,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317914280] [2019-12-27 08:32:47,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752771904] [2019-12-27 08:32:47,048 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 08:32:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:47,136 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:32:47,137 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:32:47,232 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 08:32:47,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:32:47,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:32:47,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725749540] [2019-12-27 08:32:47,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:32:47,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:47,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:32:47,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:32:47,233 INFO L87 Difference]: Start difference. First operand 28053 states and 151628 transitions. Second operand 16 states. [2019-12-27 08:32:48,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:48,579 INFO L93 Difference]: Finished difference Result 97639 states and 440644 transitions. [2019-12-27 08:32:48,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:32:48,580 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 08:32:48,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:48,849 INFO L225 Difference]: With dead ends: 97639 [2019-12-27 08:32:48,849 INFO L226 Difference]: Without dead ends: 97635 [2019-12-27 08:32:48,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:32:49,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97635 states. [2019-12-27 08:32:50,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97635 to 27697. [2019-12-27 08:32:50,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27697 states. [2019-12-27 08:32:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27697 states to 27697 states and 149567 transitions. [2019-12-27 08:32:50,931 INFO L78 Accepts]: Start accepts. Automaton has 27697 states and 149567 transitions. Word has length 21 [2019-12-27 08:32:50,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:50,931 INFO L462 AbstractCegarLoop]: Abstraction has 27697 states and 149567 transitions. [2019-12-27 08:32:50,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:32:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand 27697 states and 149567 transitions. [2019-12-27 08:32:50,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:32:50,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:50,932 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 08:32:51,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:32:51,133 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 08:32:51,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:51,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1363462911, now seen corresponding path program 2 times [2019-12-27 08:32:51,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:51,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562765722] [2019-12-27 08:32:51,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:51,195 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 08:32:51,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562765722] [2019-12-27 08:32:51,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040289672] [2019-12-27 08:32:51,196 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 08:32:51,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:32:51,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:32:51,285 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:32:51,285 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:32:51,361 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 08:32:51,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:32:51,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:32:51,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008847557] [2019-12-27 08:32:51,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:32:51,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:51,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:32:51,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:32:51,363 INFO L87 Difference]: Start difference. First operand 27697 states and 149567 transitions. Second operand 16 states. [2019-12-27 08:32:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:52,796 INFO L93 Difference]: Finished difference Result 96837 states and 436529 transitions. [2019-12-27 08:32:52,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:32:52,797 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 08:32:52,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:53,064 INFO L225 Difference]: With dead ends: 96837 [2019-12-27 08:32:53,064 INFO L226 Difference]: Without dead ends: 96831 [2019-12-27 08:32:53,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:32:53,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96831 states. [2019-12-27 08:32:55,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96831 to 27343. [2019-12-27 08:32:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27343 states. [2019-12-27 08:32:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27343 states to 27343 states and 147510 transitions. [2019-12-27 08:32:55,129 INFO L78 Accepts]: Start accepts. Automaton has 27343 states and 147510 transitions. Word has length 21 [2019-12-27 08:32:55,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:55,129 INFO L462 AbstractCegarLoop]: Abstraction has 27343 states and 147510 transitions. [2019-12-27 08:32:55,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:32:55,129 INFO L276 IsEmpty]: Start isEmpty. Operand 27343 states and 147510 transitions. [2019-12-27 08:32:55,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:32:55,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:55,130 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 08:32:55,331 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:32:55,331 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 08:32:55,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:55,332 INFO L82 PathProgramCache]: Analyzing trace with hash -596422103, now seen corresponding path program 3 times [2019-12-27 08:32:55,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:55,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663417654] [2019-12-27 08:32:55,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:55,388 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 08:32:55,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663417654] [2019-12-27 08:32:55,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124930633] [2019-12-27 08:32:55,388 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 08:32:55,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 08:32:55,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:32:55,478 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:32:55,479 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:32:55,569 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 08:32:55,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:32:55,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:32:55,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342211640] [2019-12-27 08:32:55,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:32:55,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:32:55,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:32:55,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:32:55,571 INFO L87 Difference]: Start difference. First operand 27343 states and 147510 transitions. Second operand 16 states. [2019-12-27 08:32:57,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:32:57,051 INFO L93 Difference]: Finished difference Result 97329 states and 439144 transitions. [2019-12-27 08:32:57,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:32:57,051 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 08:32:57,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:32:57,320 INFO L225 Difference]: With dead ends: 97329 [2019-12-27 08:32:57,320 INFO L226 Difference]: Without dead ends: 97325 [2019-12-27 08:32:57,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:32:57,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97325 states. [2019-12-27 08:32:58,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97325 to 26991. [2019-12-27 08:32:58,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26991 states. [2019-12-27 08:32:59,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26991 states to 26991 states and 145461 transitions. [2019-12-27 08:32:59,526 INFO L78 Accepts]: Start accepts. Automaton has 26991 states and 145461 transitions. Word has length 21 [2019-12-27 08:32:59,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:32:59,526 INFO L462 AbstractCegarLoop]: Abstraction has 26991 states and 145461 transitions. [2019-12-27 08:32:59,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:32:59,526 INFO L276 IsEmpty]: Start isEmpty. Operand 26991 states and 145461 transitions. [2019-12-27 08:32:59,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:32:59,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:32:59,527 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 08:32:59,727 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:32:59,728 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 08:32:59,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:32:59,728 INFO L82 PathProgramCache]: Analyzing trace with hash -607849943, now seen corresponding path program 4 times [2019-12-27 08:32:59,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:32:59,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788887274] [2019-12-27 08:32:59,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:32:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:32:59,818 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 08:32:59,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788887274] [2019-12-27 08:32:59,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446779980] [2019-12-27 08:32:59,819 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 08:32:59,913 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 08:32:59,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:32:59,914 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:32:59,915 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:33:00,009 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 08:33:00,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:33:00,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:33:00,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982923664] [2019-12-27 08:33:00,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:33:00,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:33:00,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:33:00,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:33:00,011 INFO L87 Difference]: Start difference. First operand 26991 states and 145461 transitions. Second operand 16 states. [2019-12-27 08:33:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:33:01,465 INFO L93 Difference]: Finished difference Result 96246 states and 433386 transitions. [2019-12-27 08:33:01,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:33:01,465 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 08:33:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:33:01,743 INFO L225 Difference]: With dead ends: 96246 [2019-12-27 08:33:01,743 INFO L226 Difference]: Without dead ends: 96240 [2019-12-27 08:33:01,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:33:01,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96240 states. [2019-12-27 08:33:05,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96240 to 26339. [2019-12-27 08:33:05,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26339 states. [2019-12-27 08:33:05,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26339 states to 26339 states and 142000 transitions. [2019-12-27 08:33:05,774 INFO L78 Accepts]: Start accepts. Automaton has 26339 states and 142000 transitions. Word has length 21 [2019-12-27 08:33:05,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:33:05,774 INFO L462 AbstractCegarLoop]: Abstraction has 26339 states and 142000 transitions. [2019-12-27 08:33:05,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:33:05,774 INFO L276 IsEmpty]: Start isEmpty. Operand 26339 states and 142000 transitions. [2019-12-27 08:33:05,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:33:05,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:33:05,775 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:33:05,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:33:05,976 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 08:33:05,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:33:05,976 INFO L82 PathProgramCache]: Analyzing trace with hash 671564070, now seen corresponding path program 1 times [2019-12-27 08:33:05,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:33:05,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178639141] [2019-12-27 08:33:05,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:33:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:33:06,009 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 08:33:06,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178639141] [2019-12-27 08:33:06,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:33:06,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:33:06,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58213833] [2019-12-27 08:33:06,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:33:06,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:33:06,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:33:06,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:33:06,011 INFO L87 Difference]: Start difference. First operand 26339 states and 142000 transitions. Second operand 5 states. [2019-12-27 08:33:06,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:33:06,377 INFO L93 Difference]: Finished difference Result 47340 states and 243927 transitions. [2019-12-27 08:33:06,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:33:06,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 08:33:06,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:33:06,529 INFO L225 Difference]: With dead ends: 47340 [2019-12-27 08:33:06,529 INFO L226 Difference]: Without dead ends: 47324 [2019-12-27 08:33:06,529 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 08:33:06,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47324 states. [2019-12-27 08:33:07,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47324 to 32794. [2019-12-27 08:33:07,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32794 states. [2019-12-27 08:33:07,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32794 states to 32794 states and 178171 transitions. [2019-12-27 08:33:07,486 INFO L78 Accepts]: Start accepts. Automaton has 32794 states and 178171 transitions. Word has length 21 [2019-12-27 08:33:07,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:33:07,486 INFO L462 AbstractCegarLoop]: Abstraction has 32794 states and 178171 transitions. [2019-12-27 08:33:07,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:33:07,487 INFO L276 IsEmpty]: Start isEmpty. Operand 32794 states and 178171 transitions. [2019-12-27 08:33:07,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:33:07,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:33:07,488 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:33:07,488 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 08:33:07,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:33:07,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1932039825, now seen corresponding path program 5 times [2019-12-27 08:33:07,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:33:07,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351973923] [2019-12-27 08:33:07,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:33:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:33:07,547 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 08:33:07,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351973923] [2019-12-27 08:33:07,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:33:07,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:33:07,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334725746] [2019-12-27 08:33:07,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:33:07,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:33:07,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:33:07,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:33:07,549 INFO L87 Difference]: Start difference. First operand 32794 states and 178171 transitions. Second operand 9 states. [2019-12-27 08:33:09,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:33:09,431 INFO L93 Difference]: Finished difference Result 112140 states and 515003 transitions. [2019-12-27 08:33:09,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:33:09,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:33:09,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:33:09,747 INFO L225 Difference]: With dead ends: 112140 [2019-12-27 08:33:09,748 INFO L226 Difference]: Without dead ends: 112133 [2019-12-27 08:33:09,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:33:09,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112133 states. [2019-12-27 08:33:11,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112133 to 31942. [2019-12-27 08:33:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31942 states. [2019-12-27 08:33:11,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31942 states to 31942 states and 173493 transitions. [2019-12-27 08:33:11,373 INFO L78 Accepts]: Start accepts. Automaton has 31942 states and 173493 transitions. Word has length 21 [2019-12-27 08:33:11,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:33:11,373 INFO L462 AbstractCegarLoop]: Abstraction has 31942 states and 173493 transitions. [2019-12-27 08:33:11,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:33:11,374 INFO L276 IsEmpty]: Start isEmpty. Operand 31942 states and 173493 transitions. [2019-12-27 08:33:11,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 08:33:11,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:33:11,375 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 08:33:11,375 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 08:33:11,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:33:11,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1932932625, now seen corresponding path program 6 times [2019-12-27 08:33:11,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:33:11,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461996728] [2019-12-27 08:33:11,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:33:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:33:11,440 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 08:33:11,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461996728] [2019-12-27 08:33:11,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:33:11,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:33:11,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359506880] [2019-12-27 08:33:11,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:33:11,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:33:11,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:33:11,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:33:11,442 INFO L87 Difference]: Start difference. First operand 31942 states and 173493 transitions. Second operand 9 states. [2019-12-27 08:33:13,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:33:13,096 INFO L93 Difference]: Finished difference Result 111030 states and 509192 transitions. [2019-12-27 08:33:13,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:33:13,097 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 08:33:13,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:33:13,426 INFO L225 Difference]: With dead ends: 111030 [2019-12-27 08:33:13,426 INFO L226 Difference]: Without dead ends: 111020 [2019-12-27 08:33:13,426 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 08:33:13,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111020 states. [2019-12-27 08:33:14,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111020 to 30899. [2019-12-27 08:33:14,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30899 states. [2019-12-27 08:33:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30899 states to 30899 states and 167948 transitions. [2019-12-27 08:33:18,314 INFO L78 Accepts]: Start accepts. Automaton has 30899 states and 167948 transitions. Word has length 21 [2019-12-27 08:33:18,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:33:18,314 INFO L462 AbstractCegarLoop]: Abstraction has 30899 states and 167948 transitions. [2019-12-27 08:33:18,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:33:18,314 INFO L276 IsEmpty]: Start isEmpty. Operand 30899 states and 167948 transitions. [2019-12-27 08:33:18,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:33:18,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:33:18,315 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:33:18,315 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 08:33:18,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:33:18,316 INFO L82 PathProgramCache]: Analyzing trace with hash -938538387, now seen corresponding path program 1 times [2019-12-27 08:33:18,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:33:18,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507463300] [2019-12-27 08:33:18,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:33:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:33:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:33:18,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507463300] [2019-12-27 08:33:18,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353637221] [2019-12-27 08:33:18,363 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 08:33:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:33:18,446 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 08:33:18,447 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:33:18,498 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 08:33:18,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:33:18,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 08:33:18,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138825626] [2019-12-27 08:33:18,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:33:18,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:33:18,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:33:18,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:33:18,500 INFO L87 Difference]: Start difference. First operand 30899 states and 167948 transitions. Second operand 12 states. [2019-12-27 08:33:19,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:33:19,193 INFO L93 Difference]: Finished difference Result 73073 states and 355163 transitions. [2019-12-27 08:33:19,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:33:19,193 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 08:33:19,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:33:19,406 INFO L225 Difference]: With dead ends: 73073 [2019-12-27 08:33:19,407 INFO L226 Difference]: Without dead ends: 73061 [2019-12-27 08:33:19,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:33:19,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73061 states. [2019-12-27 08:33:20,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73061 to 31876. [2019-12-27 08:33:20,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31876 states. [2019-12-27 08:33:20,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31876 states to 31876 states and 173008 transitions. [2019-12-27 08:33:20,617 INFO L78 Accepts]: Start accepts. Automaton has 31876 states and 173008 transitions. Word has length 23 [2019-12-27 08:33:20,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:33:20,617 INFO L462 AbstractCegarLoop]: Abstraction has 31876 states and 173008 transitions. [2019-12-27 08:33:20,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:33:20,617 INFO L276 IsEmpty]: Start isEmpty. Operand 31876 states and 173008 transitions. [2019-12-27 08:33:20,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:33:20,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:33:20,619 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:33:20,819 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:33:20,820 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 08:33:20,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:33:20,820 INFO L82 PathProgramCache]: Analyzing trace with hash -912298617, now seen corresponding path program 1 times [2019-12-27 08:33:20,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:33:20,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651249665] [2019-12-27 08:33:20,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:33:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:33:20,861 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 08:33:20,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651249665] [2019-12-27 08:33:20,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317692018] [2019-12-27 08:33:20,861 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 08:33:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:33:20,951 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 08:33:20,952 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:33:21,009 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 08:33:21,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:33:21,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 08:33:21,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773848529] [2019-12-27 08:33:21,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:33:21,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:33:21,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:33:21,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:33:21,011 INFO L87 Difference]: Start difference. First operand 31876 states and 173008 transitions. Second operand 12 states. [2019-12-27 08:33:22,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:33:22,098 INFO L93 Difference]: Finished difference Result 77049 states and 375250 transitions. [2019-12-27 08:33:22,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:33:22,098 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 08:33:22,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:33:22,359 INFO L225 Difference]: With dead ends: 77049 [2019-12-27 08:33:22,359 INFO L226 Difference]: Without dead ends: 77035 [2019-12-27 08:33:22,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:33:22,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77035 states. [2019-12-27 08:33:23,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77035 to 32848. [2019-12-27 08:33:23,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32848 states. [2019-12-27 08:33:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32848 states to 32848 states and 178265 transitions. [2019-12-27 08:33:23,601 INFO L78 Accepts]: Start accepts. Automaton has 32848 states and 178265 transitions. Word has length 23 [2019-12-27 08:33:23,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:33:23,601 INFO L462 AbstractCegarLoop]: Abstraction has 32848 states and 178265 transitions. [2019-12-27 08:33:23,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:33:23,601 INFO L276 IsEmpty]: Start isEmpty. Operand 32848 states and 178265 transitions. [2019-12-27 08:33:23,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:33:23,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:33:23,603 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:33:23,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:33:23,804 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 08:33:23,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:33:23,804 INFO L82 PathProgramCache]: Analyzing trace with hash 475670957, now seen corresponding path program 1 times [2019-12-27 08:33:23,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:33:23,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224115783] [2019-12-27 08:33:23,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:33:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:33:23,843 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 08:33:23,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224115783] [2019-12-27 08:33:23,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625015160] [2019-12-27 08:33:23,843 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 08:33:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:33:23,934 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 08:33:23,935 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:33:23,988 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 08:33:23,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:33:23,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 08:33:23,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903927941] [2019-12-27 08:33:23,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:33:23,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:33:23,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:33:23,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:33:23,990 INFO L87 Difference]: Start difference. First operand 32848 states and 178265 transitions. Second operand 12 states. [2019-12-27 08:33:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:33:25,103 INFO L93 Difference]: Finished difference Result 80192 states and 391837 transitions. [2019-12-27 08:33:25,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:33:25,104 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 08:33:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:33:25,367 INFO L225 Difference]: With dead ends: 80192 [2019-12-27 08:33:25,367 INFO L226 Difference]: Without dead ends: 80173 [2019-12-27 08:33:25,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 08:33:25,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80173 states. [2019-12-27 08:33:26,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80173 to 33665. [2019-12-27 08:33:26,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33665 states. [2019-12-27 08:33:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33665 states to 33665 states and 182914 transitions. [2019-12-27 08:33:26,589 INFO L78 Accepts]: Start accepts. Automaton has 33665 states and 182914 transitions. Word has length 23 [2019-12-27 08:33:26,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:33:26,589 INFO L462 AbstractCegarLoop]: Abstraction has 33665 states and 182914 transitions. [2019-12-27 08:33:26,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:33:26,589 INFO L276 IsEmpty]: Start isEmpty. Operand 33665 states and 182914 transitions. [2019-12-27 08:33:26,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:33:26,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:33:26,591 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:33:26,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:33:26,792 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 08:33:26,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:33:26,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1127986751, now seen corresponding path program 2 times [2019-12-27 08:33:26,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:33:26,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069208365] [2019-12-27 08:33:26,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:33:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:33:26,832 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 08:33:26,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069208365] [2019-12-27 08:33:26,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:33:26,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:33:26,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140337873] [2019-12-27 08:33:26,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:33:26,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:33:26,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:33:26,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:33:26,834 INFO L87 Difference]: Start difference. First operand 33665 states and 182914 transitions. Second operand 7 states. [2019-12-27 08:33:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:33:27,526 INFO L93 Difference]: Finished difference Result 80956 states and 395965 transitions. [2019-12-27 08:33:27,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:33:27,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 08:33:27,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:33:28,308 INFO L225 Difference]: With dead ends: 80956 [2019-12-27 08:33:28,308 INFO L226 Difference]: Without dead ends: 80937 [2019-12-27 08:33:28,309 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 08:33:28,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80937 states. [2019-12-27 08:33:29,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80937 to 34532. [2019-12-27 08:33:29,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34532 states. [2019-12-27 08:33:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34532 states to 34532 states and 187636 transitions. [2019-12-27 08:33:29,598 INFO L78 Accepts]: Start accepts. Automaton has 34532 states and 187636 transitions. Word has length 23 [2019-12-27 08:33:29,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:33:29,598 INFO L462 AbstractCegarLoop]: Abstraction has 34532 states and 187636 transitions. [2019-12-27 08:33:29,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:33:29,599 INFO L276 IsEmpty]: Start isEmpty. Operand 34532 states and 187636 transitions. [2019-12-27 08:33:29,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:33:29,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:33:29,600 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:33:29,601 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 08:33:29,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:33:29,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1127974847, now seen corresponding path program 2 times [2019-12-27 08:33:29,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:33:29,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710551251] [2019-12-27 08:33:29,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:33:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:33:29,688 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 08:33:29,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710551251] [2019-12-27 08:33:29,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:33:29,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:33:29,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162434699] [2019-12-27 08:33:29,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:33:29,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:33:29,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:33:29,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:33:29,690 INFO L87 Difference]: Start difference. First operand 34532 states and 187636 transitions. Second operand 7 states. [2019-12-27 08:33:30,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:33:30,392 INFO L93 Difference]: Finished difference Result 81082 states and 396008 transitions. [2019-12-27 08:33:30,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:33:30,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 08:33:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:33:30,631 INFO L225 Difference]: With dead ends: 81082 [2019-12-27 08:33:30,632 INFO L226 Difference]: Without dead ends: 81063 [2019-12-27 08:33:30,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 08:33:30,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81063 states. [2019-12-27 08:33:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81063 to 35153. [2019-12-27 08:33:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35153 states. [2019-12-27 08:33:32,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35153 states to 35153 states and 191087 transitions. [2019-12-27 08:33:32,444 INFO L78 Accepts]: Start accepts. Automaton has 35153 states and 191087 transitions. Word has length 23 [2019-12-27 08:33:32,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:33:32,445 INFO L462 AbstractCegarLoop]: Abstraction has 35153 states and 191087 transitions. [2019-12-27 08:33:32,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:33:32,445 INFO L276 IsEmpty]: Start isEmpty. Operand 35153 states and 191087 transitions. [2019-12-27 08:33:32,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 08:33:32,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:33:32,447 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:33:32,447 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 08:33:32,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:33:32,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1127975777, now seen corresponding path program 2 times [2019-12-27 08:33:32,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:33:32,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693112941] [2019-12-27 08:33:32,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:33:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:33:32,484 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 08:33:32,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693112941] [2019-12-27 08:33:32,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:33:32,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:33:32,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655800485] [2019-12-27 08:33:32,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:33:32,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:33:32,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:33:32,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:33:32,486 INFO L87 Difference]: Start difference. First operand 35153 states and 191087 transitions. Second operand 7 states. [2019-12-27 08:33:33,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:33:33,235 INFO L93 Difference]: Finished difference Result 81506 states and 397808 transitions. [2019-12-27 08:33:33,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:33:33,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 08:33:33,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:33:33,513 INFO L225 Difference]: With dead ends: 81506 [2019-12-27 08:33:33,513 INFO L226 Difference]: Without dead ends: 81487 [2019-12-27 08:33:33,513 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 08:33:33,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81487 states. [2019-12-27 08:33:35,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81487 to 35912. [2019-12-27 08:33:35,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35912 states. [2019-12-27 08:33:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35912 states to 35912 states and 195109 transitions. [2019-12-27 08:33:35,355 INFO L78 Accepts]: Start accepts. Automaton has 35912 states and 195109 transitions. Word has length 23 [2019-12-27 08:33:35,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:33:35,355 INFO L462 AbstractCegarLoop]: Abstraction has 35912 states and 195109 transitions. [2019-12-27 08:33:35,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:33:35,355 INFO L276 IsEmpty]: Start isEmpty. Operand 35912 states and 195109 transitions. [2019-12-27 08:33:35,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:33:35,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:33:35,358 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 08:33:35,358 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 08:33:35,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:33:35,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2032533234, now seen corresponding path program 1 times [2019-12-27 08:33:35,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:33:35,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305735004] [2019-12-27 08:33:35,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:33:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:33:35,410 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 08:33:35,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305735004] [2019-12-27 08:33:35,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324266910] [2019-12-27 08:33:35,411 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 08:33:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:33:35,495 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:33:35,496 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:33:35,589 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 08:33:35,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:33:35,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:33:35,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384168479] [2019-12-27 08:33:35,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:33:35,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:33:35,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:33:35,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:33:35,591 INFO L87 Difference]: Start difference. First operand 35912 states and 195109 transitions. Second operand 16 states. [2019-12-27 08:33:37,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:33:37,139 INFO L93 Difference]: Finished difference Result 119601 states and 553012 transitions. [2019-12-27 08:33:37,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:33:37,139 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 08:33:37,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:33:37,522 INFO L225 Difference]: With dead ends: 119601 [2019-12-27 08:33:37,522 INFO L226 Difference]: Without dead ends: 119591 [2019-12-27 08:33:37,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:33:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119591 states. [2019-12-27 08:33:39,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119591 to 35590. [2019-12-27 08:33:39,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35590 states. [2019-12-27 08:33:39,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35590 states to 35590 states and 193098 transitions. [2019-12-27 08:33:39,857 INFO L78 Accepts]: Start accepts. Automaton has 35590 states and 193098 transitions. Word has length 25 [2019-12-27 08:33:39,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:33:39,857 INFO L462 AbstractCegarLoop]: Abstraction has 35590 states and 193098 transitions. [2019-12-27 08:33:39,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:33:39,857 INFO L276 IsEmpty]: Start isEmpty. Operand 35590 states and 193098 transitions. [2019-12-27 08:33:39,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:33:39,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:33:39,860 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 08:33:40,060 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:33:40,060 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 08:33:40,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:33:40,061 INFO L82 PathProgramCache]: Analyzing trace with hash -644563660, now seen corresponding path program 1 times [2019-12-27 08:33:40,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:33:40,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30314859] [2019-12-27 08:33:40,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:33:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:33:40,111 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 08:33:40,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30314859] [2019-12-27 08:33:40,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581514567] [2019-12-27 08:33:40,112 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 08:33:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:33:40,198 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:33:40,198 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:33:40,285 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 08:33:40,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:33:40,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:33:40,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241074146] [2019-12-27 08:33:40,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:33:40,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:33:40,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:33:40,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:33:40,287 INFO L87 Difference]: Start difference. First operand 35590 states and 193098 transitions. Second operand 16 states. [2019-12-27 08:33:41,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:33:41,700 INFO L93 Difference]: Finished difference Result 118371 states and 546721 transitions. [2019-12-27 08:33:41,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:33:42,307 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 08:33:42,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:33:42,678 INFO L225 Difference]: With dead ends: 118371 [2019-12-27 08:33:42,678 INFO L226 Difference]: Without dead ends: 118361 [2019-12-27 08:33:42,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:33:42,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118361 states. [2019-12-27 08:33:44,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118361 to 35384. [2019-12-27 08:33:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35384 states. [2019-12-27 08:33:44,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35384 states to 35384 states and 191757 transitions. [2019-12-27 08:33:44,353 INFO L78 Accepts]: Start accepts. Automaton has 35384 states and 191757 transitions. Word has length 25 [2019-12-27 08:33:44,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:33:44,353 INFO L462 AbstractCegarLoop]: Abstraction has 35384 states and 191757 transitions. [2019-12-27 08:33:44,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:33:44,354 INFO L276 IsEmpty]: Start isEmpty. Operand 35384 states and 191757 transitions. [2019-12-27 08:33:44,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:33:44,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:33:44,357 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:33:44,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:33:44,558 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 08:33:44,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:33:44,559 INFO L82 PathProgramCache]: Analyzing trace with hash 7752134, now seen corresponding path program 2 times [2019-12-27 08:33:44,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:33:44,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711894004] [2019-12-27 08:33:44,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:33:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:33:44,612 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 08:33:44,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711894004] [2019-12-27 08:33:44,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137432739] [2019-12-27 08:33:44,613 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 08:33:44,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:33:44,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:33:44,700 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:33:44,701 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:33:44,778 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 08:33:44,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:33:44,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:33:44,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82443112] [2019-12-27 08:33:44,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:33:44,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:33:44,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:33:44,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:33:44,780 INFO L87 Difference]: Start difference. First operand 35384 states and 191757 transitions. Second operand 16 states. [2019-12-27 08:33:46,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:33:46,658 INFO L93 Difference]: Finished difference Result 117247 states and 540902 transitions. [2019-12-27 08:33:46,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:33:46,658 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 08:33:46,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:33:47,012 INFO L225 Difference]: With dead ends: 117247 [2019-12-27 08:33:47,012 INFO L226 Difference]: Without dead ends: 117236 [2019-12-27 08:33:47,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:33:47,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117236 states. [2019-12-27 08:33:48,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117236 to 35317. [2019-12-27 08:33:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35317 states. [2019-12-27 08:33:52,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35317 states to 35317 states and 191252 transitions. [2019-12-27 08:33:52,290 INFO L78 Accepts]: Start accepts. Automaton has 35317 states and 191252 transitions. Word has length 25 [2019-12-27 08:33:52,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:33:52,291 INFO L462 AbstractCegarLoop]: Abstraction has 35317 states and 191252 transitions. [2019-12-27 08:33:52,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:33:52,291 INFO L276 IsEmpty]: Start isEmpty. Operand 35317 states and 191252 transitions. [2019-12-27 08:33:52,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:33:52,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:33:52,294 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 08:33:52,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:33:52,495 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 08:33:52,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:33:52,495 INFO L82 PathProgramCache]: Analyzing trace with hash 7741160, now seen corresponding path program 2 times [2019-12-27 08:33:52,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:33:52,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125342937] [2019-12-27 08:33:52,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:33:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:33:52,552 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 08:33:52,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125342937] [2019-12-27 08:33:52,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778449406] [2019-12-27 08:33:52,553 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 08:33:52,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:33:52,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:33:52,664 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:33:52,665 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:33:52,748 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 08:33:52,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:33:52,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:33:52,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445970021] [2019-12-27 08:33:52,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:33:52,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:33:52,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:33:52,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:33:52,749 INFO L87 Difference]: Start difference. First operand 35317 states and 191252 transitions. Second operand 16 states. [2019-12-27 08:33:54,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:33:54,171 INFO L93 Difference]: Finished difference Result 116261 states and 536103 transitions. [2019-12-27 08:33:54,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:33:54,171 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 08:33:54,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:33:54,548 INFO L225 Difference]: With dead ends: 116261 [2019-12-27 08:33:54,548 INFO L226 Difference]: Without dead ends: 116250 [2019-12-27 08:33:54,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:33:54,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116250 states. [2019-12-27 08:33:56,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116250 to 34934. [2019-12-27 08:33:56,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34934 states. [2019-12-27 08:33:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34934 states to 34934 states and 189032 transitions. [2019-12-27 08:33:56,703 INFO L78 Accepts]: Start accepts. Automaton has 34934 states and 189032 transitions. Word has length 25 [2019-12-27 08:33:56,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:33:56,704 INFO L462 AbstractCegarLoop]: Abstraction has 34934 states and 189032 transitions. [2019-12-27 08:33:56,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:33:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand 34934 states and 189032 transitions. [2019-12-27 08:33:56,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:33:56,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:33:56,706 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 08:33:56,906 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:33:56,907 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 08:33:56,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:33:56,908 INFO L82 PathProgramCache]: Analyzing trace with hash -545632672, now seen corresponding path program 1 times [2019-12-27 08:33:56,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:33:56,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719392850] [2019-12-27 08:33:56,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:33:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:33:56,963 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 08:33:56,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719392850] [2019-12-27 08:33:56,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307201171] [2019-12-27 08:33:56,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 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 08:33:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:33:57,056 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:33:57,056 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:33:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 08:33:57,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:33:57,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:33:57,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900011313] [2019-12-27 08:33:57,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:33:57,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:33:57,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:33:57,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:33:57,134 INFO L87 Difference]: Start difference. First operand 34934 states and 189032 transitions. Second operand 16 states. [2019-12-27 08:33:58,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:33:58,598 INFO L93 Difference]: Finished difference Result 118938 states and 550128 transitions. [2019-12-27 08:33:58,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:33:58,598 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 08:33:58,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:33:58,932 INFO L225 Difference]: With dead ends: 118938 [2019-12-27 08:33:58,932 INFO L226 Difference]: Without dead ends: 118928 [2019-12-27 08:33:58,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:33:59,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118928 states. [2019-12-27 08:34:01,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118928 to 35058. [2019-12-27 08:34:01,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35058 states. [2019-12-27 08:34:01,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35058 states to 35058 states and 189558 transitions. [2019-12-27 08:34:01,155 INFO L78 Accepts]: Start accepts. Automaton has 35058 states and 189558 transitions. Word has length 25 [2019-12-27 08:34:01,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:34:01,156 INFO L462 AbstractCegarLoop]: Abstraction has 35058 states and 189558 transitions. [2019-12-27 08:34:01,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:34:01,156 INFO L276 IsEmpty]: Start isEmpty. Operand 35058 states and 189558 transitions. [2019-12-27 08:34:01,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:34:01,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:34:01,158 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 08:34:01,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:34:01,359 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 08:34:01,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:34:01,360 INFO L82 PathProgramCache]: Analyzing trace with hash -545644576, now seen corresponding path program 3 times [2019-12-27 08:34:01,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:34:01,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723319356] [2019-12-27 08:34:01,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:34:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:34:01,411 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 08:34:01,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723319356] [2019-12-27 08:34:01,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517712948] [2019-12-27 08:34:01,412 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 08:34:01,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 08:34:01,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:34:01,496 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:34:01,497 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:34:01,574 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 08:34:01,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:34:01,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:34:01,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351952308] [2019-12-27 08:34:01,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:34:01,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:34:01,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:34:01,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:34:01,576 INFO L87 Difference]: Start difference. First operand 35058 states and 189558 transitions. Second operand 16 states. [2019-12-27 08:34:03,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:34:03,507 INFO L93 Difference]: Finished difference Result 117535 states and 542555 transitions. [2019-12-27 08:34:03,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:34:03,508 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 08:34:03,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:34:03,830 INFO L225 Difference]: With dead ends: 117535 [2019-12-27 08:34:03,830 INFO L226 Difference]: Without dead ends: 117525 [2019-12-27 08:34:03,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:34:04,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117525 states. [2019-12-27 08:34:05,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117525 to 34750. [2019-12-27 08:34:05,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34750 states. [2019-12-27 08:34:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34750 states to 34750 states and 187700 transitions. [2019-12-27 08:34:05,329 INFO L78 Accepts]: Start accepts. Automaton has 34750 states and 187700 transitions. Word has length 25 [2019-12-27 08:34:05,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:34:05,330 INFO L462 AbstractCegarLoop]: Abstraction has 34750 states and 187700 transitions. [2019-12-27 08:34:05,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:34:05,330 INFO L276 IsEmpty]: Start isEmpty. Operand 34750 states and 187700 transitions. [2019-12-27 08:34:05,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:34:05,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:34:05,332 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 08:34:05,532 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:34:05,533 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 08:34:05,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:34:05,533 INFO L82 PathProgramCache]: Analyzing trace with hash -530395552, now seen corresponding path program 2 times [2019-12-27 08:34:05,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:34:05,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106903948] [2019-12-27 08:34:05,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:34:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:34:05,593 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 08:34:05,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106903948] [2019-12-27 08:34:05,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336328975] [2019-12-27 08:34:05,594 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 08:34:05,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 08:34:05,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:34:05,682 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:34:05,682 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:34:05,770 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 08:34:05,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:34:05,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:34:05,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522009320] [2019-12-27 08:34:05,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:34:05,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:34:05,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:34:05,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:34:05,772 INFO L87 Difference]: Start difference. First operand 34750 states and 187700 transitions. Second operand 16 states. [2019-12-27 08:34:07,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:34:07,414 INFO L93 Difference]: Finished difference Result 117014 states and 540604 transitions. [2019-12-27 08:34:07,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:34:07,414 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 08:34:07,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:34:07,741 INFO L225 Difference]: With dead ends: 117014 [2019-12-27 08:34:07,741 INFO L226 Difference]: Without dead ends: 117000 [2019-12-27 08:34:07,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:34:07,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117000 states. [2019-12-27 08:34:09,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117000 to 34277. [2019-12-27 08:34:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34277 states. [2019-12-27 08:34:12,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34277 states to 34277 states and 184965 transitions. [2019-12-27 08:34:12,916 INFO L78 Accepts]: Start accepts. Automaton has 34277 states and 184965 transitions. Word has length 25 [2019-12-27 08:34:12,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:34:12,916 INFO L462 AbstractCegarLoop]: Abstraction has 34277 states and 184965 transitions. [2019-12-27 08:34:12,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:34:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 34277 states and 184965 transitions. [2019-12-27 08:34:12,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:34:12,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:34:12,919 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 08:34:13,119 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:34:13,119 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 08:34:13,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:34:13,120 INFO L82 PathProgramCache]: Analyzing trace with hash -541835296, now seen corresponding path program 4 times [2019-12-27 08:34:13,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:34:13,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278397903] [2019-12-27 08:34:13,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:34:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:34:13,186 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 08:34:13,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278397903] [2019-12-27 08:34:13,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225714937] [2019-12-27 08:34:13,187 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 08:34:13,281 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 08:34:13,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:34:13,281 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:34:13,282 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:34:13,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 08:34:13,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:34:13,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:34:13,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353100311] [2019-12-27 08:34:13,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:34:13,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:34:13,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:34:13,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:34:13,360 INFO L87 Difference]: Start difference. First operand 34277 states and 184965 transitions. Second operand 16 states. [2019-12-27 08:34:14,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:34:14,892 INFO L93 Difference]: Finished difference Result 113272 states and 520858 transitions. [2019-12-27 08:34:14,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:34:14,892 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 08:34:14,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:34:15,201 INFO L225 Difference]: With dead ends: 113272 [2019-12-27 08:34:15,201 INFO L226 Difference]: Without dead ends: 113261 [2019-12-27 08:34:15,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:34:15,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113261 states. [2019-12-27 08:34:17,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113261 to 33768. [2019-12-27 08:34:17,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33768 states. [2019-12-27 08:34:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33768 states to 33768 states and 182281 transitions. [2019-12-27 08:34:17,127 INFO L78 Accepts]: Start accepts. Automaton has 33768 states and 182281 transitions. Word has length 25 [2019-12-27 08:34:17,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:34:17,128 INFO L462 AbstractCegarLoop]: Abstraction has 33768 states and 182281 transitions. [2019-12-27 08:34:17,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:34:17,128 INFO L276 IsEmpty]: Start isEmpty. Operand 33768 states and 182281 transitions. [2019-12-27 08:34:17,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:34:17,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:34:17,130 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 08:34:17,333 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:34:17,334 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 08:34:17,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:34:17,335 INFO L82 PathProgramCache]: Analyzing trace with hash -298046732, now seen corresponding path program 3 times [2019-12-27 08:34:17,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:34:17,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601889955] [2019-12-27 08:34:17,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:34:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:34:17,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 08:34:17,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601889955] [2019-12-27 08:34:17,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626602031] [2019-12-27 08:34:17,395 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 08:34:17,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 08:34:17,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:34:17,487 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:34:17,488 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:34:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:34:17,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:34:17,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:34:17,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512937365] [2019-12-27 08:34:17,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:34:17,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:34:17,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:34:17,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:34:17,569 INFO L87 Difference]: Start difference. First operand 33768 states and 182281 transitions. Second operand 16 states. [2019-12-27 08:34:18,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:34:18,995 INFO L93 Difference]: Finished difference Result 115987 states and 535173 transitions. [2019-12-27 08:34:18,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:34:18,995 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 08:34:18,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:34:19,316 INFO L225 Difference]: With dead ends: 115987 [2019-12-27 08:34:19,316 INFO L226 Difference]: Without dead ends: 115977 [2019-12-27 08:34:19,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:34:19,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115977 states. [2019-12-27 08:34:21,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115977 to 33338. [2019-12-27 08:34:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33338 states. [2019-12-27 08:34:21,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33338 states to 33338 states and 179968 transitions. [2019-12-27 08:34:21,434 INFO L78 Accepts]: Start accepts. Automaton has 33338 states and 179968 transitions. Word has length 25 [2019-12-27 08:34:21,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:34:21,434 INFO L462 AbstractCegarLoop]: Abstraction has 33338 states and 179968 transitions. [2019-12-27 08:34:21,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:34:21,434 INFO L276 IsEmpty]: Start isEmpty. Operand 33338 states and 179968 transitions. [2019-12-27 08:34:21,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:34:21,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:34:21,436 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:34:21,637 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:34:21,637 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:34:21,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:34:21,638 INFO L82 PathProgramCache]: Analyzing trace with hash 591228706, now seen corresponding path program 3 times [2019-12-27 08:34:21,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:34:21,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512255675] [2019-12-27 08:34:21,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:34:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:34:21,689 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 08:34:21,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512255675] [2019-12-27 08:34:21,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448314063] [2019-12-27 08:34:21,689 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:34:21,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 08:34:21,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:34:21,773 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:34:21,774 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:34:21,854 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 08:34:21,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:34:21,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:34:21,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801849199] [2019-12-27 08:34:21,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:34:21,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:34:21,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:34:21,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:34:21,855 INFO L87 Difference]: Start difference. First operand 33338 states and 179968 transitions. Second operand 16 states. [2019-12-27 08:34:23,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:34:23,272 INFO L93 Difference]: Finished difference Result 115083 states and 530519 transitions. [2019-12-27 08:34:23,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:34:23,273 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 08:34:23,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:34:23,597 INFO L225 Difference]: With dead ends: 115083 [2019-12-27 08:34:23,597 INFO L226 Difference]: Without dead ends: 115073 [2019-12-27 08:34:23,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:34:24,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115073 states. [2019-12-27 08:34:25,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115073 to 33016. [2019-12-27 08:34:25,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33016 states. [2019-12-27 08:34:25,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33016 states to 33016 states and 178303 transitions. [2019-12-27 08:34:25,541 INFO L78 Accepts]: Start accepts. Automaton has 33016 states and 178303 transitions. Word has length 25 [2019-12-27 08:34:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:34:25,542 INFO L462 AbstractCegarLoop]: Abstraction has 33016 states and 178303 transitions. [2019-12-27 08:34:25,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:34:25,542 INFO L276 IsEmpty]: Start isEmpty. Operand 33016 states and 178303 transitions. [2019-12-27 08:34:25,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:34:25,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:34:25,544 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 08:34:25,745 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:34:25,745 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:34:25,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:34:25,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1853254278, now seen corresponding path program 4 times [2019-12-27 08:34:25,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:34:25,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107345654] [2019-12-27 08:34:25,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:34:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:34:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 08:34:25,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107345654] [2019-12-27 08:34:25,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312469610] [2019-12-27 08:34:25,800 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:34:25,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 08:34:25,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:34:25,886 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:34:25,887 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:34:25,969 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 08:34:25,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:34:25,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:34:25,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053268528] [2019-12-27 08:34:25,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:34:25,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:34:25,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:34:25,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:34:25,971 INFO L87 Difference]: Start difference. First operand 33016 states and 178303 transitions. Second operand 16 states. [2019-12-27 08:34:27,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:34:27,851 INFO L93 Difference]: Finished difference Result 116129 states and 535807 transitions. [2019-12-27 08:34:27,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:34:27,851 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 08:34:27,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:34:28,172 INFO L225 Difference]: With dead ends: 116129 [2019-12-27 08:34:28,172 INFO L226 Difference]: Without dead ends: 116115 [2019-12-27 08:34:28,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:34:28,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116115 states. [2019-12-27 08:34:29,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116115 to 32873. [2019-12-27 08:34:29,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32873 states. [2019-12-27 08:34:29,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32873 states to 32873 states and 177431 transitions. [2019-12-27 08:34:29,625 INFO L78 Accepts]: Start accepts. Automaton has 32873 states and 177431 transitions. Word has length 25 [2019-12-27 08:34:29,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:34:29,625 INFO L462 AbstractCegarLoop]: Abstraction has 32873 states and 177431 transitions. [2019-12-27 08:34:29,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:34:29,625 INFO L276 IsEmpty]: Start isEmpty. Operand 32873 states and 177431 transitions. [2019-12-27 08:34:29,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:34:29,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:34:29,627 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 08:34:29,828 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:34:29,828 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:34:29,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:34:29,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1853255208, now seen corresponding path program 4 times [2019-12-27 08:34:29,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:34:29,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695831097] [2019-12-27 08:34:29,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:34:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:34:29,898 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 08:34:29,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695831097] [2019-12-27 08:34:29,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196871131] [2019-12-27 08:34:29,898 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:34:29,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 08:34:29,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 08:34:29,986 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 08:34:29,987 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 08:34:30,079 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 08:34:30,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 08:34:30,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 08:34:30,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696327506] [2019-12-27 08:34:30,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 08:34:30,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:34:30,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 08:34:30,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 08:34:30,081 INFO L87 Difference]: Start difference. First operand 32873 states and 177431 transitions. Second operand 16 states. [2019-12-27 08:34:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:34:31,824 INFO L93 Difference]: Finished difference Result 115140 states and 530994 transitions. [2019-12-27 08:34:31,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:34:31,824 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 08:34:31,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:34:32,146 INFO L225 Difference]: With dead ends: 115140 [2019-12-27 08:34:32,146 INFO L226 Difference]: Without dead ends: 115126 [2019-12-27 08:34:32,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 08:34:32,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115126 states. [2019-12-27 08:34:33,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115126 to 32414. [2019-12-27 08:34:33,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32414 states. [2019-12-27 08:34:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32414 states to 32414 states and 174844 transitions. [2019-12-27 08:34:33,626 INFO L78 Accepts]: Start accepts. Automaton has 32414 states and 174844 transitions. Word has length 25 [2019-12-27 08:34:33,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:34:33,626 INFO L462 AbstractCegarLoop]: Abstraction has 32414 states and 174844 transitions. [2019-12-27 08:34:33,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 08:34:33,626 INFO L276 IsEmpty]: Start isEmpty. Operand 32414 states and 174844 transitions. [2019-12-27 08:34:33,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:34:33,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:34:33,628 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forcibly destroying the process [2019-12-27 08:34:34,037 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 08:34:34,037 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:34:34,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:34:34,038 INFO L82 PathProgramCache]: Analyzing trace with hash -2130118454, now seen corresponding path program 1 times [2019-12-27 08:34:34,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:34:34,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234155437] [2019-12-27 08:34:34,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:34:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:34:34,091 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 08:34:34,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234155437] [2019-12-27 08:34:34,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:34:34,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:34:34,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866827825] [2019-12-27 08:34:34,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:34:34,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:34:34,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:34:34,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:34:34,093 INFO L87 Difference]: Start difference. First operand 32414 states and 174844 transitions. Second operand 5 states. [2019-12-27 08:34:34,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:34:34,470 INFO L93 Difference]: Finished difference Result 57346 states and 297742 transitions. [2019-12-27 08:34:34,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:34:34,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 08:34:34,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:34:34,634 INFO L225 Difference]: With dead ends: 57346 [2019-12-27 08:34:34,634 INFO L226 Difference]: Without dead ends: 57314 [2019-12-27 08:34:34,635 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 08:34:34,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57314 states. [2019-12-27 08:34:35,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57314 to 40877. [2019-12-27 08:34:35,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40877 states. [2019-12-27 08:34:35,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40877 states to 40877 states and 221122 transitions. [2019-12-27 08:34:35,672 INFO L78 Accepts]: Start accepts. Automaton has 40877 states and 221122 transitions. Word has length 25 [2019-12-27 08:34:35,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:34:35,672 INFO L462 AbstractCegarLoop]: Abstraction has 40877 states and 221122 transitions. [2019-12-27 08:34:35,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:34:35,673 INFO L276 IsEmpty]: Start isEmpty. Operand 40877 states and 221122 transitions. [2019-12-27 08:34:35,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:34:35,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:34:35,675 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 08:34:35,675 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:34:35,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:34:35,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1663507096, now seen corresponding path program 5 times [2019-12-27 08:34:35,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:34:35,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71076956] [2019-12-27 08:34:35,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:34:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:34:35,735 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 08:34:35,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71076956] [2019-12-27 08:34:35,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:34:35,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:34:35,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252551557] [2019-12-27 08:34:35,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:34:35,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:34:35,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:34:35,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:34:35,737 INFO L87 Difference]: Start difference. First operand 40877 states and 221122 transitions. Second operand 9 states. [2019-12-27 08:34:37,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:34:37,692 INFO L93 Difference]: Finished difference Result 137111 states and 643211 transitions. [2019-12-27 08:34:37,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:34:37,692 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:34:37,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:34:38,077 INFO L225 Difference]: With dead ends: 137111 [2019-12-27 08:34:38,078 INFO L226 Difference]: Without dead ends: 137095 [2019-12-27 08:34:38,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:34:38,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137095 states. [2019-12-27 08:34:39,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137095 to 40351. [2019-12-27 08:34:39,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40351 states. [2019-12-27 08:34:44,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40351 states to 40351 states and 218114 transitions. [2019-12-27 08:34:44,240 INFO L78 Accepts]: Start accepts. Automaton has 40351 states and 218114 transitions. Word has length 25 [2019-12-27 08:34:44,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:34:44,241 INFO L462 AbstractCegarLoop]: Abstraction has 40351 states and 218114 transitions. [2019-12-27 08:34:44,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:34:44,241 INFO L276 IsEmpty]: Start isEmpty. Operand 40351 states and 218114 transitions. [2019-12-27 08:34:44,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:34:44,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:34:44,243 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 08:34:44,243 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:34:44,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:34:44,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1663508026, now seen corresponding path program 5 times [2019-12-27 08:34:44,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:34:44,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403573193] [2019-12-27 08:34:44,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:34:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:34:44,298 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 08:34:44,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403573193] [2019-12-27 08:34:44,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:34:44,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:34:44,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150853543] [2019-12-27 08:34:44,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:34:44,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:34:44,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:34:44,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:34:44,300 INFO L87 Difference]: Start difference. First operand 40351 states and 218114 transitions. Second operand 9 states. [2019-12-27 08:34:45,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:34:45,737 INFO L93 Difference]: Finished difference Result 135413 states and 634564 transitions. [2019-12-27 08:34:45,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 08:34:45,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 08:34:45,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:34:46,123 INFO L225 Difference]: With dead ends: 135413 [2019-12-27 08:34:46,123 INFO L226 Difference]: Without dead ends: 135397 [2019-12-27 08:34:46,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 08:34:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135397 states. [2019-12-27 08:34:48,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135397 to 39763. [2019-12-27 08:34:48,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39763 states. [2019-12-27 08:34:48,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39763 states to 39763 states and 214832 transitions. [2019-12-27 08:34:48,414 INFO L78 Accepts]: Start accepts. Automaton has 39763 states and 214832 transitions. Word has length 25 [2019-12-27 08:34:48,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:34:48,414 INFO L462 AbstractCegarLoop]: Abstraction has 39763 states and 214832 transitions. [2019-12-27 08:34:48,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:34:48,414 INFO L276 IsEmpty]: Start isEmpty. Operand 39763 states and 214832 transitions. [2019-12-27 08:34:48,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:34:48,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:34:48,416 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 08:34:48,416 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:34:48,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:34:48,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1652079256, now seen corresponding path program 6 times [2019-12-27 08:34:48,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:34:48,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85488174] [2019-12-27 08:34:48,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:34:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:34:48,468 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 08:34:48,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85488174] [2019-12-27 08:34:48,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:34:48,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:34:48,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642504685] [2019-12-27 08:34:48,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:34:48,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:34:48,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:34:48,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:34:48,470 INFO L87 Difference]: Start difference. First operand 39763 states and 214832 transitions. Second operand 9 states. Received shutdown request... [2019-12-27 08:34:48,644 WARN L209 SmtUtils]: Removed 1 from assertion stack [2019-12-27 08:34:48,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 08:34:48,645 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 08:34:48,647 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 08:34:48,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:34:48 BasicIcfg [2019-12-27 08:34:48,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 08:34:48,649 INFO L168 Benchmark]: Toolchain (without parser) took 227562.10 ms. Allocated memory was 146.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 08:34:48,649 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 08:34:48,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 722.55 ms. Allocated memory was 146.3 MB in the beginning and 202.4 MB in the end (delta: 56.1 MB). Free memory was 101.6 MB in the beginning and 161.9 MB in the end (delta: -60.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 08:34:48,650 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.93 ms. Allocated memory is still 202.4 MB. Free memory was 161.9 MB in the beginning and 160.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 08:34:48,650 INFO L168 Benchmark]: Boogie Preprocessor took 30.75 ms. Allocated memory is still 202.4 MB. Free memory was 160.0 MB in the beginning and 158.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-27 08:34:48,651 INFO L168 Benchmark]: RCFGBuilder took 406.37 ms. Allocated memory is still 202.4 MB. Free memory was 158.1 MB in the beginning and 139.5 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2019-12-27 08:34:48,651 INFO L168 Benchmark]: TraceAbstraction took 226344.15 ms. Allocated memory was 202.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 138.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 08:34:48,653 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.53 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 722.55 ms. Allocated memory was 146.3 MB in the beginning and 202.4 MB in the end (delta: 56.1 MB). Free memory was 101.6 MB in the beginning and 161.9 MB in the end (delta: -60.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.93 ms. Allocated memory is still 202.4 MB. Free memory was 161.9 MB in the beginning and 160.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.75 ms. Allocated memory is still 202.4 MB. Free memory was 160.0 MB in the beginning and 158.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 406.37 ms. Allocated memory is still 202.4 MB. Free memory was 158.1 MB in the beginning and 139.5 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 226344.15 ms. Allocated memory was 202.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 138.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.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, 0 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, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1034 CheckedPairsTotal, 57 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.5s, 95 ProgramPointsBefore, 34 ProgramPointsAfterwards, 85 TransitionsBefore, 27 TransitionsAfterwards, 1308 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 2 ConcurrentYvCompositions, 4 ChoiceCompositions, 625 VarBasedMoverChecksPositive, 16 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1615 CheckedPairsTotal, 69 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.8s, 114 ProgramPointsBefore, 42 ProgramPointsAfterwards, 101 TransitionsBefore, 33 TransitionsAfterwards, 1756 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 4 ConcurrentYvCompositions, 5 ChoiceCompositions, 851 VarBasedMoverChecksPositive, 17 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 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, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2604 CheckedPairsTotal, 97 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.4s, 152 ProgramPointsBefore, 58 ProgramPointsAfterwards, 133 TransitionsBefore, 45 TransitionsAfterwards, 2832 CoEnabledTransitionPairs, 6 FixpointIterations, 62 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 4 ConcurrentYvCompositions, 7 ChoiceCompositions, 1357 VarBasedMoverChecksPositive, 25 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3471 CheckedPairsTotal, 112 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (39763states) and FLOYD_HOARE automaton (currently 12 states, 9 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 1ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 51 locations, 1 error locations. Result: TIMEOUT, OverallTime: 147.9s, OverallIterations: 39, TraceHistogramMax: 5, AutomataDifference: 56.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2350 SDtfs, 11537 SDslu, 9482 SDs, 0 SdLazy, 17126 SolverSat, 936 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1281 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 938 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6684 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40877occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 77.5s AutomataMinimizationTime, 38 MinimizatonAttempts, 2181354 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1339 NumberOfCodeBlocks, 1315 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 1278 ConstructedInterpolants, 0 QuantifiedInterpolants, 184636 SizeOfPredicates, 120 NumberOfNonLiveVariables, 2460 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 61 InterpolantComputations, 17 PerfectInterpolantSequences, 466/842 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