/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:00:40,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:00:40,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:00:40,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:00:40,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:00:40,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:00:40,751 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:00:40,755 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:00:40,758 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:00:40,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:00:40,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:00:40,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:00:40,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:00:40,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:00:40,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:00:40,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:00:40,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:00:40,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:00:40,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:00:40,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:00:40,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:00:40,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:00:40,787 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:00:40,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:00:40,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:00:40,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:00:40,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:00:40,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:00:40,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:00:40,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:00:40,809 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:00:40,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:00:40,810 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:00:40,811 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:00:40,817 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:00:40,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:00:40,818 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:00:40,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:00:40,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:00:40,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:00:40,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:00:40,822 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-05 23:00:40,864 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:00:40,865 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:00:40,867 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:00:40,867 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:00:40,867 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:00:40,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:00:40,868 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:00:40,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:00:40,868 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:00:40,868 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:00:40,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:00:40,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:00:40,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:00:40,871 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:00:40,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:00:40,872 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:00:40,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:00:40,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:00:40,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:00:40,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:00:40,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:00:40,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:00:40,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:00:40,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-05 23:00:40,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:00:40,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:00:40,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:00:40,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:00:40,874 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-05 23:00:40,875 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-05 23:00:41,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:00:41,162 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:00:41,165 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:00:41,167 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:00:41,167 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:00:41,168 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-1.i [2020-10-05 23:00:41,231 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0b8f62f6/29d402e0db974d918602c92278721749/FLAG0d70e1016 [2020-10-05 23:00:41,741 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:00:41,741 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-1.i [2020-10-05 23:00:41,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0b8f62f6/29d402e0db974d918602c92278721749/FLAG0d70e1016 [2020-10-05 23:00:42,103 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0b8f62f6/29d402e0db974d918602c92278721749 [2020-10-05 23:00:42,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:00:42,116 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:00:42,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:00:42,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:00:42,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:00:42,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:00:42" (1/1) ... [2020-10-05 23:00:42,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4be9154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:00:42, skipping insertion in model container [2020-10-05 23:00:42,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:00:42" (1/1) ... [2020-10-05 23:00:42,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:00:42,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:00:42,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:00:42,685 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:00:42,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:00:42,837 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:00:42,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:00:42 WrapperNode [2020-10-05 23:00:42,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:00:42,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:00:42,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:00:42,841 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:00:42,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:00:42" (1/1) ... [2020-10-05 23:00:42,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:00:42" (1/1) ... [2020-10-05 23:00:42,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:00:42,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:00:42,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:00:42,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:00:42,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:00:42" (1/1) ... [2020-10-05 23:00:42,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:00:42" (1/1) ... [2020-10-05 23:00:42,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:00:42" (1/1) ... [2020-10-05 23:00:42,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:00:42" (1/1) ... [2020-10-05 23:00:42,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:00:42" (1/1) ... [2020-10-05 23:00:42,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:00:42" (1/1) ... [2020-10-05 23:00:42,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:00:42" (1/1) ... [2020-10-05 23:00:42,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:00:42,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:00:42,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:00:42,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:00:42,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:00:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:00:42,991 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2020-10-05 23:00:42,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2020-10-05 23:00:42,991 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2020-10-05 23:00:42,992 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2020-10-05 23:00:42,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:00:42,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:00:42,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:00:42,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:00:42,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:00:42,994 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:00:43,353 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:00:43,354 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-05 23:00:43,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:00:43 BoogieIcfgContainer [2020-10-05 23:00:43,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:00:43,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:00:43,357 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:00:43,361 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:00:43,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:00:42" (1/3) ... [2020-10-05 23:00:43,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26be736d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:00:43, skipping insertion in model container [2020-10-05 23:00:43,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:00:42" (2/3) ... [2020-10-05 23:00:43,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26be736d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:00:43, skipping insertion in model container [2020-10-05 23:00:43,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:00:43" (3/3) ... [2020-10-05 23:00:43,365 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-1.i [2020-10-05 23:00:43,376 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:00:43,377 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:00:43,384 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-05 23:00:43,385 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:00:43,413 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,414 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,414 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,414 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,415 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,415 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,415 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,418 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,419 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,423 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,423 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,424 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,424 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,424 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,432 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,432 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,433 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,433 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,433 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:43,447 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-05 23:00:43,466 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:00:43,466 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:00:43,466 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 23:00:43,466 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:00:43,466 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:00:43,466 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:00:43,467 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:00:43,467 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:00:43,479 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 58 transitions, 126 flow [2020-10-05 23:00:43,481 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 61 places, 58 transitions, 126 flow [2020-10-05 23:00:43,525 INFO L129 PetriNetUnfolder]: 4/68 cut-off events. [2020-10-05 23:00:43,526 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:00:43,532 INFO L80 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 68 events. 4/68 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 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2020-10-05 23:00:43,535 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 61 places, 58 transitions, 126 flow [2020-10-05 23:00:43,559 INFO L129 PetriNetUnfolder]: 4/68 cut-off events. [2020-10-05 23:00:43,560 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:00:43,561 INFO L80 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 68 events. 4/68 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 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2020-10-05 23:00:43,563 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 592 [2020-10-05 23:00:43,564 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 23:00:44,998 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2020-10-05 23:00:45,228 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2020-10-05 23:00:45,316 INFO L206 etLargeBlockEncoding]: Checked pairs total: 486 [2020-10-05 23:00:45,316 INFO L214 etLargeBlockEncoding]: Total number of compositions: 51 [2020-10-05 23:00:45,319 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 12 transitions, 34 flow [2020-10-05 23:00:45,328 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-10-05 23:00:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-10-05 23:00:45,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:00:45,337 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:45,338 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:00:45,338 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:00:45,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:45,344 INFO L82 PathProgramCache]: Analyzing trace with hash 229686, now seen corresponding path program 1 times [2020-10-05 23:00:45,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:45,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97585003] [2020-10-05 23:00:45,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:45,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:00:45,559 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97585003] [2020-10-05 23:00:45,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:00:45,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:00:45,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363407668] [2020-10-05 23:00:45,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:00:45,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:00:45,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:00:45,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:00:45,594 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-10-05 23:00:45,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:00:45,639 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2020-10-05 23:00:45,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:00:45,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:00:45,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:00:45,653 INFO L225 Difference]: With dead ends: 35 [2020-10-05 23:00:45,653 INFO L226 Difference]: Without dead ends: 31 [2020-10-05 23:00:45,655 INFO L675 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 [2020-10-05 23:00:45,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-10-05 23:00:45,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-10-05 23:00:45,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-05 23:00:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2020-10-05 23:00:45,698 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2020-10-05 23:00:45,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:00:45,698 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-10-05 23:00:45,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:00:45,699 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2020-10-05 23:00:45,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-05 23:00:45,699 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:45,700 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:00:45,700 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:00:45,700 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:00:45,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:45,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1647647331, now seen corresponding path program 1 times [2020-10-05 23:00:45,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:45,702 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961398006] [2020-10-05 23:00:45,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:00:45,780 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961398006] [2020-10-05 23:00:45,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:00:45,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:00:45,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081526078] [2020-10-05 23:00:45,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:00:45,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:00:45,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:00:45,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:00:45,784 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2020-10-05 23:00:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:00:45,804 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-10-05 23:00:45,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:00:45,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-10-05 23:00:45,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:00:45,806 INFO L225 Difference]: With dead ends: 26 [2020-10-05 23:00:45,806 INFO L226 Difference]: Without dead ends: 24 [2020-10-05 23:00:45,807 INFO L675 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 [2020-10-05 23:00:45,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-10-05 23:00:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-05 23:00:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-05 23:00:45,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-10-05 23:00:45,812 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2020-10-05 23:00:45,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:00:45,812 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2020-10-05 23:00:45,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:00:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2020-10-05 23:00:45,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-05 23:00:45,813 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:45,813 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-10-05 23:00:45,814 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:00:45,814 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:00:45,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:45,814 INFO L82 PathProgramCache]: Analyzing trace with hash -462538936, now seen corresponding path program 1 times [2020-10-05 23:00:45,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:45,815 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757455470] [2020-10-05 23:00:45,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:00:45,842 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:00:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:00:45,857 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:00:45,882 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:00:45,882 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:00:45,882 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:00:45,883 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:00:45,884 WARN L363 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:00:45,884 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2020-10-05 23:00:45,893 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,893 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,893 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,894 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,894 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,894 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,894 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,894 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,895 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,895 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,895 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,895 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,895 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,896 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,896 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,898 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,901 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,901 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,902 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,902 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,902 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,905 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,906 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,906 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,906 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,906 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:45,913 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-05 23:00:45,913 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:00:45,914 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:00:45,914 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 23:00:45,914 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:00:45,914 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:00:45,914 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:00:45,914 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:00:45,914 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:00:45,917 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 74 transitions, 172 flow [2020-10-05 23:00:45,917 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 74 transitions, 172 flow [2020-10-05 23:00:45,938 INFO L129 PetriNetUnfolder]: 5/89 cut-off events. [2020-10-05 23:00:45,938 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-05 23:00:45,940 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 89 events. 5/89 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 120 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 98. Up to 6 conditions per place. [2020-10-05 23:00:45,942 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 74 transitions, 172 flow [2020-10-05 23:00:45,958 INFO L129 PetriNetUnfolder]: 5/89 cut-off events. [2020-10-05 23:00:45,958 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-05 23:00:45,959 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 89 events. 5/89 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 120 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 98. Up to 6 conditions per place. [2020-10-05 23:00:45,961 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 920 [2020-10-05 23:00:45,961 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 23:00:47,358 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-05 23:00:47,509 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-10-05 23:00:47,515 INFO L206 etLargeBlockEncoding]: Checked pairs total: 942 [2020-10-05 23:00:47,516 INFO L214 etLargeBlockEncoding]: Total number of compositions: 62 [2020-10-05 23:00:47,516 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 21 transitions, 66 flow [2020-10-05 23:00:47,528 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2020-10-05 23:00:47,529 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2020-10-05 23:00:47,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:00:47,529 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:47,529 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:00:47,530 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:00:47,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:47,530 INFO L82 PathProgramCache]: Analyzing trace with hash 384194, now seen corresponding path program 1 times [2020-10-05 23:00:47,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:47,531 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065060987] [2020-10-05 23:00:47,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:00:47,570 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065060987] [2020-10-05 23:00:47,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:00:47,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:00:47,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958431304] [2020-10-05 23:00:47,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:00:47,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:00:47,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:00:47,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:00:47,572 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2020-10-05 23:00:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:00:47,606 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2020-10-05 23:00:47,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:00:47,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:00:47,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:00:47,611 INFO L225 Difference]: With dead ends: 185 [2020-10-05 23:00:47,612 INFO L226 Difference]: Without dead ends: 171 [2020-10-05 23:00:47,612 INFO L675 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 [2020-10-05 23:00:47,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-10-05 23:00:47,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2020-10-05 23:00:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-10-05 23:00:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 418 transitions. [2020-10-05 23:00:47,636 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 418 transitions. Word has length 3 [2020-10-05 23:00:47,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:00:47,637 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 418 transitions. [2020-10-05 23:00:47,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:00:47,637 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 418 transitions. [2020-10-05 23:00:47,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:00:47,641 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:47,641 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:00:47,641 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:00:47,641 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:00:47,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:47,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1694917346, now seen corresponding path program 1 times [2020-10-05 23:00:47,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:47,642 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942963825] [2020-10-05 23:00:47,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:00:47,696 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942963825] [2020-10-05 23:00:47,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:00:47,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:00:47,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886717641] [2020-10-05 23:00:47,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:00:47,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:00:47,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:00:47,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:00:47,698 INFO L87 Difference]: Start difference. First operand 171 states and 418 transitions. Second operand 5 states. [2020-10-05 23:00:47,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:00:47,785 INFO L93 Difference]: Finished difference Result 205 states and 460 transitions. [2020-10-05 23:00:47,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:00:47,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:00:47,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:00:47,791 INFO L225 Difference]: With dead ends: 205 [2020-10-05 23:00:47,791 INFO L226 Difference]: Without dead ends: 201 [2020-10-05 23:00:47,792 INFO L675 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 [2020-10-05 23:00:47,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-10-05 23:00:47,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2020-10-05 23:00:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-05 23:00:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2020-10-05 23:00:47,813 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2020-10-05 23:00:47,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:00:47,813 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2020-10-05 23:00:47,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:00:47,814 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2020-10-05 23:00:47,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:00:47,815 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:47,815 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:00:47,815 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:00:47,816 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:00:47,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:47,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1027741454, now seen corresponding path program 1 times [2020-10-05 23:00:47,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:47,817 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653588884] [2020-10-05 23:00:47,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:00:47,879 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653588884] [2020-10-05 23:00:47,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:00:47,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:00:47,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819822219] [2020-10-05 23:00:47,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:00:47,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:00:47,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:00:47,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:00:47,897 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2020-10-05 23:00:47,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:00:47,975 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2020-10-05 23:00:47,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:00:47,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:00:47,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:00:47,978 INFO L225 Difference]: With dead ends: 189 [2020-10-05 23:00:47,978 INFO L226 Difference]: Without dead ends: 185 [2020-10-05 23:00:47,979 INFO L675 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 [2020-10-05 23:00:47,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-10-05 23:00:47,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2020-10-05 23:00:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-05 23:00:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2020-10-05 23:00:47,997 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2020-10-05 23:00:47,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:00:47,998 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2020-10-05 23:00:47,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:00:47,998 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2020-10-05 23:00:47,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:00:48,000 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:48,000 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:00:48,000 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:00:48,000 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:00:48,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:48,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1792799235, now seen corresponding path program 1 times [2020-10-05 23:00:48,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:48,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478117348] [2020-10-05 23:00:48,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:00:48,015 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:00:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:00:48,027 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:00:48,035 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:00:48,035 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:00:48,036 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:00:48,036 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:00:48,036 WARN L363 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:00:48,038 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2020-10-05 23:00:48,048 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,049 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,049 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,049 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,049 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,049 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,049 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,050 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,050 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,050 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,050 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,050 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,050 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,051 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,051 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,051 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,051 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,051 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,051 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,051 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,052 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,052 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,052 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,053 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,053 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,053 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,053 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,053 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,053 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,054 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,054 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,054 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,054 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,054 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,055 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,055 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,055 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,055 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,055 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,056 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,056 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,057 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,057 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,057 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,058 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,058 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,058 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,059 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,059 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,059 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,061 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,061 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,061 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,061 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,062 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,063 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,063 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,063 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,063 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,063 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,065 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,065 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,065 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,065 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,066 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,067 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,067 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,068 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,068 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,069 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,069 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,070 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,070 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:48,071 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 23:00:48,071 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:00:48,072 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:00:48,072 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 23:00:48,072 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:00:48,072 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:00:48,072 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:00:48,072 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:00:48,072 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:00:48,074 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 90 transitions, 222 flow [2020-10-05 23:00:48,074 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 90 transitions, 222 flow [2020-10-05 23:00:48,091 INFO L129 PetriNetUnfolder]: 6/110 cut-off events. [2020-10-05 23:00:48,092 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-05 23:00:48,093 INFO L80 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 110 events. 6/110 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 163 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2020-10-05 23:00:48,095 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 90 transitions, 222 flow [2020-10-05 23:00:48,111 INFO L129 PetriNetUnfolder]: 6/110 cut-off events. [2020-10-05 23:00:48,111 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-05 23:00:48,113 INFO L80 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 110 events. 6/110 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 163 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2020-10-05 23:00:48,115 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1308 [2020-10-05 23:00:48,115 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 23:00:49,453 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2020-10-05 23:00:49,708 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2020-10-05 23:00:49,849 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-10-05 23:00:49,856 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1426 [2020-10-05 23:00:49,857 INFO L214 etLargeBlockEncoding]: Total number of compositions: 74 [2020-10-05 23:00:49,857 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 27 transitions, 96 flow [2020-10-05 23:00:49,893 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2020-10-05 23:00:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2020-10-05 23:00:49,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:00:49,896 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:49,896 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:00:49,897 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:00:49,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:49,897 INFO L82 PathProgramCache]: Analyzing trace with hash 567457, now seen corresponding path program 1 times [2020-10-05 23:00:49,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:49,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292354995] [2020-10-05 23:00:49,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:00:49,937 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292354995] [2020-10-05 23:00:49,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:00:49,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:00:49,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466768137] [2020-10-05 23:00:49,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:00:49,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:00:49,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:00:49,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:00:49,940 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2020-10-05 23:00:49,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:00:49,985 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2020-10-05 23:00:49,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:00:49,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:00:49,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:00:49,992 INFO L225 Difference]: With dead ends: 600 [2020-10-05 23:00:49,992 INFO L226 Difference]: Without dead ends: 559 [2020-10-05 23:00:49,993 INFO L675 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 [2020-10-05 23:00:50,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-10-05 23:00:50,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2020-10-05 23:00:50,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2020-10-05 23:00:50,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1737 transitions. [2020-10-05 23:00:50,063 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1737 transitions. Word has length 3 [2020-10-05 23:00:50,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:00:50,064 INFO L479 AbstractCegarLoop]: Abstraction has 559 states and 1737 transitions. [2020-10-05 23:00:50,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:00:50,064 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1737 transitions. [2020-10-05 23:00:50,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:00:50,065 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:50,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:00:50,065 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:00:50,065 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:00:50,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:50,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1052273544, now seen corresponding path program 1 times [2020-10-05 23:00:50,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:50,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274976070] [2020-10-05 23:00:50,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:50,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:00:50,101 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274976070] [2020-10-05 23:00:50,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:00:50,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:00:50,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584924454] [2020-10-05 23:00:50,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:00:50,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:00:50,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:00:50,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:00:50,103 INFO L87 Difference]: Start difference. First operand 559 states and 1737 transitions. Second operand 5 states. [2020-10-05 23:00:50,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:00:50,230 INFO L93 Difference]: Finished difference Result 817 states and 2317 transitions. [2020-10-05 23:00:50,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:00:50,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:00:50,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:00:50,239 INFO L225 Difference]: With dead ends: 817 [2020-10-05 23:00:50,240 INFO L226 Difference]: Without dead ends: 812 [2020-10-05 23:00:50,240 INFO L675 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 [2020-10-05 23:00:50,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-10-05 23:00:50,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 585. [2020-10-05 23:00:50,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2020-10-05 23:00:50,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1832 transitions. [2020-10-05 23:00:50,273 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1832 transitions. Word has length 9 [2020-10-05 23:00:50,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:00:50,274 INFO L479 AbstractCegarLoop]: Abstraction has 585 states and 1832 transitions. [2020-10-05 23:00:50,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:00:50,274 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1832 transitions. [2020-10-05 23:00:50,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:00:50,275 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:50,275 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:00:50,276 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:00:50,276 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:00:50,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:50,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1096280394, now seen corresponding path program 1 times [2020-10-05 23:00:50,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:50,277 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350249626] [2020-10-05 23:00:50,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:00:50,314 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350249626] [2020-10-05 23:00:50,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:00:50,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:00:50,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837257400] [2020-10-05 23:00:50,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:00:50,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:00:50,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:00:50,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:00:50,316 INFO L87 Difference]: Start difference. First operand 585 states and 1832 transitions. Second operand 5 states. [2020-10-05 23:00:50,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:00:50,413 INFO L93 Difference]: Finished difference Result 843 states and 2406 transitions. [2020-10-05 23:00:50,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:00:50,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:00:50,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:00:50,420 INFO L225 Difference]: With dead ends: 843 [2020-10-05 23:00:50,420 INFO L226 Difference]: Without dead ends: 836 [2020-10-05 23:00:50,421 INFO L675 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 [2020-10-05 23:00:50,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2020-10-05 23:00:50,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 611. [2020-10-05 23:00:50,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2020-10-05 23:00:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1906 transitions. [2020-10-05 23:00:50,449 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1906 transitions. Word has length 13 [2020-10-05 23:00:50,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:00:50,450 INFO L479 AbstractCegarLoop]: Abstraction has 611 states and 1906 transitions. [2020-10-05 23:00:50,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:00:50,450 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1906 transitions. [2020-10-05 23:00:50,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:00:50,451 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:50,451 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:00:50,451 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:00:50,452 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:00:50,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:50,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2044985054, now seen corresponding path program 1 times [2020-10-05 23:00:50,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:50,453 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997381953] [2020-10-05 23:00:50,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:00:50,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997381953] [2020-10-05 23:00:50,521 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449345413] [2020-10-05 23:00:50,521 INFO L95 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 [2020-10-05 23:00:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:50,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:00:50,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:00:50,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:00:50,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:00:50,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:00:50,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129709667] [2020-10-05 23:00:50,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:00:50,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:00:50,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:00:50,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:00:50,693 INFO L87 Difference]: Start difference. First operand 611 states and 1906 transitions. Second operand 12 states. [2020-10-05 23:00:51,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:00:51,007 INFO L93 Difference]: Finished difference Result 1059 states and 2818 transitions. [2020-10-05 23:00:51,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:00:51,007 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-05 23:00:51,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:00:51,028 INFO L225 Difference]: With dead ends: 1059 [2020-10-05 23:00:51,028 INFO L226 Difference]: Without dead ends: 1052 [2020-10-05 23:00:51,029 INFO L675 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 [2020-10-05 23:00:51,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2020-10-05 23:00:51,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 591. [2020-10-05 23:00:51,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-10-05 23:00:51,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1840 transitions. [2020-10-05 23:00:51,061 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1840 transitions. Word has length 15 [2020-10-05 23:00:51,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:00:51,061 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 1840 transitions. [2020-10-05 23:00:51,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:00:51,061 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1840 transitions. [2020-10-05 23:00:51,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:00:51,064 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:51,064 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:00:51,278 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-10-05 23:00:51,279 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:00:51,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:51,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1258473782, now seen corresponding path program 2 times [2020-10-05 23:00:51,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:51,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425530015] [2020-10-05 23:00:51,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:00:51,332 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425530015] [2020-10-05 23:00:51,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:00:51,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:00:51,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055593273] [2020-10-05 23:00:51,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:00:51,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:00:51,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:00:51,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:00:51,334 INFO L87 Difference]: Start difference. First operand 591 states and 1840 transitions. Second operand 7 states. [2020-10-05 23:00:51,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:00:51,613 INFO L93 Difference]: Finished difference Result 1053 states and 2807 transitions. [2020-10-05 23:00:51,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:00:51,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 23:00:51,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:00:51,623 INFO L225 Difference]: With dead ends: 1053 [2020-10-05 23:00:51,624 INFO L226 Difference]: Without dead ends: 1045 [2020-10-05 23:00:51,624 INFO L675 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 [2020-10-05 23:00:51,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2020-10-05 23:00:51,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2020-10-05 23:00:51,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2020-10-05 23:00:51,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2020-10-05 23:00:51,651 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2020-10-05 23:00:51,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:00:51,651 INFO L479 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2020-10-05 23:00:51,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:00:51,651 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2020-10-05 23:00:51,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:00:51,652 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:51,652 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:00:51,652 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:00:51,653 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:00:51,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:51,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1734594488, now seen corresponding path program 1 times [2020-10-05 23:00:51,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:51,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952357328] [2020-10-05 23:00:51,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:51,743 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:00:51,744 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952357328] [2020-10-05 23:00:51,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:00:51,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:00:51,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275349252] [2020-10-05 23:00:51,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:00:51,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:00:51,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:00:51,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:00:51,746 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2020-10-05 23:00:51,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:00:51,833 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2020-10-05 23:00:51,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:00:51,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:00:51,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:00:51,839 INFO L225 Difference]: With dead ends: 736 [2020-10-05 23:00:51,839 INFO L226 Difference]: Without dead ends: 728 [2020-10-05 23:00:51,840 INFO L675 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 [2020-10-05 23:00:51,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2020-10-05 23:00:51,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2020-10-05 23:00:51,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2020-10-05 23:00:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2020-10-05 23:00:51,867 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2020-10-05 23:00:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:00:51,867 INFO L479 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2020-10-05 23:00:51,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:00:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2020-10-05 23:00:51,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:00:51,869 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:51,870 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:00:51,870 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:00:51,870 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:00:51,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:51,871 INFO L82 PathProgramCache]: Analyzing trace with hash -2065233823, now seen corresponding path program 1 times [2020-10-05 23:00:51,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:51,873 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338922031] [2020-10-05 23:00:51,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:00:51,899 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:00:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:00:51,918 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:00:51,932 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:00:51,932 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:00:51,932 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:00:51,932 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:00:51,933 WARN L363 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:00:51,934 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2020-10-05 23:00:51,953 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,954 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,954 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,954 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,954 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,955 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,955 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,955 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,955 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,955 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,955 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,955 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,956 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,956 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,956 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,956 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,956 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,956 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,957 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,957 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,957 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,957 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,958 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,958 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,958 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,958 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,958 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,959 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,959 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,959 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,960 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,961 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,961 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,961 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,961 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,962 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,962 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,962 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,962 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,962 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,963 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,963 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,963 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,963 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,963 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,964 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,964 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,964 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,964 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,965 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,965 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,965 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,965 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,965 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,966 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,966 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,966 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,966 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,967 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,967 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,967 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,968 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,968 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,968 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,968 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,973 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,974 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,974 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,974 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,974 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,976 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,976 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,976 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,976 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,976 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,979 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,979 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,979 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,979 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,980 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,984 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,985 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,985 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,987 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,987 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,988 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,989 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,989 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,990 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,992 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,992 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,993 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,993 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:00:51,995 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-05 23:00:51,995 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:00:51,995 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:00:51,995 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 23:00:51,995 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:00:51,996 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:00:51,996 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:00:51,996 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:00:51,996 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:00:51,998 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 106 transitions, 276 flow [2020-10-05 23:00:51,999 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 106 transitions, 276 flow [2020-10-05 23:00:52,020 INFO L129 PetriNetUnfolder]: 7/131 cut-off events. [2020-10-05 23:00:52,021 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-05 23:00:52,023 INFO L80 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 131 events. 7/131 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 151. Up to 10 conditions per place. [2020-10-05 23:00:52,026 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 106 transitions, 276 flow [2020-10-05 23:00:52,042 INFO L129 PetriNetUnfolder]: 7/131 cut-off events. [2020-10-05 23:00:52,042 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-05 23:00:52,043 INFO L80 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 131 events. 7/131 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 151. Up to 10 conditions per place. [2020-10-05 23:00:52,047 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1756 [2020-10-05 23:00:52,047 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 23:00:53,970 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-05 23:00:54,137 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2020-10-05 23:00:54,250 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2033 [2020-10-05 23:00:54,250 INFO L214 etLargeBlockEncoding]: Total number of compositions: 86 [2020-10-05 23:00:54,251 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 33 transitions, 130 flow [2020-10-05 23:00:54,378 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2020-10-05 23:00:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2020-10-05 23:00:54,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:00:54,378 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:54,379 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:00:54,379 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:00:54,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:54,379 INFO L82 PathProgramCache]: Analyzing trace with hash 779528, now seen corresponding path program 1 times [2020-10-05 23:00:54,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:54,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577349052] [2020-10-05 23:00:54,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:54,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:00:54,400 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577349052] [2020-10-05 23:00:54,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:00:54,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:00:54,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055192857] [2020-10-05 23:00:54,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:00:54,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:00:54,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:00:54,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:00:54,402 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2020-10-05 23:00:54,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:00:54,446 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2020-10-05 23:00:54,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:00:54,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:00:54,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:00:54,465 INFO L225 Difference]: With dead ends: 1889 [2020-10-05 23:00:54,465 INFO L226 Difference]: Without dead ends: 1767 [2020-10-05 23:00:54,465 INFO L675 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 [2020-10-05 23:00:54,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2020-10-05 23:00:54,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1767. [2020-10-05 23:00:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2020-10-05 23:00:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 6690 transitions. [2020-10-05 23:00:54,559 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 6690 transitions. Word has length 3 [2020-10-05 23:00:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:00:54,559 INFO L479 AbstractCegarLoop]: Abstraction has 1767 states and 6690 transitions. [2020-10-05 23:00:54,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:00:54,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 6690 transitions. [2020-10-05 23:00:54,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:00:54,560 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:54,560 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:00:54,560 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:00:54,560 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:00:54,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:54,561 INFO L82 PathProgramCache]: Analyzing trace with hash -666106918, now seen corresponding path program 1 times [2020-10-05 23:00:54,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:54,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574099025] [2020-10-05 23:00:54,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:00:54,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574099025] [2020-10-05 23:00:54,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:00:54,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:00:54,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564723713] [2020-10-05 23:00:54,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:00:54,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:00:54,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:00:54,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:00:54,614 INFO L87 Difference]: Start difference. First operand 1767 states and 6690 transitions. Second operand 5 states. [2020-10-05 23:00:54,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:00:54,755 INFO L93 Difference]: Finished difference Result 2905 states and 10138 transitions. [2020-10-05 23:00:54,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:00:54,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:00:54,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:00:54,788 INFO L225 Difference]: With dead ends: 2905 [2020-10-05 23:00:54,788 INFO L226 Difference]: Without dead ends: 2899 [2020-10-05 23:00:54,790 INFO L675 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 [2020-10-05 23:00:54,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-10-05 23:00:54,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1966. [2020-10-05 23:00:54,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2020-10-05 23:00:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 7503 transitions. [2020-10-05 23:00:54,923 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 7503 transitions. Word has length 9 [2020-10-05 23:00:54,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:00:54,923 INFO L479 AbstractCegarLoop]: Abstraction has 1966 states and 7503 transitions. [2020-10-05 23:00:54,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:00:54,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 7503 transitions. [2020-10-05 23:00:54,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:00:54,924 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:54,924 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:00:54,924 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 23:00:54,925 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:00:54,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:54,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1766896000, now seen corresponding path program 1 times [2020-10-05 23:00:54,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:54,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643575876] [2020-10-05 23:00:54,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:54,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:00:54,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643575876] [2020-10-05 23:00:54,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:00:54,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:00:54,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142346628] [2020-10-05 23:00:54,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:00:54,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:00:54,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:00:54,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:00:54,972 INFO L87 Difference]: Start difference. First operand 1966 states and 7503 transitions. Second operand 5 states. [2020-10-05 23:00:55,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:00:55,101 INFO L93 Difference]: Finished difference Result 3204 states and 11312 transitions. [2020-10-05 23:00:55,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:00:55,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:00:55,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:00:55,140 INFO L225 Difference]: With dead ends: 3204 [2020-10-05 23:00:55,140 INFO L226 Difference]: Without dead ends: 3194 [2020-10-05 23:00:55,141 INFO L675 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 [2020-10-05 23:00:55,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2020-10-05 23:00:55,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2200. [2020-10-05 23:00:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2020-10-05 23:00:55,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 8453 transitions. [2020-10-05 23:00:55,267 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 8453 transitions. Word has length 13 [2020-10-05 23:00:55,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:00:55,269 INFO L479 AbstractCegarLoop]: Abstraction has 2200 states and 8453 transitions. [2020-10-05 23:00:55,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:00:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 8453 transitions. [2020-10-05 23:00:55,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:00:55,270 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:55,272 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:00:55,272 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 23:00:55,272 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:00:55,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:55,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1022394712, now seen corresponding path program 1 times [2020-10-05 23:00:55,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:55,273 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177837152] [2020-10-05 23:00:55,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:00:55,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177837152] [2020-10-05 23:00:55,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409187195] [2020-10-05 23:00:55,374 INFO L95 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 [2020-10-05 23:00:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:55,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:00:55,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:00:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:00:55,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:00:55,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:00:55,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221750397] [2020-10-05 23:00:55,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:00:55,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:00:55,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:00:55,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:00:55,542 INFO L87 Difference]: Start difference. First operand 2200 states and 8453 transitions. Second operand 12 states. [2020-10-05 23:00:55,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:00:55,868 INFO L93 Difference]: Finished difference Result 4556 states and 14911 transitions. [2020-10-05 23:00:55,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:00:55,868 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-05 23:00:55,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:00:55,902 INFO L225 Difference]: With dead ends: 4556 [2020-10-05 23:00:55,902 INFO L226 Difference]: Without dead ends: 4546 [2020-10-05 23:00:55,904 INFO L675 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 [2020-10-05 23:00:55,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4546 states. [2020-10-05 23:00:56,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4546 to 2157. [2020-10-05 23:00:56,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2020-10-05 23:00:56,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 8278 transitions. [2020-10-05 23:00:56,038 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 8278 transitions. Word has length 15 [2020-10-05 23:00:56,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:00:56,038 INFO L479 AbstractCegarLoop]: Abstraction has 2157 states and 8278 transitions. [2020-10-05 23:00:56,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:00:56,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 8278 transitions. [2020-10-05 23:00:56,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:00:56,039 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:56,040 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:00:56,253 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-10-05 23:00:56,253 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:00:56,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:56,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1474969304, now seen corresponding path program 2 times [2020-10-05 23:00:56,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:56,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792109565] [2020-10-05 23:00:56,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:56,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:00:56,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792109565] [2020-10-05 23:00:56,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:00:56,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:00:56,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922804562] [2020-10-05 23:00:56,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:00:56,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:00:56,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:00:56,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:00:56,334 INFO L87 Difference]: Start difference. First operand 2157 states and 8278 transitions. Second operand 7 states. [2020-10-05 23:00:56,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:00:56,611 INFO L93 Difference]: Finished difference Result 4612 states and 15111 transitions. [2020-10-05 23:00:56,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:00:56,612 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 23:00:56,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:00:56,636 INFO L225 Difference]: With dead ends: 4612 [2020-10-05 23:00:56,636 INFO L226 Difference]: Without dead ends: 4601 [2020-10-05 23:00:56,638 INFO L675 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 [2020-10-05 23:00:56,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2020-10-05 23:00:56,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 2035. [2020-10-05 23:00:56,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2020-10-05 23:00:56,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 7845 transitions. [2020-10-05 23:00:56,806 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 7845 transitions. Word has length 15 [2020-10-05 23:00:56,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:00:56,806 INFO L479 AbstractCegarLoop]: Abstraction has 2035 states and 7845 transitions. [2020-10-05 23:00:56,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:00:56,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 7845 transitions. [2020-10-05 23:00:56,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:00:56,807 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:56,807 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:00:56,807 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-05 23:00:56,808 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:00:56,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:56,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1278978660, now seen corresponding path program 1 times [2020-10-05 23:00:56,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:56,809 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447920121] [2020-10-05 23:00:56,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:00:56,845 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447920121] [2020-10-05 23:00:56,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:00:56,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:00:56,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603446475] [2020-10-05 23:00:56,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:00:56,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:00:56,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:00:56,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:00:56,846 INFO L87 Difference]: Start difference. First operand 2035 states and 7845 transitions. Second operand 5 states. [2020-10-05 23:00:56,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:00:56,944 INFO L93 Difference]: Finished difference Result 3265 states and 11681 transitions. [2020-10-05 23:00:56,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:00:56,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:00:56,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:00:56,958 INFO L225 Difference]: With dead ends: 3265 [2020-10-05 23:00:56,958 INFO L226 Difference]: Without dead ends: 3250 [2020-10-05 23:00:56,959 INFO L675 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 [2020-10-05 23:00:56,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2020-10-05 23:00:57,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 2281. [2020-10-05 23:00:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2020-10-05 23:00:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 8755 transitions. [2020-10-05 23:00:57,057 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 8755 transitions. Word has length 17 [2020-10-05 23:00:57,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:00:57,057 INFO L479 AbstractCegarLoop]: Abstraction has 2281 states and 8755 transitions. [2020-10-05 23:00:57,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:00:57,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 8755 transitions. [2020-10-05 23:00:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:00:57,059 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:57,059 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:00:57,059 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-05 23:00:57,059 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:00:57,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:57,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1455436228, now seen corresponding path program 1 times [2020-10-05 23:00:57,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:57,060 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992054159] [2020-10-05 23:00:57,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:00:57,141 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992054159] [2020-10-05 23:00:57,141 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855501335] [2020-10-05 23:00:57,142 INFO L95 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 [2020-10-05 23:00:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:57,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:00:57,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:00:57,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:00:57,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:00:57,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:00:57,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457605442] [2020-10-05 23:00:57,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:00:57,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:00:57,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:00:57,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:00:57,300 INFO L87 Difference]: Start difference. First operand 2281 states and 8755 transitions. Second operand 12 states. [2020-10-05 23:00:57,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:00:57,691 INFO L93 Difference]: Finished difference Result 4825 states and 15986 transitions. [2020-10-05 23:00:57,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:00:57,692 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:00:57,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:00:57,711 INFO L225 Difference]: With dead ends: 4825 [2020-10-05 23:00:57,712 INFO L226 Difference]: Without dead ends: 4813 [2020-10-05 23:00:57,713 INFO L675 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 [2020-10-05 23:00:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2020-10-05 23:00:57,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 2305. [2020-10-05 23:00:57,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2020-10-05 23:00:57,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 8815 transitions. [2020-10-05 23:00:57,835 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 8815 transitions. Word has length 19 [2020-10-05 23:00:57,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:00:57,835 INFO L479 AbstractCegarLoop]: Abstraction has 2305 states and 8815 transitions. [2020-10-05 23:00:57,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:00:57,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 8815 transitions. [2020-10-05 23:00:57,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:00:57,839 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:57,839 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:00:58,054 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:00:58,055 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:00:58,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:58,055 INFO L82 PathProgramCache]: Analyzing trace with hash -979473248, now seen corresponding path program 1 times [2020-10-05 23:00:58,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:58,056 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101658756] [2020-10-05 23:00:58,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:58,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:00:58,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101658756] [2020-10-05 23:00:58,144 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320833228] [2020-10-05 23:00:58,144 INFO L95 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 [2020-10-05 23:00:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:58,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:00:58,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:00:58,387 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:00:58,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:00:58,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:00:58,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867618963] [2020-10-05 23:00:58,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:00:58,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:00:58,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:00:58,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:00:58,389 INFO L87 Difference]: Start difference. First operand 2305 states and 8815 transitions. Second operand 12 states. [2020-10-05 23:00:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:00:58,776 INFO L93 Difference]: Finished difference Result 4942 states and 16410 transitions. [2020-10-05 23:00:58,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:00:58,777 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:00:58,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:00:58,794 INFO L225 Difference]: With dead ends: 4942 [2020-10-05 23:00:58,794 INFO L226 Difference]: Without dead ends: 4925 [2020-10-05 23:00:58,795 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:00:58,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4925 states. [2020-10-05 23:00:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4925 to 2299. [2020-10-05 23:00:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2299 states. [2020-10-05 23:00:58,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 8782 transitions. [2020-10-05 23:00:58,909 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 8782 transitions. Word has length 19 [2020-10-05 23:00:58,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:00:58,909 INFO L479 AbstractCegarLoop]: Abstraction has 2299 states and 8782 transitions. [2020-10-05 23:00:58,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:00:58,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 8782 transitions. [2020-10-05 23:00:58,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:00:58,911 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:58,911 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:00:59,124 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:00:59,124 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:00:59,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:59,125 INFO L82 PathProgramCache]: Analyzing trace with hash -737855584, now seen corresponding path program 2 times [2020-10-05 23:00:59,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:59,126 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239477605] [2020-10-05 23:00:59,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:00:59,178 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239477605] [2020-10-05 23:00:59,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:00:59,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:00:59,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923598627] [2020-10-05 23:00:59,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:00:59,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:00:59,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:00:59,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:00:59,180 INFO L87 Difference]: Start difference. First operand 2299 states and 8782 transitions. Second operand 7 states. [2020-10-05 23:00:59,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:00:59,439 INFO L93 Difference]: Finished difference Result 4934 states and 16393 transitions. [2020-10-05 23:00:59,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:00:59,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:00:59,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:00:59,454 INFO L225 Difference]: With dead ends: 4934 [2020-10-05 23:00:59,454 INFO L226 Difference]: Without dead ends: 4917 [2020-10-05 23:00:59,455 INFO L675 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 [2020-10-05 23:00:59,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4917 states. [2020-10-05 23:00:59,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4917 to 2216. [2020-10-05 23:00:59,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2020-10-05 23:00:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 8477 transitions. [2020-10-05 23:00:59,554 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 8477 transitions. Word has length 19 [2020-10-05 23:00:59,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:00:59,554 INFO L479 AbstractCegarLoop]: Abstraction has 2216 states and 8477 transitions. [2020-10-05 23:00:59,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:00:59,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 8477 transitions. [2020-10-05 23:00:59,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:00:59,556 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:00:59,556 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:00:59,556 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-05 23:00:59,556 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:00:59,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:00:59,557 INFO L82 PathProgramCache]: Analyzing trace with hash -737840828, now seen corresponding path program 2 times [2020-10-05 23:00:59,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:00:59,557 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168513278] [2020-10-05 23:00:59,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:00:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:00:59,618 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:00:59,618 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168513278] [2020-10-05 23:00:59,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:00:59,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:00:59,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181728148] [2020-10-05 23:00:59,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:00:59,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:00:59,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:00:59,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:00:59,620 INFO L87 Difference]: Start difference. First operand 2216 states and 8477 transitions. Second operand 7 states. [2020-10-05 23:00:59,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:00:59,974 INFO L93 Difference]: Finished difference Result 4774 states and 15828 transitions. [2020-10-05 23:00:59,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:00:59,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:00:59,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:00:59,984 INFO L225 Difference]: With dead ends: 4774 [2020-10-05 23:00:59,984 INFO L226 Difference]: Without dead ends: 4757 [2020-10-05 23:00:59,984 INFO L675 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 [2020-10-05 23:01:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2020-10-05 23:01:00,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 2150. [2020-10-05 23:01:00,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2150 states. [2020-10-05 23:01:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 8243 transitions. [2020-10-05 23:01:00,066 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 8243 transitions. Word has length 19 [2020-10-05 23:01:00,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:00,066 INFO L479 AbstractCegarLoop]: Abstraction has 2150 states and 8243 transitions. [2020-10-05 23:01:00,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:01:00,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 8243 transitions. [2020-10-05 23:01:00,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:01:00,068 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:00,068 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:00,069 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-05 23:01:00,069 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:00,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:00,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1726751032, now seen corresponding path program 1 times [2020-10-05 23:01:00,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:00,070 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020667908] [2020-10-05 23:01:00,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:01:00,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020667908] [2020-10-05 23:01:00,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916173864] [2020-10-05 23:01:00,148 INFO L95 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 [2020-10-05 23:01:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:00,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:01:00,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:01:00,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:00,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:01:00,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619739549] [2020-10-05 23:01:00,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:01:00,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:00,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:01:00,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:01:00,394 INFO L87 Difference]: Start difference. First operand 2150 states and 8243 transitions. Second operand 16 states. [2020-10-05 23:01:01,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:01,301 INFO L93 Difference]: Finished difference Result 6025 states and 18746 transitions. [2020-10-05 23:01:01,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:01,302 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:01:01,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:01,316 INFO L225 Difference]: With dead ends: 6025 [2020-10-05 23:01:01,316 INFO L226 Difference]: Without dead ends: 6017 [2020-10-05 23:01:01,318 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:01:01,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-10-05 23:01:01,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 2117. [2020-10-05 23:01:01,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2020-10-05 23:01:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 8106 transitions. [2020-10-05 23:01:01,393 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 8106 transitions. Word has length 21 [2020-10-05 23:01:01,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:01,394 INFO L479 AbstractCegarLoop]: Abstraction has 2117 states and 8106 transitions. [2020-10-05 23:01:01,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:01:01,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 8106 transitions. [2020-10-05 23:01:01,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:01:01,396 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:01,396 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:01,608 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-10-05 23:01:01,609 INFO L427 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:01,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:01,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1485133368, now seen corresponding path program 2 times [2020-10-05 23:01:01,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:01,610 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005852164] [2020-10-05 23:01:01,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:01,702 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:01:01,703 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005852164] [2020-10-05 23:01:01,703 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978944883] [2020-10-05 23:01:01,704 INFO L93 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 [2020-10-05 23:01:01,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:01:01,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:01:01,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:01:01,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:02,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:01:02,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:02,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:01:02,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19530101] [2020-10-05 23:01:02,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:01:02,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:02,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:01:02,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:01:02,019 INFO L87 Difference]: Start difference. First operand 2117 states and 8106 transitions. Second operand 16 states. [2020-10-05 23:01:02,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:02,865 INFO L93 Difference]: Finished difference Result 5914 states and 18384 transitions. [2020-10-05 23:01:02,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:02,866 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:01:02,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:02,877 INFO L225 Difference]: With dead ends: 5914 [2020-10-05 23:01:02,877 INFO L226 Difference]: Without dead ends: 5903 [2020-10-05 23:01:02,878 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:01:02,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5903 states. [2020-10-05 23:01:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5903 to 2085. [2020-10-05 23:01:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2085 states. [2020-10-05 23:01:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 7975 transitions. [2020-10-05 23:01:02,975 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 7975 transitions. Word has length 21 [2020-10-05 23:01:02,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:02,975 INFO L479 AbstractCegarLoop]: Abstraction has 2085 states and 7975 transitions. [2020-10-05 23:01:02,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:01:02,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 7975 transitions. [2020-10-05 23:01:02,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:01:02,977 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:02,977 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:03,192 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:01:03,193 INFO L427 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:03,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:03,193 INFO L82 PathProgramCache]: Analyzing trace with hash -268549816, now seen corresponding path program 3 times [2020-10-05 23:01:03,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:03,194 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969882077] [2020-10-05 23:01:03,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:03,321 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:01:03,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969882077] [2020-10-05 23:01:03,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760501106] [2020-10-05 23:01:03,322 INFO L93 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 [2020-10-05 23:01:03,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:01:03,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:01:03,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:01:03,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:01:03,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:03,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:01:03,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337819677] [2020-10-05 23:01:03,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:01:03,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:03,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:01:03,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:01:03,491 INFO L87 Difference]: Start difference. First operand 2085 states and 7975 transitions. Second operand 16 states. [2020-10-05 23:01:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:04,376 INFO L93 Difference]: Finished difference Result 5907 states and 18375 transitions. [2020-10-05 23:01:04,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:04,377 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:01:04,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:04,387 INFO L225 Difference]: With dead ends: 5907 [2020-10-05 23:01:04,387 INFO L226 Difference]: Without dead ends: 5899 [2020-10-05 23:01:04,388 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:01:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5899 states. [2020-10-05 23:01:04,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5899 to 2008. [2020-10-05 23:01:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2008 states. [2020-10-05 23:01:04,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 7698 transitions. [2020-10-05 23:01:04,474 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 7698 transitions. Word has length 21 [2020-10-05 23:01:04,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:04,474 INFO L479 AbstractCegarLoop]: Abstraction has 2008 states and 7698 transitions. [2020-10-05 23:01:04,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:01:04,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 7698 transitions. [2020-10-05 23:01:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:01:04,476 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:04,476 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:04,691 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-10-05 23:01:04,692 INFO L427 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:04,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:04,693 INFO L82 PathProgramCache]: Analyzing trace with hash -675948728, now seen corresponding path program 4 times [2020-10-05 23:01:04,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:04,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876870215] [2020-10-05 23:01:04,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:04,779 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:01:04,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876870215] [2020-10-05 23:01:04,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603281869] [2020-10-05 23:01:04,780 INFO L93 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 [2020-10-05 23:01:04,841 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:01:04,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:01:04,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:01:04,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:04,948 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:01:04,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:04,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:01:04,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59468104] [2020-10-05 23:01:04,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:01:04,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:04,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:01:04,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:01:04,950 INFO L87 Difference]: Start difference. First operand 2008 states and 7698 transitions. Second operand 16 states. [2020-10-05 23:01:05,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:05,768 INFO L93 Difference]: Finished difference Result 5835 states and 18155 transitions. [2020-10-05 23:01:05,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:05,768 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:01:05,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:05,779 INFO L225 Difference]: With dead ends: 5835 [2020-10-05 23:01:05,779 INFO L226 Difference]: Without dead ends: 5824 [2020-10-05 23:01:05,780 INFO L675 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 [2020-10-05 23:01:05,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5824 states. [2020-10-05 23:01:05,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5824 to 1976. [2020-10-05 23:01:05,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2020-10-05 23:01:05,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 7567 transitions. [2020-10-05 23:01:05,847 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 7567 transitions. Word has length 21 [2020-10-05 23:01:05,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:05,847 INFO L479 AbstractCegarLoop]: Abstraction has 1976 states and 7567 transitions. [2020-10-05 23:01:05,847 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:01:05,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 7567 transitions. [2020-10-05 23:01:05,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:01:05,849 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:05,849 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:06,062 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-10-05 23:01:06,063 INFO L427 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:06,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:06,063 INFO L82 PathProgramCache]: Analyzing trace with hash -409607608, now seen corresponding path program 5 times [2020-10-05 23:01:06,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:06,063 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499315809] [2020-10-05 23:01:06,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:06,143 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:01:06,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499315809] [2020-10-05 23:01:06,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:06,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:01:06,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928215677] [2020-10-05 23:01:06,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:01:06,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:06,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:01:06,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:01:06,146 INFO L87 Difference]: Start difference. First operand 1976 states and 7567 transitions. Second operand 9 states. [2020-10-05 23:01:06,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:06,884 INFO L93 Difference]: Finished difference Result 5820 states and 18126 transitions. [2020-10-05 23:01:06,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:06,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:01:06,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:06,899 INFO L225 Difference]: With dead ends: 5820 [2020-10-05 23:01:06,899 INFO L226 Difference]: Without dead ends: 5812 [2020-10-05 23:01:06,900 INFO L675 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 [2020-10-05 23:01:06,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5812 states. [2020-10-05 23:01:06,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5812 to 1907. [2020-10-05 23:01:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2020-10-05 23:01:06,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 7310 transitions. [2020-10-05 23:01:06,976 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 7310 transitions. Word has length 21 [2020-10-05 23:01:06,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:06,976 INFO L479 AbstractCegarLoop]: Abstraction has 1907 states and 7310 transitions. [2020-10-05 23:01:06,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:01:06,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 7310 transitions. [2020-10-05 23:01:06,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:01:06,978 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:06,978 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:06,978 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-05 23:01:06,978 INFO L427 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:06,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:06,979 INFO L82 PathProgramCache]: Analyzing trace with hash -395441848, now seen corresponding path program 6 times [2020-10-05 23:01:06,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:06,979 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356992892] [2020-10-05 23:01:06,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:07,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:01:07,056 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356992892] [2020-10-05 23:01:07,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:07,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:01:07,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695832188] [2020-10-05 23:01:07,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:01:07,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:07,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:01:07,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:01:07,057 INFO L87 Difference]: Start difference. First operand 1907 states and 7310 transitions. Second operand 9 states. [2020-10-05 23:01:07,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:07,782 INFO L93 Difference]: Finished difference Result 5717 states and 17784 transitions. [2020-10-05 23:01:07,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:07,783 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:01:07,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:07,794 INFO L225 Difference]: With dead ends: 5717 [2020-10-05 23:01:07,794 INFO L226 Difference]: Without dead ends: 5705 [2020-10-05 23:01:07,795 INFO L675 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 [2020-10-05 23:01:07,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5705 states. [2020-10-05 23:01:07,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5705 to 1800. [2020-10-05 23:01:07,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2020-10-05 23:01:07,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 6961 transitions. [2020-10-05 23:01:07,869 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 6961 transitions. Word has length 21 [2020-10-05 23:01:07,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:07,869 INFO L479 AbstractCegarLoop]: Abstraction has 1800 states and 6961 transitions. [2020-10-05 23:01:07,869 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:01:07,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 6961 transitions. [2020-10-05 23:01:07,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:01:07,870 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:07,870 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:07,870 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-05 23:01:07,871 INFO L427 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:07,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:07,871 INFO L82 PathProgramCache]: Analyzing trace with hash -334654421, now seen corresponding path program 1 times [2020-10-05 23:01:07,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:07,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53819484] [2020-10-05 23:01:07,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:07,922 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:01:07,922 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53819484] [2020-10-05 23:01:07,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:07,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:01:07,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712828795] [2020-10-05 23:01:07,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:01:07,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:07,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:01:07,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:01:07,924 INFO L87 Difference]: Start difference. First operand 1800 states and 6961 transitions. Second operand 5 states. [2020-10-05 23:01:08,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:08,021 INFO L93 Difference]: Finished difference Result 2762 states and 9976 transitions. [2020-10-05 23:01:08,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:01:08,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-05 23:01:08,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:08,027 INFO L225 Difference]: With dead ends: 2762 [2020-10-05 23:01:08,027 INFO L226 Difference]: Without dead ends: 2746 [2020-10-05 23:01:08,028 INFO L675 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 [2020-10-05 23:01:08,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2020-10-05 23:01:08,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 1965. [2020-10-05 23:01:08,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2020-10-05 23:01:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2020-10-05 23:01:08,084 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2020-10-05 23:01:08,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:08,084 INFO L479 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2020-10-05 23:01:08,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:01:08,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2020-10-05 23:01:08,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:01:08,086 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:08,086 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:08,086 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-05 23:01:08,086 INFO L427 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:08,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:08,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1788555247, now seen corresponding path program 1 times [2020-10-05 23:01:08,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:08,094 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021188542] [2020-10-05 23:01:08,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:01:08,107 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:01:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:01:08,118 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:01:08,137 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:01:08,137 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:01:08,137 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-05 23:01:08,137 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:01:08,138 WARN L363 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:01:08,138 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2020-10-05 23:01:08,151 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,151 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,151 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,151 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,151 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,152 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,152 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,152 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,152 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,152 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,152 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,152 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,152 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,152 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,152 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,193 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,193 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,193 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,193 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,193 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,194 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,194 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,194 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,194 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,195 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,195 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,196 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,196 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,196 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,196 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,196 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,196 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,196 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,196 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,196 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,196 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,199 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,199 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,200 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,201 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,202 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,202 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,203 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,203 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,204 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,204 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,204 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,205 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,205 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,206 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,206 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,206 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,207 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,207 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,207 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,207 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,207 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,208 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,209 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,209 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,209 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,209 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,210 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,210 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,210 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,211 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,211 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,215 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,215 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,217 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,217 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,217 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,220 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:08,222 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-05 23:01:08,222 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:01:08,222 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:01:08,222 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 23:01:08,222 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:01:08,223 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:01:08,223 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:01:08,223 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:01:08,223 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:01:08,225 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 122 transitions, 334 flow [2020-10-05 23:01:08,225 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 122 transitions, 334 flow [2020-10-05 23:01:08,241 INFO L129 PetriNetUnfolder]: 8/152 cut-off events. [2020-10-05 23:01:08,241 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-05 23:01:08,243 INFO L80 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 152 events. 8/152 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 251 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 179. Up to 12 conditions per place. [2020-10-05 23:01:08,247 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 122 transitions, 334 flow [2020-10-05 23:01:08,261 INFO L129 PetriNetUnfolder]: 8/152 cut-off events. [2020-10-05 23:01:08,262 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-05 23:01:08,263 INFO L80 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 152 events. 8/152 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 251 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 179. Up to 12 conditions per place. [2020-10-05 23:01:08,267 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2264 [2020-10-05 23:01:08,267 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 23:01:09,955 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2020-10-05 23:01:10,199 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2020-10-05 23:01:10,407 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2020-10-05 23:01:10,489 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2999 [2020-10-05 23:01:10,489 INFO L214 etLargeBlockEncoding]: Total number of compositions: 104 [2020-10-05 23:01:10,489 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 39 transitions, 168 flow [2020-10-05 23:01:11,040 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2020-10-05 23:01:11,041 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2020-10-05 23:01:11,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:01:11,041 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:11,041 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:01:11,041 INFO L427 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]=== [2020-10-05 23:01:11,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:11,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1026170, now seen corresponding path program 1 times [2020-10-05 23:01:11,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:11,042 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157346463] [2020-10-05 23:01:11,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:01:11,056 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157346463] [2020-10-05 23:01:11,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:11,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:01:11,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918017321] [2020-10-05 23:01:11,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:01:11,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:11,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:01:11,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:01:11,057 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2020-10-05 23:01:11,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:11,138 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2020-10-05 23:01:11,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:01:11,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:01:11,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:11,157 INFO L225 Difference]: With dead ends: 5844 [2020-10-05 23:01:11,157 INFO L226 Difference]: Without dead ends: 5479 [2020-10-05 23:01:11,157 INFO L675 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 [2020-10-05 23:01:11,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2020-10-05 23:01:11,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5479. [2020-10-05 23:01:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-10-05 23:01:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 24493 transitions. [2020-10-05 23:01:11,308 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 24493 transitions. Word has length 3 [2020-10-05 23:01:11,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:11,308 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 24493 transitions. [2020-10-05 23:01:11,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:01:11,308 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 24493 transitions. [2020-10-05 23:01:11,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:01:11,308 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:11,308 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:11,308 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-05 23:01:11,309 INFO L427 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]=== [2020-10-05 23:01:11,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:11,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1344335463, now seen corresponding path program 1 times [2020-10-05 23:01:11,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:11,309 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501688392] [2020-10-05 23:01:11,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:11,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:01:11,348 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501688392] [2020-10-05 23:01:11,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:11,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:01:11,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109922294] [2020-10-05 23:01:11,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:01:11,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:11,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:01:11,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:01:11,350 INFO L87 Difference]: Start difference. First operand 5479 states and 24493 transitions. Second operand 5 states. [2020-10-05 23:01:11,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:11,515 INFO L93 Difference]: Finished difference Result 9673 states and 40333 transitions. [2020-10-05 23:01:11,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:01:11,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:01:11,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:11,541 INFO L225 Difference]: With dead ends: 9673 [2020-10-05 23:01:11,541 INFO L226 Difference]: Without dead ends: 9666 [2020-10-05 23:01:11,542 INFO L675 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 [2020-10-05 23:01:11,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9666 states. [2020-10-05 23:01:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9666 to 6331. [2020-10-05 23:01:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6331 states. [2020-10-05 23:01:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6331 states to 6331 states and 28544 transitions. [2020-10-05 23:01:11,747 INFO L78 Accepts]: Start accepts. Automaton has 6331 states and 28544 transitions. Word has length 9 [2020-10-05 23:01:11,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:11,747 INFO L479 AbstractCegarLoop]: Abstraction has 6331 states and 28544 transitions. [2020-10-05 23:01:11,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:01:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 6331 states and 28544 transitions. [2020-10-05 23:01:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:01:11,748 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:11,748 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:11,748 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-05 23:01:11,748 INFO L427 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]=== [2020-10-05 23:01:11,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:11,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1513378118, now seen corresponding path program 1 times [2020-10-05 23:01:11,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:11,748 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298881073] [2020-10-05 23:01:11,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:01:11,795 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298881073] [2020-10-05 23:01:11,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:11,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:01:11,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108016147] [2020-10-05 23:01:11,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:01:11,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:11,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:01:11,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:01:11,797 INFO L87 Difference]: Start difference. First operand 6331 states and 28544 transitions. Second operand 5 states. [2020-10-05 23:01:12,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:12,564 INFO L93 Difference]: Finished difference Result 11081 states and 46826 transitions. [2020-10-05 23:01:12,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:01:12,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:01:12,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:12,593 INFO L225 Difference]: With dead ends: 11081 [2020-10-05 23:01:12,593 INFO L226 Difference]: Without dead ends: 11068 [2020-10-05 23:01:12,594 INFO L675 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 [2020-10-05 23:01:12,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11068 states. [2020-10-05 23:01:12,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11068 to 7391. [2020-10-05 23:01:12,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7391 states. [2020-10-05 23:01:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7391 states to 7391 states and 33694 transitions. [2020-10-05 23:01:12,824 INFO L78 Accepts]: Start accepts. Automaton has 7391 states and 33694 transitions. Word has length 13 [2020-10-05 23:01:12,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:12,824 INFO L479 AbstractCegarLoop]: Abstraction has 7391 states and 33694 transitions. [2020-10-05 23:01:12,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:01:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 7391 states and 33694 transitions. [2020-10-05 23:01:12,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:01:12,825 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:12,825 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:12,825 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-05 23:01:12,825 INFO L427 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]=== [2020-10-05 23:01:12,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:12,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1678648171, now seen corresponding path program 1 times [2020-10-05 23:01:12,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:12,826 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180138293] [2020-10-05 23:01:12,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:01:12,889 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180138293] [2020-10-05 23:01:12,889 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541988332] [2020-10-05 23:01:12,889 INFO L95 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 [2020-10-05 23:01:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:12,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:01:12,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:01:13,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:13,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:01:13,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422686357] [2020-10-05 23:01:13,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:01:13,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:13,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:01:13,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:01:13,051 INFO L87 Difference]: Start difference. First operand 7391 states and 33694 transitions. Second operand 12 states. [2020-10-05 23:01:13,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:13,498 INFO L93 Difference]: Finished difference Result 16749 states and 66010 transitions. [2020-10-05 23:01:13,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:01:13,499 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-05 23:01:13,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:13,566 INFO L225 Difference]: With dead ends: 16749 [2020-10-05 23:01:13,566 INFO L226 Difference]: Without dead ends: 16736 [2020-10-05 23:01:13,567 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:01:13,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16736 states. [2020-10-05 23:01:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16736 to 7303. [2020-10-05 23:01:13,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7303 states. [2020-10-05 23:01:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 33260 transitions. [2020-10-05 23:01:13,900 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 33260 transitions. Word has length 15 [2020-10-05 23:01:13,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:13,900 INFO L479 AbstractCegarLoop]: Abstraction has 7303 states and 33260 transitions. [2020-10-05 23:01:13,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:01:13,900 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 33260 transitions. [2020-10-05 23:01:13,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:01:13,901 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:13,901 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:14,101 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:01:14,102 INFO L427 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]=== [2020-10-05 23:01:14,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:14,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1637555113, now seen corresponding path program 2 times [2020-10-05 23:01:14,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:14,103 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772808791] [2020-10-05 23:01:14,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:01:14,169 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772808791] [2020-10-05 23:01:14,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:14,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:01:14,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70681357] [2020-10-05 23:01:14,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:01:14,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:14,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:01:14,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:01:14,171 INFO L87 Difference]: Start difference. First operand 7303 states and 33260 transitions. Second operand 7 states. [2020-10-05 23:01:14,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:14,544 INFO L93 Difference]: Finished difference Result 17085 states and 67393 transitions. [2020-10-05 23:01:14,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:01:14,545 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 23:01:14,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:14,588 INFO L225 Difference]: With dead ends: 17085 [2020-10-05 23:01:14,588 INFO L226 Difference]: Without dead ends: 17071 [2020-10-05 23:01:14,589 INFO L675 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 [2020-10-05 23:01:14,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17071 states. [2020-10-05 23:01:14,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17071 to 7048. [2020-10-05 23:01:14,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7048 states. [2020-10-05 23:01:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7048 states to 7048 states and 32136 transitions. [2020-10-05 23:01:14,883 INFO L78 Accepts]: Start accepts. Automaton has 7048 states and 32136 transitions. Word has length 15 [2020-10-05 23:01:14,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:14,883 INFO L479 AbstractCegarLoop]: Abstraction has 7048 states and 32136 transitions. [2020-10-05 23:01:14,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:01:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 7048 states and 32136 transitions. [2020-10-05 23:01:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:01:14,883 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:14,883 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:14,884 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-05 23:01:14,884 INFO L427 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]=== [2020-10-05 23:01:14,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:14,884 INFO L82 PathProgramCache]: Analyzing trace with hash -288445665, now seen corresponding path program 1 times [2020-10-05 23:01:14,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:14,884 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348591286] [2020-10-05 23:01:14,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:01:14,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348591286] [2020-10-05 23:01:14,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:14,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:01:14,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792279208] [2020-10-05 23:01:14,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:01:14,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:14,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:01:14,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:01:14,931 INFO L87 Difference]: Start difference. First operand 7048 states and 32136 transitions. Second operand 5 states. [2020-10-05 23:01:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:15,079 INFO L93 Difference]: Finished difference Result 12234 states and 52488 transitions. [2020-10-05 23:01:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:01:15,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:01:15,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:15,111 INFO L225 Difference]: With dead ends: 12234 [2020-10-05 23:01:15,111 INFO L226 Difference]: Without dead ends: 12212 [2020-10-05 23:01:15,111 INFO L675 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 [2020-10-05 23:01:15,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12212 states. [2020-10-05 23:01:15,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12212 to 8342. [2020-10-05 23:01:15,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8342 states. [2020-10-05 23:01:15,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8342 states to 8342 states and 38278 transitions. [2020-10-05 23:01:15,521 INFO L78 Accepts]: Start accepts. Automaton has 8342 states and 38278 transitions. Word has length 17 [2020-10-05 23:01:15,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:15,521 INFO L479 AbstractCegarLoop]: Abstraction has 8342 states and 38278 transitions. [2020-10-05 23:01:15,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:01:15,521 INFO L276 IsEmpty]: Start isEmpty. Operand 8342 states and 38278 transitions. [2020-10-05 23:01:15,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:01:15,522 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:15,522 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:15,522 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-05 23:01:15,522 INFO L427 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]=== [2020-10-05 23:01:15,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:15,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1255672082, now seen corresponding path program 1 times [2020-10-05 23:01:15,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:15,523 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921176639] [2020-10-05 23:01:15,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:01:15,577 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921176639] [2020-10-05 23:01:15,578 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383242154] [2020-10-05 23:01:15,578 INFO L95 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 [2020-10-05 23:01:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:15,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:01:15,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:15,714 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:01:15,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:15,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:01:15,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807836624] [2020-10-05 23:01:15,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:01:15,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:15,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:01:15,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:01:15,716 INFO L87 Difference]: Start difference. First operand 8342 states and 38278 transitions. Second operand 12 states. [2020-10-05 23:01:16,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:16,082 INFO L93 Difference]: Finished difference Result 19016 states and 76191 transitions. [2020-10-05 23:01:16,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:01:16,083 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:01:16,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:16,132 INFO L225 Difference]: With dead ends: 19016 [2020-10-05 23:01:16,132 INFO L226 Difference]: Without dead ends: 18998 [2020-10-05 23:01:16,132 INFO L675 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 [2020-10-05 23:01:16,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18998 states. [2020-10-05 23:01:16,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18998 to 8452. [2020-10-05 23:01:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8452 states. [2020-10-05 23:01:16,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8452 states to 8452 states and 38704 transitions. [2020-10-05 23:01:16,462 INFO L78 Accepts]: Start accepts. Automaton has 8452 states and 38704 transitions. Word has length 19 [2020-10-05 23:01:16,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:16,462 INFO L479 AbstractCegarLoop]: Abstraction has 8452 states and 38704 transitions. [2020-10-05 23:01:16,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:01:16,462 INFO L276 IsEmpty]: Start isEmpty. Operand 8452 states and 38704 transitions. [2020-10-05 23:01:16,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:01:16,463 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:16,463 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:16,673 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-10-05 23:01:16,674 INFO L427 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]=== [2020-10-05 23:01:16,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:16,674 INFO L82 PathProgramCache]: Analyzing trace with hash 402059005, now seen corresponding path program 1 times [2020-10-05 23:01:16,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:16,675 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874087941] [2020-10-05 23:01:16,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:16,721 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:01:16,721 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874087941] [2020-10-05 23:01:16,721 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915836906] [2020-10-05 23:01:16,722 INFO L95 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 [2020-10-05 23:01:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:16,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:01:16,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:01:16,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:16,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:01:16,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556516685] [2020-10-05 23:01:16,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:01:16,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:16,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:01:16,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:01:16,895 INFO L87 Difference]: Start difference. First operand 8452 states and 38704 transitions. Second operand 12 states. [2020-10-05 23:01:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:17,336 INFO L93 Difference]: Finished difference Result 19670 states and 79028 transitions. [2020-10-05 23:01:17,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:01:17,336 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:01:17,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:17,540 INFO L225 Difference]: With dead ends: 19670 [2020-10-05 23:01:17,540 INFO L226 Difference]: Without dead ends: 19645 [2020-10-05 23:01:17,541 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:01:17,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19645 states. [2020-10-05 23:01:17,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19645 to 8480. [2020-10-05 23:01:17,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8480 states. [2020-10-05 23:01:17,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8480 states to 8480 states and 38825 transitions. [2020-10-05 23:01:17,856 INFO L78 Accepts]: Start accepts. Automaton has 8480 states and 38825 transitions. Word has length 19 [2020-10-05 23:01:17,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:17,856 INFO L479 AbstractCegarLoop]: Abstraction has 8480 states and 38825 transitions. [2020-10-05 23:01:17,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:01:17,856 INFO L276 IsEmpty]: Start isEmpty. Operand 8480 states and 38825 transitions. [2020-10-05 23:01:17,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:01:17,857 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:17,857 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:18,057 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-10-05 23:01:18,058 INFO L427 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]=== [2020-10-05 23:01:18,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:18,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1976597437, now seen corresponding path program 2 times [2020-10-05 23:01:18,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:18,059 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395698302] [2020-10-05 23:01:18,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:18,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:01:18,135 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395698302] [2020-10-05 23:01:18,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:18,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:01:18,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265189305] [2020-10-05 23:01:18,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:01:18,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:18,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:01:18,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:01:18,136 INFO L87 Difference]: Start difference. First operand 8480 states and 38825 transitions. Second operand 7 states. [2020-10-05 23:01:18,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:18,519 INFO L93 Difference]: Finished difference Result 19852 states and 79846 transitions. [2020-10-05 23:01:18,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:01:18,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:01:18,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:18,569 INFO L225 Difference]: With dead ends: 19852 [2020-10-05 23:01:18,570 INFO L226 Difference]: Without dead ends: 19827 [2020-10-05 23:01:18,570 INFO L675 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 [2020-10-05 23:01:18,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19827 states. [2020-10-05 23:01:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19827 to 8379. [2020-10-05 23:01:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8379 states. [2020-10-05 23:01:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8379 states to 8379 states and 38406 transitions. [2020-10-05 23:01:18,915 INFO L78 Accepts]: Start accepts. Automaton has 8379 states and 38406 transitions. Word has length 19 [2020-10-05 23:01:18,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:18,915 INFO L479 AbstractCegarLoop]: Abstraction has 8379 states and 38406 transitions. [2020-10-05 23:01:18,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:01:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand 8379 states and 38406 transitions. [2020-10-05 23:01:18,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:01:18,916 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:18,916 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:18,916 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-05 23:01:18,917 INFO L427 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]=== [2020-10-05 23:01:18,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:18,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1976577008, now seen corresponding path program 2 times [2020-10-05 23:01:18,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:18,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209154436] [2020-10-05 23:01:18,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:01:18,968 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209154436] [2020-10-05 23:01:18,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:18,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:01:18,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682573487] [2020-10-05 23:01:18,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:01:18,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:18,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:01:18,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:01:18,971 INFO L87 Difference]: Start difference. First operand 8379 states and 38406 transitions. Second operand 7 states. [2020-10-05 23:01:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:19,416 INFO L93 Difference]: Finished difference Result 19555 states and 78564 transitions. [2020-10-05 23:01:19,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:01:19,417 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:01:19,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:19,465 INFO L225 Difference]: With dead ends: 19555 [2020-10-05 23:01:19,466 INFO L226 Difference]: Without dead ends: 19530 [2020-10-05 23:01:19,466 INFO L675 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 [2020-10-05 23:01:19,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19530 states. [2020-10-05 23:01:19,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19530 to 8317. [2020-10-05 23:01:19,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8317 states. [2020-10-05 23:01:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8317 states to 8317 states and 38184 transitions. [2020-10-05 23:01:19,811 INFO L78 Accepts]: Start accepts. Automaton has 8317 states and 38184 transitions. Word has length 19 [2020-10-05 23:01:19,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:19,811 INFO L479 AbstractCegarLoop]: Abstraction has 8317 states and 38184 transitions. [2020-10-05 23:01:19,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:01:19,811 INFO L276 IsEmpty]: Start isEmpty. Operand 8317 states and 38184 transitions. [2020-10-05 23:01:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:01:19,812 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:19,812 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:19,812 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-10-05 23:01:19,813 INFO L427 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]=== [2020-10-05 23:01:19,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:19,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1389591796, now seen corresponding path program 1 times [2020-10-05 23:01:19,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:19,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804168653] [2020-10-05 23:01:19,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:01:19,887 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804168653] [2020-10-05 23:01:19,887 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062591999] [2020-10-05 23:01:19,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:01:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:19,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:01:19,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:01:20,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:20,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:01:20,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480179930] [2020-10-05 23:01:20,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:01:20,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:20,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:01:20,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:01:20,062 INFO L87 Difference]: Start difference. First operand 8317 states and 38184 transitions. Second operand 16 states. [2020-10-05 23:01:21,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:21,079 INFO L93 Difference]: Finished difference Result 26969 states and 101544 transitions. [2020-10-05 23:01:21,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:21,080 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:01:21,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:21,149 INFO L225 Difference]: With dead ends: 26969 [2020-10-05 23:01:21,150 INFO L226 Difference]: Without dead ends: 26957 [2020-10-05 23:01:21,150 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:01:21,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26957 states. [2020-10-05 23:01:21,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26957 to 8204. [2020-10-05 23:01:21,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2020-10-05 23:01:21,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 37628 transitions. [2020-10-05 23:01:21,713 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 37628 transitions. Word has length 21 [2020-10-05 23:01:21,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:21,713 INFO L479 AbstractCegarLoop]: Abstraction has 8204 states and 37628 transitions. [2020-10-05 23:01:21,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:01:21,714 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 37628 transitions. [2020-10-05 23:01:21,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:01:21,715 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:21,715 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:21,915 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:01:21,915 INFO L427 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]=== [2020-10-05 23:01:21,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:21,916 INFO L82 PathProgramCache]: Analyzing trace with hash 184946636, now seen corresponding path program 2 times [2020-10-05 23:01:21,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:21,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93332733] [2020-10-05 23:01:21,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:01:21,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93332733] [2020-10-05 23:01:21,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426665145] [2020-10-05 23:01:21,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:01:22,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:01:22,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:01:22,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:01:22,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:22,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:01:22,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:22,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:01:22,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386067323] [2020-10-05 23:01:22,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:01:22,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:22,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:01:22,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:01:22,175 INFO L87 Difference]: Start difference. First operand 8204 states and 37628 transitions. Second operand 16 states. [2020-10-05 23:01:23,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:23,061 INFO L93 Difference]: Finished difference Result 26661 states and 100277 transitions. [2020-10-05 23:01:23,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:23,061 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:01:23,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:23,122 INFO L225 Difference]: With dead ends: 26661 [2020-10-05 23:01:23,122 INFO L226 Difference]: Without dead ends: 26645 [2020-10-05 23:01:23,123 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:01:23,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26645 states. [2020-10-05 23:01:23,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26645 to 8091. [2020-10-05 23:01:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8091 states. [2020-10-05 23:01:23,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8091 states to 8091 states and 37076 transitions. [2020-10-05 23:01:23,529 INFO L78 Accepts]: Start accepts. Automaton has 8091 states and 37076 transitions. Word has length 21 [2020-10-05 23:01:23,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:23,529 INFO L479 AbstractCegarLoop]: Abstraction has 8091 states and 37076 transitions. [2020-10-05 23:01:23,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:01:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 8091 states and 37076 transitions. [2020-10-05 23:01:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:01:23,530 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:23,530 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:23,731 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2020-10-05 23:01:23,731 INFO L427 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]=== [2020-10-05 23:01:23,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:23,732 INFO L82 PathProgramCache]: Analyzing trace with hash -231570740, now seen corresponding path program 3 times [2020-10-05 23:01:23,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:23,732 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886381576] [2020-10-05 23:01:23,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:23,795 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:01:23,795 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886381576] [2020-10-05 23:01:23,796 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111144264] [2020-10-05 23:01:23,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:01:23,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:01:23,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:01:23,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:01:23,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:24,129 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:01:24,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:24,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:01:24,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98261560] [2020-10-05 23:01:24,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:01:24,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:24,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:01:24,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:01:24,131 INFO L87 Difference]: Start difference. First operand 8091 states and 37076 transitions. Second operand 16 states. [2020-10-05 23:01:25,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:25,114 INFO L93 Difference]: Finished difference Result 26686 states and 100402 transitions. [2020-10-05 23:01:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:25,115 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:01:25,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:25,185 INFO L225 Difference]: With dead ends: 26686 [2020-10-05 23:01:25,186 INFO L226 Difference]: Without dead ends: 26674 [2020-10-05 23:01:25,186 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:01:25,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26674 states. [2020-10-05 23:01:25,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26674 to 7861. [2020-10-05 23:01:25,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7861 states. [2020-10-05 23:01:25,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7861 states to 7861 states and 36066 transitions. [2020-10-05 23:01:25,591 INFO L78 Accepts]: Start accepts. Automaton has 7861 states and 36066 transitions. Word has length 21 [2020-10-05 23:01:25,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:25,591 INFO L479 AbstractCegarLoop]: Abstraction has 7861 states and 36066 transitions. [2020-10-05 23:01:25,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:01:25,591 INFO L276 IsEmpty]: Start isEmpty. Operand 7861 states and 36066 transitions. [2020-10-05 23:01:25,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:01:25,592 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:25,593 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:25,793 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:01:25,793 INFO L427 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]=== [2020-10-05 23:01:25,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:25,794 INFO L82 PathProgramCache]: Analyzing trace with hash -168366002, now seen corresponding path program 4 times [2020-10-05 23:01:25,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:25,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441198559] [2020-10-05 23:01:25,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:01:25,859 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441198559] [2020-10-05 23:01:25,859 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199375676] [2020-10-05 23:01:25,860 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:01:25,944 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:01:25,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:01:25,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:01:25,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:01:26,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:26,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:01:26,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700710815] [2020-10-05 23:01:26,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:01:26,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:26,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:01:26,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:01:26,044 INFO L87 Difference]: Start difference. First operand 7861 states and 36066 transitions. Second operand 16 states. [2020-10-05 23:01:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:27,058 INFO L93 Difference]: Finished difference Result 26489 states and 99650 transitions. [2020-10-05 23:01:27,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:27,059 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:01:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:27,129 INFO L225 Difference]: With dead ends: 26489 [2020-10-05 23:01:27,129 INFO L226 Difference]: Without dead ends: 26473 [2020-10-05 23:01:27,129 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:01:27,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26473 states. [2020-10-05 23:01:27,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26473 to 7748. [2020-10-05 23:01:27,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7748 states. [2020-10-05 23:01:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7748 states to 7748 states and 35514 transitions. [2020-10-05 23:01:27,679 INFO L78 Accepts]: Start accepts. Automaton has 7748 states and 35514 transitions. Word has length 21 [2020-10-05 23:01:27,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:27,679 INFO L479 AbstractCegarLoop]: Abstraction has 7748 states and 35514 transitions. [2020-10-05 23:01:27,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:01:27,679 INFO L276 IsEmpty]: Start isEmpty. Operand 7748 states and 35514 transitions. [2020-10-05 23:01:27,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:01:27,680 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:27,680 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:27,880 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2020-10-05 23:01:27,881 INFO L427 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]=== [2020-10-05 23:01:27,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:27,882 INFO L82 PathProgramCache]: Analyzing trace with hash 210203517, now seen corresponding path program 1 times [2020-10-05 23:01:27,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:27,883 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462982965] [2020-10-05 23:01:27,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:01:27,923 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462982965] [2020-10-05 23:01:27,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:27,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:01:27,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502902164] [2020-10-05 23:01:27,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:01:27,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:27,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:01:27,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:01:27,924 INFO L87 Difference]: Start difference. First operand 7748 states and 35514 transitions. Second operand 5 states. [2020-10-05 23:01:28,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:28,076 INFO L93 Difference]: Finished difference Result 13251 states and 57501 transitions. [2020-10-05 23:01:28,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:01:28,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-05 23:01:28,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:28,112 INFO L225 Difference]: With dead ends: 13251 [2020-10-05 23:01:28,112 INFO L226 Difference]: Without dead ends: 13220 [2020-10-05 23:01:28,112 INFO L675 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 [2020-10-05 23:01:28,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13220 states. [2020-10-05 23:01:28,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13220 to 9255. [2020-10-05 23:01:28,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9255 states. [2020-10-05 23:01:28,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9255 states to 9255 states and 42368 transitions. [2020-10-05 23:01:28,401 INFO L78 Accepts]: Start accepts. Automaton has 9255 states and 42368 transitions. Word has length 21 [2020-10-05 23:01:28,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:28,402 INFO L479 AbstractCegarLoop]: Abstraction has 9255 states and 42368 transitions. [2020-10-05 23:01:28,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:01:28,402 INFO L276 IsEmpty]: Start isEmpty. Operand 9255 states and 42368 transitions. [2020-10-05 23:01:28,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:01:28,403 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:28,403 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:28,403 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-10-05 23:01:28,404 INFO L427 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]=== [2020-10-05 23:01:28,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:28,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1134578958, now seen corresponding path program 5 times [2020-10-05 23:01:28,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:28,404 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877373736] [2020-10-05 23:01:28,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:28,483 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:01:28,483 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877373736] [2020-10-05 23:01:28,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:28,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:01:28,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689535759] [2020-10-05 23:01:28,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:01:28,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:28,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:01:28,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:01:28,484 INFO L87 Difference]: Start difference. First operand 9255 states and 42368 transitions. Second operand 9 states. [2020-10-05 23:01:29,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:29,332 INFO L93 Difference]: Finished difference Result 29788 states and 113841 transitions. [2020-10-05 23:01:29,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:29,333 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:01:29,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:29,405 INFO L225 Difference]: With dead ends: 29788 [2020-10-05 23:01:29,405 INFO L226 Difference]: Without dead ends: 29770 [2020-10-05 23:01:29,406 INFO L675 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 [2020-10-05 23:01:29,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29770 states. [2020-10-05 23:01:30,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29770 to 8964. [2020-10-05 23:01:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2020-10-05 23:01:30,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 41031 transitions. [2020-10-05 23:01:30,063 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 41031 transitions. Word has length 21 [2020-10-05 23:01:30,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:30,064 INFO L479 AbstractCegarLoop]: Abstraction has 8964 states and 41031 transitions. [2020-10-05 23:01:30,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:01:30,064 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 41031 transitions. [2020-10-05 23:01:30,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:01:30,065 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:30,065 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:30,066 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-10-05 23:01:30,066 INFO L427 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]=== [2020-10-05 23:01:30,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:30,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1114967118, now seen corresponding path program 6 times [2020-10-05 23:01:30,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:30,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268896339] [2020-10-05 23:01:30,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:30,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:01:30,142 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268896339] [2020-10-05 23:01:30,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:30,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:01:30,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155982277] [2020-10-05 23:01:30,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:01:30,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:30,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:01:30,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:01:30,146 INFO L87 Difference]: Start difference. First operand 8964 states and 41031 transitions. Second operand 9 states. [2020-10-05 23:01:31,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:31,078 INFO L93 Difference]: Finished difference Result 29379 states and 112099 transitions. [2020-10-05 23:01:31,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:31,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:01:31,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:31,156 INFO L225 Difference]: With dead ends: 29379 [2020-10-05 23:01:31,156 INFO L226 Difference]: Without dead ends: 29356 [2020-10-05 23:01:31,157 INFO L675 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 [2020-10-05 23:01:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29356 states. [2020-10-05 23:01:31,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29356 to 8573. [2020-10-05 23:01:31,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8573 states. [2020-10-05 23:01:31,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8573 states to 8573 states and 39353 transitions. [2020-10-05 23:01:31,637 INFO L78 Accepts]: Start accepts. Automaton has 8573 states and 39353 transitions. Word has length 21 [2020-10-05 23:01:31,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:31,637 INFO L479 AbstractCegarLoop]: Abstraction has 8573 states and 39353 transitions. [2020-10-05 23:01:31,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:01:31,638 INFO L276 IsEmpty]: Start isEmpty. Operand 8573 states and 39353 transitions. [2020-10-05 23:01:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:01:31,639 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:31,639 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:31,639 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-10-05 23:01:31,639 INFO L427 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]=== [2020-10-05 23:01:31,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:31,640 INFO L82 PathProgramCache]: Analyzing trace with hash 715669452, now seen corresponding path program 1 times [2020-10-05 23:01:31,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:31,640 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772203551] [2020-10-05 23:01:31,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:01:31,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772203551] [2020-10-05 23:01:31,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696457971] [2020-10-05 23:01:31,686 INFO L95 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 [2020-10-05 23:01:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:31,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:01:31,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:01:31,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:31,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:01:31,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811984566] [2020-10-05 23:01:31,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:01:31,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:31,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:01:31,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:01:31,822 INFO L87 Difference]: Start difference. First operand 8573 states and 39353 transitions. Second operand 12 states. [2020-10-05 23:01:32,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:32,239 INFO L93 Difference]: Finished difference Result 19727 states and 80274 transitions. [2020-10-05 23:01:32,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:01:32,239 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:01:32,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:32,292 INFO L225 Difference]: With dead ends: 19727 [2020-10-05 23:01:32,292 INFO L226 Difference]: Without dead ends: 19703 [2020-10-05 23:01:32,292 INFO L675 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 [2020-10-05 23:01:32,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19703 states. [2020-10-05 23:01:32,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19703 to 8847. [2020-10-05 23:01:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8847 states. [2020-10-05 23:01:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 40495 transitions. [2020-10-05 23:01:32,641 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 40495 transitions. Word has length 23 [2020-10-05 23:01:32,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:32,641 INFO L479 AbstractCegarLoop]: Abstraction has 8847 states and 40495 transitions. [2020-10-05 23:01:32,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:01:32,641 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 40495 transitions. [2020-10-05 23:01:32,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:01:32,644 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:32,644 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:32,844 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2020-10-05 23:01:32,845 INFO L427 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]=== [2020-10-05 23:01:32,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:32,846 INFO L82 PathProgramCache]: Analyzing trace with hash 504272987, now seen corresponding path program 1 times [2020-10-05 23:01:32,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:32,846 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878766094] [2020-10-05 23:01:32,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:32,897 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:01:32,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878766094] [2020-10-05 23:01:32,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931667200] [2020-10-05 23:01:32,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:01:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:33,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:01:33,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:01:33,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:33,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:01:33,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071166871] [2020-10-05 23:01:33,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:01:33,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:33,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:01:33,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:01:33,177 INFO L87 Difference]: Start difference. First operand 8847 states and 40495 transitions. Second operand 12 states. [2020-10-05 23:01:33,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:33,580 INFO L93 Difference]: Finished difference Result 20694 states and 84261 transitions. [2020-10-05 23:01:33,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:01:33,581 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:01:33,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:33,636 INFO L225 Difference]: With dead ends: 20694 [2020-10-05 23:01:33,636 INFO L226 Difference]: Without dead ends: 20666 [2020-10-05 23:01:33,637 INFO L675 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 [2020-10-05 23:01:33,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20666 states. [2020-10-05 23:01:33,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20666 to 9115. [2020-10-05 23:01:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9115 states. [2020-10-05 23:01:33,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9115 states to 9115 states and 41679 transitions. [2020-10-05 23:01:33,995 INFO L78 Accepts]: Start accepts. Automaton has 9115 states and 41679 transitions. Word has length 23 [2020-10-05 23:01:33,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:33,996 INFO L479 AbstractCegarLoop]: Abstraction has 9115 states and 41679 transitions. [2020-10-05 23:01:33,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:01:33,996 INFO L276 IsEmpty]: Start isEmpty. Operand 9115 states and 41679 transitions. [2020-10-05 23:01:33,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:01:33,998 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:33,998 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:34,198 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:01:34,199 INFO L427 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]=== [2020-10-05 23:01:34,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:34,199 INFO L82 PathProgramCache]: Analyzing trace with hash 591685125, now seen corresponding path program 1 times [2020-10-05 23:01:34,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:34,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361499680] [2020-10-05 23:01:34,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:34,246 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:01:34,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361499680] [2020-10-05 23:01:34,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910680028] [2020-10-05 23:01:34,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:01:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:34,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:01:34,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:01:34,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:34,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:01:34,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062409682] [2020-10-05 23:01:34,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:01:34,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:34,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:01:34,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:01:34,404 INFO L87 Difference]: Start difference. First operand 9115 states and 41679 transitions. Second operand 12 states. [2020-10-05 23:01:34,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:34,820 INFO L93 Difference]: Finished difference Result 21396 states and 87360 transitions. [2020-10-05 23:01:34,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:01:34,821 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:01:34,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:34,875 INFO L225 Difference]: With dead ends: 21396 [2020-10-05 23:01:34,875 INFO L226 Difference]: Without dead ends: 21359 [2020-10-05 23:01:34,875 INFO L675 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 [2020-10-05 23:01:34,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21359 states. [2020-10-05 23:01:35,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21359 to 9320. [2020-10-05 23:01:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9320 states. [2020-10-05 23:01:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9320 states to 9320 states and 42648 transitions. [2020-10-05 23:01:35,227 INFO L78 Accepts]: Start accepts. Automaton has 9320 states and 42648 transitions. Word has length 23 [2020-10-05 23:01:35,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:35,227 INFO L479 AbstractCegarLoop]: Abstraction has 9320 states and 42648 transitions. [2020-10-05 23:01:35,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:01:35,227 INFO L276 IsEmpty]: Start isEmpty. Operand 9320 states and 42648 transitions. [2020-10-05 23:01:35,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:01:35,229 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:35,229 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:35,430 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2020-10-05 23:01:35,430 INFO L427 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]=== [2020-10-05 23:01:35,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:35,431 INFO L82 PathProgramCache]: Analyzing trace with hash 142124187, now seen corresponding path program 2 times [2020-10-05 23:01:35,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:35,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692667255] [2020-10-05 23:01:35,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:01:35,481 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692667255] [2020-10-05 23:01:35,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:35,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:01:35,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939263202] [2020-10-05 23:01:35,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:01:35,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:35,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:01:35,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:01:35,484 INFO L87 Difference]: Start difference. First operand 9320 states and 42648 transitions. Second operand 7 states. [2020-10-05 23:01:35,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:35,949 INFO L93 Difference]: Finished difference Result 21489 states and 87752 transitions. [2020-10-05 23:01:35,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:01:35,950 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:01:35,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:36,030 INFO L225 Difference]: With dead ends: 21489 [2020-10-05 23:01:36,030 INFO L226 Difference]: Without dead ends: 21452 [2020-10-05 23:01:36,031 INFO L675 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 [2020-10-05 23:01:36,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21452 states. [2020-10-05 23:01:36,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21452 to 9401. [2020-10-05 23:01:36,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9401 states. [2020-10-05 23:01:36,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9401 states to 9401 states and 43010 transitions. [2020-10-05 23:01:36,638 INFO L78 Accepts]: Start accepts. Automaton has 9401 states and 43010 transitions. Word has length 23 [2020-10-05 23:01:36,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:36,638 INFO L479 AbstractCegarLoop]: Abstraction has 9401 states and 43010 transitions. [2020-10-05 23:01:36,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:01:36,638 INFO L276 IsEmpty]: Start isEmpty. Operand 9401 states and 43010 transitions. [2020-10-05 23:01:36,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:01:36,640 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:36,640 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:36,640 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-10-05 23:01:36,641 INFO L427 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]=== [2020-10-05 23:01:36,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:36,641 INFO L82 PathProgramCache]: Analyzing trace with hash 142117429, now seen corresponding path program 2 times [2020-10-05 23:01:36,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:36,641 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104990025] [2020-10-05 23:01:36,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:36,694 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:01:36,695 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104990025] [2020-10-05 23:01:36,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:36,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:01:36,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492742021] [2020-10-05 23:01:36,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:01:36,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:36,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:01:36,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:01:36,696 INFO L87 Difference]: Start difference. First operand 9401 states and 43010 transitions. Second operand 7 states. [2020-10-05 23:01:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:37,097 INFO L93 Difference]: Finished difference Result 21198 states and 86437 transitions. [2020-10-05 23:01:37,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:01:37,097 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:01:37,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:37,147 INFO L225 Difference]: With dead ends: 21198 [2020-10-05 23:01:37,148 INFO L226 Difference]: Without dead ends: 21161 [2020-10-05 23:01:37,148 INFO L675 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 [2020-10-05 23:01:37,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21161 states. [2020-10-05 23:01:37,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21161 to 9396. [2020-10-05 23:01:37,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9396 states. [2020-10-05 23:01:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9396 states to 9396 states and 42985 transitions. [2020-10-05 23:01:37,517 INFO L78 Accepts]: Start accepts. Automaton has 9396 states and 42985 transitions. Word has length 23 [2020-10-05 23:01:37,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:37,517 INFO L479 AbstractCegarLoop]: Abstraction has 9396 states and 42985 transitions. [2020-10-05 23:01:37,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:01:37,517 INFO L276 IsEmpty]: Start isEmpty. Operand 9396 states and 42985 transitions. [2020-10-05 23:01:37,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:01:37,519 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:37,519 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:37,519 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-10-05 23:01:37,519 INFO L427 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]=== [2020-10-05 23:01:37,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:37,520 INFO L82 PathProgramCache]: Analyzing trace with hash 142103758, now seen corresponding path program 2 times [2020-10-05 23:01:37,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:37,520 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446576831] [2020-10-05 23:01:37,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:37,571 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:01:37,571 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446576831] [2020-10-05 23:01:37,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:37,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:01:37,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127579802] [2020-10-05 23:01:37,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:01:37,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:37,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:01:37,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:01:37,573 INFO L87 Difference]: Start difference. First operand 9396 states and 42985 transitions. Second operand 7 states. [2020-10-05 23:01:37,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:37,962 INFO L93 Difference]: Finished difference Result 21067 states and 85734 transitions. [2020-10-05 23:01:37,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:01:37,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:01:37,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:38,023 INFO L225 Difference]: With dead ends: 21067 [2020-10-05 23:01:38,023 INFO L226 Difference]: Without dead ends: 21030 [2020-10-05 23:01:38,024 INFO L675 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 [2020-10-05 23:01:38,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21030 states. [2020-10-05 23:01:38,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21030 to 9426. [2020-10-05 23:01:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9426 states. [2020-10-05 23:01:38,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9426 states to 9426 states and 43057 transitions. [2020-10-05 23:01:38,374 INFO L78 Accepts]: Start accepts. Automaton has 9426 states and 43057 transitions. Word has length 23 [2020-10-05 23:01:38,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:38,374 INFO L479 AbstractCegarLoop]: Abstraction has 9426 states and 43057 transitions. [2020-10-05 23:01:38,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:01:38,374 INFO L276 IsEmpty]: Start isEmpty. Operand 9426 states and 43057 transitions. [2020-10-05 23:01:38,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:01:38,377 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:38,377 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:38,378 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-10-05 23:01:38,378 INFO L427 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]=== [2020-10-05 23:01:38,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:38,378 INFO L82 PathProgramCache]: Analyzing trace with hash 925732074, now seen corresponding path program 1 times [2020-10-05 23:01:38,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:38,378 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888082454] [2020-10-05 23:01:38,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:38,447 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:01:38,448 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888082454] [2020-10-05 23:01:38,448 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941715238] [2020-10-05 23:01:38,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-05 23:01:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:38,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:01:38,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:38,662 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:01:38,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:38,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:01:38,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877741552] [2020-10-05 23:01:38,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:01:38,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:38,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:01:38,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:01:38,666 INFO L87 Difference]: Start difference. First operand 9426 states and 43057 transitions. Second operand 16 states. [2020-10-05 23:01:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:39,815 INFO L93 Difference]: Finished difference Result 30145 states and 115754 transitions. [2020-10-05 23:01:39,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:39,816 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:01:39,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:40,070 INFO L225 Difference]: With dead ends: 30145 [2020-10-05 23:01:40,070 INFO L226 Difference]: Without dead ends: 30125 [2020-10-05 23:01:40,071 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:01:40,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30125 states. [2020-10-05 23:01:40,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30125 to 9338. [2020-10-05 23:01:40,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9338 states. [2020-10-05 23:01:40,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9338 states to 9338 states and 42582 transitions. [2020-10-05 23:01:40,497 INFO L78 Accepts]: Start accepts. Automaton has 9338 states and 42582 transitions. Word has length 25 [2020-10-05 23:01:40,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:40,497 INFO L479 AbstractCegarLoop]: Abstraction has 9338 states and 42582 transitions. [2020-10-05 23:01:40,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:01:40,497 INFO L276 IsEmpty]: Start isEmpty. Operand 9338 states and 42582 transitions. [2020-10-05 23:01:40,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:01:40,500 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:40,500 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:40,700 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2020-10-05 23:01:40,701 INFO L427 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]=== [2020-10-05 23:01:40,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:40,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1013144212, now seen corresponding path program 1 times [2020-10-05 23:01:40,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:40,702 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254600933] [2020-10-05 23:01:40,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:01:40,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254600933] [2020-10-05 23:01:40,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331308357] [2020-10-05 23:01:40,768 INFO L95 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 [2020-10-05 23:01:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:40,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:01:40,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:01:40,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:40,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:01:40,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58637361] [2020-10-05 23:01:40,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:01:40,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:40,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:01:40,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:01:40,952 INFO L87 Difference]: Start difference. First operand 9338 states and 42582 transitions. Second operand 16 states. [2020-10-05 23:01:41,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:41,927 INFO L93 Difference]: Finished difference Result 29696 states and 113916 transitions. [2020-10-05 23:01:41,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:41,928 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:01:41,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:42,001 INFO L225 Difference]: With dead ends: 29696 [2020-10-05 23:01:42,001 INFO L226 Difference]: Without dead ends: 29676 [2020-10-05 23:01:42,002 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:01:42,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29676 states. [2020-10-05 23:01:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29676 to 9291. [2020-10-05 23:01:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9291 states. [2020-10-05 23:01:42,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9291 states to 9291 states and 42295 transitions. [2020-10-05 23:01:42,449 INFO L78 Accepts]: Start accepts. Automaton has 9291 states and 42295 transitions. Word has length 25 [2020-10-05 23:01:42,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:42,450 INFO L479 AbstractCegarLoop]: Abstraction has 9291 states and 42295 transitions. [2020-10-05 23:01:42,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:01:42,450 INFO L276 IsEmpty]: Start isEmpty. Operand 9291 states and 42295 transitions. [2020-10-05 23:01:42,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:01:42,453 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:42,453 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:42,653 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2020-10-05 23:01:42,653 INFO L427 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]=== [2020-10-05 23:01:42,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:42,654 INFO L82 PathProgramCache]: Analyzing trace with hash 563583274, now seen corresponding path program 2 times [2020-10-05 23:01:42,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:42,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501491473] [2020-10-05 23:01:42,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:42,718 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:01:42,718 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501491473] [2020-10-05 23:01:42,718 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810733401] [2020-10-05 23:01:42,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:01:42,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:01:42,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:01:42,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:01:42,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:42,914 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:01:42,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:42,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:01:42,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577751301] [2020-10-05 23:01:42,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:01:42,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:42,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:01:42,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:01:42,916 INFO L87 Difference]: Start difference. First operand 9291 states and 42295 transitions. Second operand 16 states. [2020-10-05 23:01:43,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:43,911 INFO L93 Difference]: Finished difference Result 29267 states and 112142 transitions. [2020-10-05 23:01:43,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:43,912 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:01:43,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:43,982 INFO L225 Difference]: With dead ends: 29267 [2020-10-05 23:01:43,982 INFO L226 Difference]: Without dead ends: 29245 [2020-10-05 23:01:43,982 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:01:44,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29245 states. [2020-10-05 23:01:44,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29245 to 9288. [2020-10-05 23:01:44,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9288 states. [2020-10-05 23:01:44,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9288 states to 9288 states and 42242 transitions. [2020-10-05 23:01:44,579 INFO L78 Accepts]: Start accepts. Automaton has 9288 states and 42242 transitions. Word has length 25 [2020-10-05 23:01:44,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:44,579 INFO L479 AbstractCegarLoop]: Abstraction has 9288 states and 42242 transitions. [2020-10-05 23:01:44,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:01:44,580 INFO L276 IsEmpty]: Start isEmpty. Operand 9288 states and 42242 transitions. [2020-10-05 23:01:44,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:01:44,582 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:44,583 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:44,783 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2020-10-05 23:01:44,783 INFO L427 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]=== [2020-10-05 23:01:44,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:44,784 INFO L82 PathProgramCache]: Analyzing trace with hash 563576516, now seen corresponding path program 2 times [2020-10-05 23:01:44,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:44,785 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622547934] [2020-10-05 23:01:44,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:01:44,860 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622547934] [2020-10-05 23:01:44,860 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101957537] [2020-10-05 23:01:44,860 INFO L93 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 [2020-10-05 23:01:44,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:01:44,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:01:44,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:01:44,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:01:45,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:45,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:01:45,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263428683] [2020-10-05 23:01:45,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:01:45,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:45,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:01:45,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:01:45,041 INFO L87 Difference]: Start difference. First operand 9288 states and 42242 transitions. Second operand 16 states. [2020-10-05 23:01:46,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:46,179 INFO L93 Difference]: Finished difference Result 28920 states and 110796 transitions. [2020-10-05 23:01:46,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:46,179 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:01:46,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:46,250 INFO L225 Difference]: With dead ends: 28920 [2020-10-05 23:01:46,250 INFO L226 Difference]: Without dead ends: 28898 [2020-10-05 23:01:46,251 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:01:46,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28898 states. [2020-10-05 23:01:46,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28898 to 9176. [2020-10-05 23:01:46,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9176 states. [2020-10-05 23:01:46,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 41695 transitions. [2020-10-05 23:01:46,713 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 41695 transitions. Word has length 25 [2020-10-05 23:01:46,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:46,713 INFO L479 AbstractCegarLoop]: Abstraction has 9176 states and 41695 transitions. [2020-10-05 23:01:46,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:01:46,713 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 41695 transitions. [2020-10-05 23:01:46,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:01:46,716 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:46,717 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:46,917 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:01:46,917 INFO L427 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]=== [2020-10-05 23:01:46,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:46,918 INFO L82 PathProgramCache]: Analyzing trace with hash -2052215638, now seen corresponding path program 3 times [2020-10-05 23:01:46,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:46,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587887413] [2020-10-05 23:01:46,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:46,985 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-05 23:01:46,985 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587887413] [2020-10-05 23:01:46,986 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412279062] [2020-10-05 23:01:46,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2020-10-05 23:01:47,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-05 23:01:47,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:01:47,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:01:47,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-05 23:01:47,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:47,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:01:47,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232742530] [2020-10-05 23:01:47,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:01:47,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:47,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:01:47,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:01:47,153 INFO L87 Difference]: Start difference. First operand 9176 states and 41695 transitions. Second operand 16 states. [2020-10-05 23:01:48,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:48,118 INFO L93 Difference]: Finished difference Result 29038 states and 111216 transitions. [2020-10-05 23:01:48,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:48,119 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:01:48,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:48,191 INFO L225 Difference]: With dead ends: 29038 [2020-10-05 23:01:48,192 INFO L226 Difference]: Without dead ends: 29018 [2020-10-05 23:01:48,192 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:01:48,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29018 states. [2020-10-05 23:01:48,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29018 to 9000. [2020-10-05 23:01:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9000 states. [2020-10-05 23:01:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9000 states to 9000 states and 40897 transitions. [2020-10-05 23:01:48,856 INFO L78 Accepts]: Start accepts. Automaton has 9000 states and 40897 transitions. Word has length 25 [2020-10-05 23:01:48,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:48,856 INFO L479 AbstractCegarLoop]: Abstraction has 9000 states and 40897 transitions. [2020-10-05 23:01:48,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:01:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 9000 states and 40897 transitions. [2020-10-05 23:01:48,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:01:48,859 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:48,859 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:49,060 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2020-10-05 23:01:49,060 INFO L427 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]=== [2020-10-05 23:01:49,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:49,061 INFO L82 PathProgramCache]: Analyzing trace with hash -275395741, now seen corresponding path program 1 times [2020-10-05 23:01:49,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:49,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701908253] [2020-10-05 23:01:49,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:01:49,128 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701908253] [2020-10-05 23:01:49,128 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895138304] [2020-10-05 23:01:49,128 INFO L95 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 [2020-10-05 23:01:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:49,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:01:49,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:49,311 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:01:49,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:49,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:01:49,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004474234] [2020-10-05 23:01:49,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:01:49,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:49,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:01:49,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:01:49,313 INFO L87 Difference]: Start difference. First operand 9000 states and 40897 transitions. Second operand 16 states. [2020-10-05 23:01:50,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:50,446 INFO L93 Difference]: Finished difference Result 29417 states and 113034 transitions. [2020-10-05 23:01:50,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:50,446 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:01:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:50,521 INFO L225 Difference]: With dead ends: 29417 [2020-10-05 23:01:50,522 INFO L226 Difference]: Without dead ends: 29397 [2020-10-05 23:01:50,522 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:01:50,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29397 states. [2020-10-05 23:01:50,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29397 to 8990. [2020-10-05 23:01:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8990 states. [2020-10-05 23:01:50,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8990 states to 8990 states and 40786 transitions. [2020-10-05 23:01:50,962 INFO L78 Accepts]: Start accepts. Automaton has 8990 states and 40786 transitions. Word has length 25 [2020-10-05 23:01:50,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:50,962 INFO L479 AbstractCegarLoop]: Abstraction has 8990 states and 40786 transitions. [2020-10-05 23:01:50,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:01:50,962 INFO L276 IsEmpty]: Start isEmpty. Operand 8990 states and 40786 transitions. [2020-10-05 23:01:50,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:01:50,966 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:50,966 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:51,166 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:01:51,167 INFO L427 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]=== [2020-10-05 23:01:51,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:51,167 INFO L82 PathProgramCache]: Analyzing trace with hash -724963437, now seen corresponding path program 2 times [2020-10-05 23:01:51,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:51,168 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598081875] [2020-10-05 23:01:51,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:01:51,235 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598081875] [2020-10-05 23:01:51,235 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362832880] [2020-10-05 23:01:51,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:01:51,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:01:51,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:01:51,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:01:51,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:51,446 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:01:51,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:51,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:01:51,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678050600] [2020-10-05 23:01:51,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:01:51,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:51,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:01:51,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:01:51,448 INFO L87 Difference]: Start difference. First operand 8990 states and 40786 transitions. Second operand 16 states. [2020-10-05 23:01:52,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:52,465 INFO L93 Difference]: Finished difference Result 29064 states and 111552 transitions. [2020-10-05 23:01:52,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:52,466 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:01:52,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:52,545 INFO L225 Difference]: With dead ends: 29064 [2020-10-05 23:01:52,545 INFO L226 Difference]: Without dead ends: 29037 [2020-10-05 23:01:52,546 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:01:52,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29037 states. [2020-10-05 23:01:52,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29037 to 8953. [2020-10-05 23:01:52,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8953 states. [2020-10-05 23:01:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8953 states to 8953 states and 40609 transitions. [2020-10-05 23:01:52,995 INFO L78 Accepts]: Start accepts. Automaton has 8953 states and 40609 transitions. Word has length 25 [2020-10-05 23:01:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:52,995 INFO L479 AbstractCegarLoop]: Abstraction has 8953 states and 40609 transitions. [2020-10-05 23:01:52,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:01:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 8953 states and 40609 transitions. [2020-10-05 23:01:52,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:01:52,998 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:52,998 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:53,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2020-10-05 23:01:53,199 INFO L427 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]=== [2020-10-05 23:01:53,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:53,200 INFO L82 PathProgramCache]: Analyzing trace with hash -724977108, now seen corresponding path program 4 times [2020-10-05 23:01:53,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:53,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995596556] [2020-10-05 23:01:53,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:53,264 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:01:53,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995596556] [2020-10-05 23:01:53,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756773565] [2020-10-05 23:01:53,264 INFO L93 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 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 [2020-10-05 23:01:53,338 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:01:53,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:01:53,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:01:53,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:01:53,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:53,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:01:53,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398906567] [2020-10-05 23:01:53,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:01:53,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:53,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:01:53,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:01:53,446 INFO L87 Difference]: Start difference. First operand 8953 states and 40609 transitions. Second operand 16 states. [2020-10-05 23:01:54,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:54,524 INFO L93 Difference]: Finished difference Result 28523 states and 109227 transitions. [2020-10-05 23:01:54,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:54,524 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:01:54,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:54,601 INFO L225 Difference]: With dead ends: 28523 [2020-10-05 23:01:54,602 INFO L226 Difference]: Without dead ends: 28501 [2020-10-05 23:01:54,602 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:01:54,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28501 states. [2020-10-05 23:01:55,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28501 to 8841. [2020-10-05 23:01:55,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8841 states. [2020-10-05 23:01:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 40062 transitions. [2020-10-05 23:01:55,044 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 40062 transitions. Word has length 25 [2020-10-05 23:01:55,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:55,045 INFO L479 AbstractCegarLoop]: Abstraction has 8841 states and 40062 transitions. [2020-10-05 23:01:55,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:01:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 40062 transitions. [2020-10-05 23:01:55,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:01:55,050 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:55,050 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:55,255 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:01:55,256 INFO L427 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]=== [2020-10-05 23:01:55,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:55,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1969402905, now seen corresponding path program 3 times [2020-10-05 23:01:55,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:55,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438401196] [2020-10-05 23:01:55,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:55,322 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:01:55,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438401196] [2020-10-05 23:01:55,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408955159] [2020-10-05 23:01:55,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2020-10-05 23:01:55,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:01:55,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:01:55,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:01:55,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:55,499 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:01:55,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:55,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:01:55,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157270719] [2020-10-05 23:01:55,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:01:55,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:55,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:01:55,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:01:55,501 INFO L87 Difference]: Start difference. First operand 8841 states and 40062 transitions. Second operand 16 states. [2020-10-05 23:01:56,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:56,422 INFO L93 Difference]: Finished difference Result 28636 states and 109852 transitions. [2020-10-05 23:01:56,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:56,423 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:01:56,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:56,497 INFO L225 Difference]: With dead ends: 28636 [2020-10-05 23:01:56,497 INFO L226 Difference]: Without dead ends: 28616 [2020-10-05 23:01:56,498 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:01:56,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28616 states. [2020-10-05 23:01:56,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28616 to 8702. [2020-10-05 23:01:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8702 states. [2020-10-05 23:01:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8702 states to 8702 states and 39438 transitions. [2020-10-05 23:01:56,929 INFO L78 Accepts]: Start accepts. Automaton has 8702 states and 39438 transitions. Word has length 25 [2020-10-05 23:01:56,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:56,929 INFO L479 AbstractCegarLoop]: Abstraction has 8702 states and 39438 transitions. [2020-10-05 23:01:56,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:01:56,929 INFO L276 IsEmpty]: Start isEmpty. Operand 8702 states and 39438 transitions. [2020-10-05 23:01:56,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:01:56,932 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:56,932 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:57,139 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2020-10-05 23:01:57,140 INFO L427 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]=== [2020-10-05 23:01:57,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:57,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1576190868, now seen corresponding path program 3 times [2020-10-05 23:01:57,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:57,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348415774] [2020-10-05 23:01:57,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:01:57,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348415774] [2020-10-05 23:01:57,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921952829] [2020-10-05 23:01:57,206 INFO L93 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 [2020-10-05 23:01:57,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:01:57,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:01:57,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:01:57,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:57,387 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:01:57,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:57,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:01:57,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567359838] [2020-10-05 23:01:57,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:01:57,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:57,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:01:57,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:01:57,388 INFO L87 Difference]: Start difference. First operand 8702 states and 39438 transitions. Second operand 16 states. [2020-10-05 23:01:58,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:58,340 INFO L93 Difference]: Finished difference Result 28297 states and 108461 transitions. [2020-10-05 23:01:58,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:58,341 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:01:58,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:58,432 INFO L225 Difference]: With dead ends: 28297 [2020-10-05 23:01:58,432 INFO L226 Difference]: Without dead ends: 28277 [2020-10-05 23:01:58,433 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:01:58,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28277 states. [2020-10-05 23:01:58,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28277 to 8596. [2020-10-05 23:01:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8596 states. [2020-10-05 23:01:58,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8596 states to 8596 states and 38978 transitions. [2020-10-05 23:01:58,867 INFO L78 Accepts]: Start accepts. Automaton has 8596 states and 38978 transitions. Word has length 25 [2020-10-05 23:01:58,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:58,868 INFO L479 AbstractCegarLoop]: Abstraction has 8596 states and 38978 transitions. [2020-10-05 23:01:58,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:01:58,868 INFO L276 IsEmpty]: Start isEmpty. Operand 8596 states and 38978 transitions. [2020-10-05 23:01:58,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:01:58,871 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:58,871 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:59,072 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:01:59,072 INFO L427 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]=== [2020-10-05 23:01:59,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:59,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1673729315, now seen corresponding path program 4 times [2020-10-05 23:01:59,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:59,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359286807] [2020-10-05 23:01:59,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:59,150 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:01:59,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359286807] [2020-10-05 23:01:59,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925331496] [2020-10-05 23:01:59,150 INFO L93 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 [2020-10-05 23:01:59,352 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:01:59,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:01:59,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:01:59,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:01:59,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:59,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:01:59,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265802781] [2020-10-05 23:01:59,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:01:59,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:59,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:01:59,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:01:59,465 INFO L87 Difference]: Start difference. First operand 8596 states and 38978 transitions. Second operand 16 states. [2020-10-05 23:02:00,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:00,610 INFO L93 Difference]: Finished difference Result 28565 states and 109596 transitions. [2020-10-05 23:02:00,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:00,611 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:02:00,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:00,683 INFO L225 Difference]: With dead ends: 28565 [2020-10-05 23:02:00,683 INFO L226 Difference]: Without dead ends: 28538 [2020-10-05 23:02:00,684 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:02:00,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28538 states. [2020-10-05 23:02:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28538 to 8563. [2020-10-05 23:02:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8563 states. [2020-10-05 23:02:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8563 states to 8563 states and 38809 transitions. [2020-10-05 23:02:01,129 INFO L78 Accepts]: Start accepts. Automaton has 8563 states and 38809 transitions. Word has length 25 [2020-10-05 23:02:01,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:01,129 INFO L479 AbstractCegarLoop]: Abstraction has 8563 states and 38809 transitions. [2020-10-05 23:02:01,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:02:01,129 INFO L276 IsEmpty]: Start isEmpty. Operand 8563 states and 38809 transitions. [2020-10-05 23:02:01,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:02:01,133 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:01,133 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:01,333 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2020-10-05 23:02:01,334 INFO L427 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]=== [2020-10-05 23:02:01,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:01,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1673708886, now seen corresponding path program 4 times [2020-10-05 23:02:01,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:01,335 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443225015] [2020-10-05 23:02:01,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:02:01,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443225015] [2020-10-05 23:02:01,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220811395] [2020-10-05 23:02:01,408 INFO L93 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 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 [2020-10-05 23:02:01,512 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:02:01,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:02:01,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:02:01,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:02:01,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:01,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:02:01,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210231571] [2020-10-05 23:02:01,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:02:01,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:01,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:02:01,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:02:01,655 INFO L87 Difference]: Start difference. First operand 8563 states and 38809 transitions. Second operand 16 states. [2020-10-05 23:02:02,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:02,793 INFO L93 Difference]: Finished difference Result 28213 states and 108237 transitions. [2020-10-05 23:02:02,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:02,794 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:02:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:02,870 INFO L225 Difference]: With dead ends: 28213 [2020-10-05 23:02:02,870 INFO L226 Difference]: Without dead ends: 28186 [2020-10-05 23:02:02,871 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:02:03,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28186 states. [2020-10-05 23:02:03,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28186 to 8421. [2020-10-05 23:02:03,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8421 states. [2020-10-05 23:02:03,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8421 states to 8421 states and 38146 transitions. [2020-10-05 23:02:03,308 INFO L78 Accepts]: Start accepts. Automaton has 8421 states and 38146 transitions. Word has length 25 [2020-10-05 23:02:03,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:03,308 INFO L479 AbstractCegarLoop]: Abstraction has 8421 states and 38146 transitions. [2020-10-05 23:02:03,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:02:03,308 INFO L276 IsEmpty]: Start isEmpty. Operand 8421 states and 38146 transitions. [2020-10-05 23:02:03,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:02:03,312 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:03,312 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:03,512 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:02:03,513 INFO L427 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]=== [2020-10-05 23:02:03,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:03,513 INFO L82 PathProgramCache]: Analyzing trace with hash -857609261, now seen corresponding path program 5 times [2020-10-05 23:02:03,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:03,514 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191157655] [2020-10-05 23:02:03,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:03,582 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:02:03,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191157655] [2020-10-05 23:02:03,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:03,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:02:03,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176486132] [2020-10-05 23:02:03,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:02:03,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:03,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:02:03,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:02:03,584 INFO L87 Difference]: Start difference. First operand 8421 states and 38146 transitions. Second operand 9 states. [2020-10-05 23:02:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:04,549 INFO L93 Difference]: Finished difference Result 28226 states and 108274 transitions. [2020-10-05 23:02:04,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:04,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:02:04,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:04,622 INFO L225 Difference]: With dead ends: 28226 [2020-10-05 23:02:04,622 INFO L226 Difference]: Without dead ends: 28206 [2020-10-05 23:02:04,623 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:02:04,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28206 states. [2020-10-05 23:02:05,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28206 to 8277. [2020-10-05 23:02:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8277 states. [2020-10-05 23:02:05,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8277 states to 8277 states and 37487 transitions. [2020-10-05 23:02:05,279 INFO L78 Accepts]: Start accepts. Automaton has 8277 states and 37487 transitions. Word has length 25 [2020-10-05 23:02:05,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:05,280 INFO L479 AbstractCegarLoop]: Abstraction has 8277 states and 37487 transitions. [2020-10-05 23:02:05,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:02:05,280 INFO L276 IsEmpty]: Start isEmpty. Operand 8277 states and 37487 transitions. [2020-10-05 23:02:05,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:02:05,284 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:05,284 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:05,284 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2020-10-05 23:02:05,284 INFO L427 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]=== [2020-10-05 23:02:05,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:05,284 INFO L82 PathProgramCache]: Analyzing trace with hash -857622932, now seen corresponding path program 5 times [2020-10-05 23:02:05,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:05,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418041575] [2020-10-05 23:02:05,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:05,362 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:02:05,363 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418041575] [2020-10-05 23:02:05,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:05,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:02:05,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658715211] [2020-10-05 23:02:05,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:02:05,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:05,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:02:05,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:02:05,364 INFO L87 Difference]: Start difference. First operand 8277 states and 37487 transitions. Second operand 9 states. [2020-10-05 23:02:06,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:06,267 INFO L93 Difference]: Finished difference Result 27801 states and 106552 transitions. [2020-10-05 23:02:06,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:06,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:02:06,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:06,346 INFO L225 Difference]: With dead ends: 27801 [2020-10-05 23:02:06,346 INFO L226 Difference]: Without dead ends: 27781 [2020-10-05 23:02:06,346 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:02:06,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27781 states. [2020-10-05 23:02:06,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27781 to 8127. [2020-10-05 23:02:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8127 states. [2020-10-05 23:02:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8127 states to 8127 states and 36806 transitions. [2020-10-05 23:02:06,776 INFO L78 Accepts]: Start accepts. Automaton has 8127 states and 36806 transitions. Word has length 25 [2020-10-05 23:02:06,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:06,776 INFO L479 AbstractCegarLoop]: Abstraction has 8127 states and 36806 transitions. [2020-10-05 23:02:06,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:02:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 8127 states and 36806 transitions. [2020-10-05 23:02:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:02:06,779 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:06,779 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:06,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2020-10-05 23:02:06,779 INFO L427 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]=== [2020-10-05 23:02:06,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:06,780 INFO L82 PathProgramCache]: Analyzing trace with hash -864096941, now seen corresponding path program 6 times [2020-10-05 23:02:06,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:06,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871521036] [2020-10-05 23:02:06,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:02:06,856 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871521036] [2020-10-05 23:02:06,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:06,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:02:06,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808752979] [2020-10-05 23:02:06,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:02:06,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:06,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:02:06,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:02:06,858 INFO L87 Difference]: Start difference. First operand 8127 states and 36806 transitions. Second operand 9 states. [2020-10-05 23:02:08,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:08,127 INFO L93 Difference]: Finished difference Result 27548 states and 105447 transitions. [2020-10-05 23:02:08,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:08,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:02:08,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:08,236 INFO L225 Difference]: With dead ends: 27548 [2020-10-05 23:02:08,236 INFO L226 Difference]: Without dead ends: 27521 [2020-10-05 23:02:08,236 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:02:08,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27521 states. [2020-10-05 23:02:08,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27521 to 7841. [2020-10-05 23:02:08,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7841 states. [2020-10-05 23:02:08,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7841 states to 7841 states and 35578 transitions. [2020-10-05 23:02:08,791 INFO L78 Accepts]: Start accepts. Automaton has 7841 states and 35578 transitions. Word has length 25 [2020-10-05 23:02:08,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:08,791 INFO L479 AbstractCegarLoop]: Abstraction has 7841 states and 35578 transitions. [2020-10-05 23:02:08,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:02:08,791 INFO L276 IsEmpty]: Start isEmpty. Operand 7841 states and 35578 transitions. [2020-10-05 23:02:08,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:02:08,794 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:08,795 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:08,795 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2020-10-05 23:02:08,795 INFO L427 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]=== [2020-10-05 23:02:08,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:08,795 INFO L82 PathProgramCache]: Analyzing trace with hash -864117370, now seen corresponding path program 5 times [2020-10-05 23:02:08,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:08,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409852706] [2020-10-05 23:02:08,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:02:08,866 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409852706] [2020-10-05 23:02:08,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:08,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:02:08,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471026594] [2020-10-05 23:02:08,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:02:08,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:08,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:02:08,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:02:08,868 INFO L87 Difference]: Start difference. First operand 7841 states and 35578 transitions. Second operand 9 states. [2020-10-05 23:02:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:09,786 INFO L93 Difference]: Finished difference Result 27167 states and 103966 transitions. [2020-10-05 23:02:09,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:09,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:02:09,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:09,861 INFO L225 Difference]: With dead ends: 27167 [2020-10-05 23:02:09,862 INFO L226 Difference]: Without dead ends: 27147 [2020-10-05 23:02:09,862 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:02:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27147 states. [2020-10-05 23:02:10,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27147 to 7743. [2020-10-05 23:02:10,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7743 states. [2020-10-05 23:02:10,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7743 states to 7743 states and 35142 transitions. [2020-10-05 23:02:10,297 INFO L78 Accepts]: Start accepts. Automaton has 7743 states and 35142 transitions. Word has length 25 [2020-10-05 23:02:10,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:10,298 INFO L479 AbstractCegarLoop]: Abstraction has 7743 states and 35142 transitions. [2020-10-05 23:02:10,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:02:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 7743 states and 35142 transitions. [2020-10-05 23:02:10,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:02:10,301 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:10,301 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:10,301 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2020-10-05 23:02:10,301 INFO L427 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]=== [2020-10-05 23:02:10,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:10,301 INFO L82 PathProgramCache]: Analyzing trace with hash -877234772, now seen corresponding path program 6 times [2020-10-05 23:02:10,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:10,302 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390135504] [2020-10-05 23:02:10,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:02:10,376 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390135504] [2020-10-05 23:02:10,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:10,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:02:10,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035559258] [2020-10-05 23:02:10,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:02:10,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:10,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:02:10,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:02:10,377 INFO L87 Difference]: Start difference. First operand 7743 states and 35142 transitions. Second operand 9 states. [2020-10-05 23:02:11,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:11,269 INFO L93 Difference]: Finished difference Result 26955 states and 103085 transitions. [2020-10-05 23:02:11,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:11,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:02:11,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:11,336 INFO L225 Difference]: With dead ends: 26955 [2020-10-05 23:02:11,336 INFO L226 Difference]: Without dead ends: 26928 [2020-10-05 23:02:11,337 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:02:11,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26928 states. [2020-10-05 23:02:11,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26928 to 7532. [2020-10-05 23:02:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7532 states. [2020-10-05 23:02:11,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7532 states to 7532 states and 34256 transitions. [2020-10-05 23:02:11,857 INFO L78 Accepts]: Start accepts. Automaton has 7532 states and 34256 transitions. Word has length 25 [2020-10-05 23:02:11,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:11,857 INFO L479 AbstractCegarLoop]: Abstraction has 7532 states and 34256 transitions. [2020-10-05 23:02:11,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:02:11,857 INFO L276 IsEmpty]: Start isEmpty. Operand 7532 states and 34256 transitions. [2020-10-05 23:02:11,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:02:11,860 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:11,860 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:11,860 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2020-10-05 23:02:11,860 INFO L427 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]=== [2020-10-05 23:02:11,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:11,861 INFO L82 PathProgramCache]: Analyzing trace with hash -877241530, now seen corresponding path program 6 times [2020-10-05 23:02:11,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:11,861 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432326170] [2020-10-05 23:02:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:02:11,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432326170] [2020-10-05 23:02:11,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:11,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:02:11,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947808658] [2020-10-05 23:02:11,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:02:11,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:11,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:02:11,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:02:11,953 INFO L87 Difference]: Start difference. First operand 7532 states and 34256 transitions. Second operand 9 states. [2020-10-05 23:02:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:13,203 INFO L93 Difference]: Finished difference Result 26632 states and 101828 transitions. [2020-10-05 23:02:13,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:13,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:02:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:13,310 INFO L225 Difference]: With dead ends: 26632 [2020-10-05 23:02:13,310 INFO L226 Difference]: Without dead ends: 26605 [2020-10-05 23:02:13,311 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:02:13,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26605 states. [2020-10-05 23:02:13,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26605 to 7269. [2020-10-05 23:02:13,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7269 states. [2020-10-05 23:02:14,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7269 states to 7269 states and 33154 transitions. [2020-10-05 23:02:14,010 INFO L78 Accepts]: Start accepts. Automaton has 7269 states and 33154 transitions. Word has length 25 [2020-10-05 23:02:14,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:14,011 INFO L479 AbstractCegarLoop]: Abstraction has 7269 states and 33154 transitions. [2020-10-05 23:02:14,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:02:14,011 INFO L276 IsEmpty]: Start isEmpty. Operand 7269 states and 33154 transitions. [2020-10-05 23:02:14,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:02:14,014 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:14,015 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:14,015 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2020-10-05 23:02:14,015 INFO L427 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]=== [2020-10-05 23:02:14,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:14,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1311164244, now seen corresponding path program 1 times [2020-10-05 23:02:14,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:14,016 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012858809] [2020-10-05 23:02:14,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-05 23:02:14,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012858809] [2020-10-05 23:02:14,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:14,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:02:14,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894003116] [2020-10-05 23:02:14,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:02:14,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:14,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:02:14,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:02:14,062 INFO L87 Difference]: Start difference. First operand 7269 states and 33154 transitions. Second operand 5 states. [2020-10-05 23:02:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:14,240 INFO L93 Difference]: Finished difference Result 11919 states and 51979 transitions. [2020-10-05 23:02:14,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:02:14,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-10-05 23:02:14,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:14,288 INFO L225 Difference]: With dead ends: 11919 [2020-10-05 23:02:14,288 INFO L226 Difference]: Without dead ends: 11887 [2020-10-05 23:02:14,288 INFO L675 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 [2020-10-05 23:02:14,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2020-10-05 23:02:14,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 8560. [2020-10-05 23:02:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8560 states. [2020-10-05 23:02:14,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8560 states to 8560 states and 38495 transitions. [2020-10-05 23:02:14,617 INFO L78 Accepts]: Start accepts. Automaton has 8560 states and 38495 transitions. Word has length 25 [2020-10-05 23:02:14,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:14,617 INFO L479 AbstractCegarLoop]: Abstraction has 8560 states and 38495 transitions. [2020-10-05 23:02:14,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:02:14,617 INFO L276 IsEmpty]: Start isEmpty. Operand 8560 states and 38495 transitions. [2020-10-05 23:02:14,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-05 23:02:14,621 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:14,621 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:14,621 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2020-10-05 23:02:14,621 INFO L427 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]=== [2020-10-05 23:02:14,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:14,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1986416772, now seen corresponding path program 1 times [2020-10-05 23:02:14,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:14,622 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516386999] [2020-10-05 23:02:14,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:02:14,629 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:02:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:02:14,635 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:02:14,643 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:02:14,643 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:02:14,643 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2020-10-05 23:02:14,643 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:02:14,644 WARN L363 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:02:14,644 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2020-10-05 23:02:14,658 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,658 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,659 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,659 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,659 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,659 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,659 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,659 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,660 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,660 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,660 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,660 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,660 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,660 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,660 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,661 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,661 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,661 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,661 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,661 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,661 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,661 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,661 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,662 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,662 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,662 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,662 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,662 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,663 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,663 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,663 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,663 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,663 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,663 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,663 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,664 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,664 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,664 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,664 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,664 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,664 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,665 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,672 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,674 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,674 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,674 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,674 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,674 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,680 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,680 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,680 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,681 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,681 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,682 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,682 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,683 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,683 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,683 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,684 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,685 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,685 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,685 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,685 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,686 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,687 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,687 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,687 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,687 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,690 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,690 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,690 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,690 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,690 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,692 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,692 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,694 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,694 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,695 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,696 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,696 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,697 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,701 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,702 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,702 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,703 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,703 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,704 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,704 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,705 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,705 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:14,708 INFO L251 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-10-05 23:02:14,709 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:02:14,709 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:02:14,709 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 23:02:14,709 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:02:14,709 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:02:14,709 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:02:14,709 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:02:14,709 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:02:14,711 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 138 transitions, 396 flow [2020-10-05 23:02:14,711 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 156 places, 138 transitions, 396 flow [2020-10-05 23:02:14,740 INFO L129 PetriNetUnfolder]: 9/173 cut-off events. [2020-10-05 23:02:14,741 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-10-05 23:02:14,744 INFO L80 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 173 events. 9/173 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 284 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 208. Up to 14 conditions per place. [2020-10-05 23:02:14,751 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 156 places, 138 transitions, 396 flow [2020-10-05 23:02:14,772 INFO L129 PetriNetUnfolder]: 9/173 cut-off events. [2020-10-05 23:02:14,773 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-10-05 23:02:14,776 INFO L80 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 173 events. 9/173 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 284 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 208. Up to 14 conditions per place. [2020-10-05 23:02:14,783 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2832 [2020-10-05 23:02:14,783 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 23:02:16,873 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2020-10-05 23:02:17,202 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2020-10-05 23:02:17,353 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-10-05 23:02:17,371 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3678 [2020-10-05 23:02:17,372 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2020-10-05 23:02:17,372 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 45 transitions, 210 flow [2020-10-05 23:02:19,154 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2020-10-05 23:02:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2020-10-05 23:02:19,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:02:19,155 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:19,155 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:02:19,155 INFO L427 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]=== [2020-10-05 23:02:19,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:19,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1298891, now seen corresponding path program 1 times [2020-10-05 23:02:19,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:19,156 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061125426] [2020-10-05 23:02:19,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:19,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:02:19,169 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061125426] [2020-10-05 23:02:19,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:19,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:02:19,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839494667] [2020-10-05 23:02:19,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:02:19,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:19,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:02:19,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:02:19,170 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2020-10-05 23:02:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:19,324 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2020-10-05 23:02:19,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:02:19,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:02:19,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:19,387 INFO L225 Difference]: With dead ends: 17885 [2020-10-05 23:02:19,387 INFO L226 Difference]: Without dead ends: 16791 [2020-10-05 23:02:19,387 INFO L675 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 [2020-10-05 23:02:19,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2020-10-05 23:02:20,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16791. [2020-10-05 23:02:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16791 states. [2020-10-05 23:02:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16791 states to 16791 states and 86558 transitions. [2020-10-05 23:02:20,229 INFO L78 Accepts]: Start accepts. Automaton has 16791 states and 86558 transitions. Word has length 3 [2020-10-05 23:02:20,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:20,230 INFO L479 AbstractCegarLoop]: Abstraction has 16791 states and 86558 transitions. [2020-10-05 23:02:20,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:02:20,230 INFO L276 IsEmpty]: Start isEmpty. Operand 16791 states and 86558 transitions. [2020-10-05 23:02:20,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:02:20,230 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:20,230 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:20,230 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2020-10-05 23:02:20,230 INFO L427 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]=== [2020-10-05 23:02:20,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:20,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1091574945, now seen corresponding path program 1 times [2020-10-05 23:02:20,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:20,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119616909] [2020-10-05 23:02:20,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:20,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:02:20,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119616909] [2020-10-05 23:02:20,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:20,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:02:20,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244640981] [2020-10-05 23:02:20,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:02:20,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:20,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:02:20,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:02:20,262 INFO L87 Difference]: Start difference. First operand 16791 states and 86558 transitions. Second operand 5 states. [2020-10-05 23:02:20,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:20,542 INFO L93 Difference]: Finished difference Result 30985 states and 150574 transitions. [2020-10-05 23:02:20,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:02:20,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:02:20,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:20,648 INFO L225 Difference]: With dead ends: 30985 [2020-10-05 23:02:20,648 INFO L226 Difference]: Without dead ends: 30977 [2020-10-05 23:02:20,649 INFO L675 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 [2020-10-05 23:02:21,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30977 states. [2020-10-05 23:02:21,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30977 to 19868. [2020-10-05 23:02:21,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19868 states. [2020-10-05 23:02:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19868 states to 19868 states and 103363 transitions. [2020-10-05 23:02:21,746 INFO L78 Accepts]: Start accepts. Automaton has 19868 states and 103363 transitions. Word has length 9 [2020-10-05 23:02:21,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:21,746 INFO L479 AbstractCegarLoop]: Abstraction has 19868 states and 103363 transitions. [2020-10-05 23:02:21,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:02:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 19868 states and 103363 transitions. [2020-10-05 23:02:21,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:02:21,747 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:21,747 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:21,747 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2020-10-05 23:02:21,747 INFO L427 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]=== [2020-10-05 23:02:21,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:21,747 INFO L82 PathProgramCache]: Analyzing trace with hash -231509072, now seen corresponding path program 1 times [2020-10-05 23:02:21,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:21,748 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149563632] [2020-10-05 23:02:21,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:21,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:02:21,782 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149563632] [2020-10-05 23:02:21,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:21,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:02:21,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939591570] [2020-10-05 23:02:21,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:02:21,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:21,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:02:21,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:02:21,783 INFO L87 Difference]: Start difference. First operand 19868 states and 103363 transitions. Second operand 5 states. [2020-10-05 23:02:22,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:22,104 INFO L93 Difference]: Finished difference Result 36296 states and 178836 transitions. [2020-10-05 23:02:22,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:02:22,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:02:22,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:22,233 INFO L225 Difference]: With dead ends: 36296 [2020-10-05 23:02:22,233 INFO L226 Difference]: Without dead ends: 36280 [2020-10-05 23:02:22,233 INFO L675 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 [2020-10-05 23:02:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36280 states. [2020-10-05 23:02:25,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36280 to 23806. [2020-10-05 23:02:25,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23806 states. [2020-10-05 23:02:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23806 states to 23806 states and 125455 transitions. [2020-10-05 23:02:25,400 INFO L78 Accepts]: Start accepts. Automaton has 23806 states and 125455 transitions. Word has length 13 [2020-10-05 23:02:25,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:25,400 INFO L479 AbstractCegarLoop]: Abstraction has 23806 states and 125455 transitions. [2020-10-05 23:02:25,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:02:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 23806 states and 125455 transitions. [2020-10-05 23:02:25,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:02:25,401 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:25,401 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:25,401 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2020-10-05 23:02:25,401 INFO L427 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]=== [2020-10-05 23:02:25,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:25,401 INFO L82 PathProgramCache]: Analyzing trace with hash -588793474, now seen corresponding path program 1 times [2020-10-05 23:02:25,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:25,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370902077] [2020-10-05 23:02:25,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:02:25,451 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370902077] [2020-10-05 23:02:25,451 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608554571] [2020-10-05 23:02:25,451 INFO L95 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 [2020-10-05 23:02:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:25,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:02:25,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:02:25,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:25,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:02:25,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216240245] [2020-10-05 23:02:25,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:02:25,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:25,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:02:25,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:02:25,619 INFO L87 Difference]: Start difference. First operand 23806 states and 125455 transitions. Second operand 12 states. [2020-10-05 23:02:26,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:26,342 INFO L93 Difference]: Finished difference Result 56720 states and 262685 transitions. [2020-10-05 23:02:26,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:02:26,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-05 23:02:26,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:26,542 INFO L225 Difference]: With dead ends: 56720 [2020-10-05 23:02:26,542 INFO L226 Difference]: Without dead ends: 56704 [2020-10-05 23:02:26,543 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:02:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56704 states. [2020-10-05 23:02:27,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56704 to 23629. [2020-10-05 23:02:27,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23629 states. [2020-10-05 23:02:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23629 states to 23629 states and 124418 transitions. [2020-10-05 23:02:31,182 INFO L78 Accepts]: Start accepts. Automaton has 23629 states and 124418 transitions. Word has length 15 [2020-10-05 23:02:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:31,183 INFO L479 AbstractCegarLoop]: Abstraction has 23629 states and 124418 transitions. [2020-10-05 23:02:31,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:02:31,183 INFO L276 IsEmpty]: Start isEmpty. Operand 23629 states and 124418 transitions. [2020-10-05 23:02:31,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:02:31,183 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:31,184 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:31,392 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2020-10-05 23:02:31,393 INFO L427 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]=== [2020-10-05 23:02:31,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:31,394 INFO L82 PathProgramCache]: Analyzing trace with hash 858081470, now seen corresponding path program 2 times [2020-10-05 23:02:31,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:31,394 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563775988] [2020-10-05 23:02:31,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:31,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:02:31,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563775988] [2020-10-05 23:02:31,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:31,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:02:31,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879289197] [2020-10-05 23:02:31,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:02:31,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:31,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:02:31,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:02:31,443 INFO L87 Difference]: Start difference. First operand 23629 states and 124418 transitions. Second operand 7 states. [2020-10-05 23:02:32,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:32,117 INFO L93 Difference]: Finished difference Result 58078 states and 269185 transitions. [2020-10-05 23:02:32,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:02:32,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 23:02:32,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:32,316 INFO L225 Difference]: With dead ends: 58078 [2020-10-05 23:02:32,316 INFO L226 Difference]: Without dead ends: 58061 [2020-10-05 23:02:32,319 INFO L675 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 [2020-10-05 23:02:33,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58061 states. [2020-10-05 23:02:33,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58061 to 23109. [2020-10-05 23:02:33,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23109 states. [2020-10-05 23:02:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23109 states to 23109 states and 121651 transitions. [2020-10-05 23:02:33,859 INFO L78 Accepts]: Start accepts. Automaton has 23109 states and 121651 transitions. Word has length 15 [2020-10-05 23:02:33,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:33,859 INFO L479 AbstractCegarLoop]: Abstraction has 23109 states and 121651 transitions. [2020-10-05 23:02:33,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:02:33,859 INFO L276 IsEmpty]: Start isEmpty. Operand 23109 states and 121651 transitions. [2020-10-05 23:02:33,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:02:33,860 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:33,860 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:33,860 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2020-10-05 23:02:33,860 INFO L427 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]=== [2020-10-05 23:02:33,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:33,860 INFO L82 PathProgramCache]: Analyzing trace with hash 704376303, now seen corresponding path program 1 times [2020-10-05 23:02:33,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:33,861 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649273324] [2020-10-05 23:02:33,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:33,892 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:02:33,892 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649273324] [2020-10-05 23:02:33,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:33,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:02:33,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913784381] [2020-10-05 23:02:33,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:02:33,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:33,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:02:33,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:02:33,893 INFO L87 Difference]: Start difference. First operand 23109 states and 121651 transitions. Second operand 5 states. [2020-10-05 23:02:34,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:34,244 INFO L93 Difference]: Finished difference Result 41885 states and 209629 transitions. [2020-10-05 23:02:34,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:02:34,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:02:34,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:34,395 INFO L225 Difference]: With dead ends: 41885 [2020-10-05 23:02:34,395 INFO L226 Difference]: Without dead ends: 41856 [2020-10-05 23:02:34,396 INFO L675 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 [2020-10-05 23:02:35,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41856 states. [2020-10-05 23:02:36,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41856 to 28237. [2020-10-05 23:02:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28237 states. [2020-10-05 23:02:36,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28237 states to 28237 states and 150261 transitions. [2020-10-05 23:02:36,282 INFO L78 Accepts]: Start accepts. Automaton has 28237 states and 150261 transitions. Word has length 17 [2020-10-05 23:02:36,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:36,283 INFO L479 AbstractCegarLoop]: Abstraction has 28237 states and 150261 transitions. [2020-10-05 23:02:36,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:02:36,283 INFO L276 IsEmpty]: Start isEmpty. Operand 28237 states and 150261 transitions. [2020-10-05 23:02:36,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:02:36,284 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:36,284 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:36,284 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2020-10-05 23:02:36,284 INFO L427 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]=== [2020-10-05 23:02:36,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:36,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1918672061, now seen corresponding path program 1 times [2020-10-05 23:02:36,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:36,284 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073884863] [2020-10-05 23:02:36,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:02:36,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073884863] [2020-10-05 23:02:36,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022366323] [2020-10-05 23:02:36,334 INFO L95 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 [2020-10-05 23:02:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:36,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:02:36,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:02:36,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:36,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:02:36,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032071690] [2020-10-05 23:02:36,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:02:36,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:36,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:02:36,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:02:36,497 INFO L87 Difference]: Start difference. First operand 28237 states and 150261 transitions. Second operand 12 states. [2020-10-05 23:02:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:37,167 INFO L93 Difference]: Finished difference Result 66831 states and 314874 transitions. [2020-10-05 23:02:37,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:02:37,167 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:02:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:37,392 INFO L225 Difference]: With dead ends: 66831 [2020-10-05 23:02:37,392 INFO L226 Difference]: Without dead ends: 66807 [2020-10-05 23:02:37,392 INFO L675 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 [2020-10-05 23:02:38,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66807 states. [2020-10-05 23:02:39,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66807 to 28673. [2020-10-05 23:02:39,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28673 states. [2020-10-05 23:02:39,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28673 states to 28673 states and 152375 transitions. [2020-10-05 23:02:39,192 INFO L78 Accepts]: Start accepts. Automaton has 28673 states and 152375 transitions. Word has length 19 [2020-10-05 23:02:39,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:39,192 INFO L479 AbstractCegarLoop]: Abstraction has 28673 states and 152375 transitions. [2020-10-05 23:02:39,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:02:39,192 INFO L276 IsEmpty]: Start isEmpty. Operand 28673 states and 152375 transitions. [2020-10-05 23:02:39,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:02:39,195 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:39,195 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:39,408 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2020-10-05 23:02:39,409 INFO L427 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]=== [2020-10-05 23:02:39,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:39,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1064014108, now seen corresponding path program 1 times [2020-10-05 23:02:39,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:39,410 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423336543] [2020-10-05 23:02:39,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:39,455 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:02:39,455 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423336543] [2020-10-05 23:02:39,455 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563551943] [2020-10-05 23:02:39,455 INFO L95 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 [2020-10-05 23:02:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:39,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:02:39,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:39,602 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:02:39,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:39,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:02:39,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157195731] [2020-10-05 23:02:39,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:02:39,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:39,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:02:39,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:02:39,603 INFO L87 Difference]: Start difference. First operand 28673 states and 152375 transitions. Second operand 12 states. [2020-10-05 23:02:40,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:40,760 INFO L93 Difference]: Finished difference Result 69484 states and 328264 transitions. [2020-10-05 23:02:40,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:02:40,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:02:40,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:40,984 INFO L225 Difference]: With dead ends: 69484 [2020-10-05 23:02:40,984 INFO L226 Difference]: Without dead ends: 69451 [2020-10-05 23:02:40,984 INFO L675 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 [2020-10-05 23:02:41,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69451 states. [2020-10-05 23:02:42,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69451 to 28873. [2020-10-05 23:02:42,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28873 states. [2020-10-05 23:02:42,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28873 states to 28873 states and 153454 transitions. [2020-10-05 23:02:42,737 INFO L78 Accepts]: Start accepts. Automaton has 28873 states and 153454 transitions. Word has length 19 [2020-10-05 23:02:42,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:42,737 INFO L479 AbstractCegarLoop]: Abstraction has 28873 states and 153454 transitions. [2020-10-05 23:02:42,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:02:42,737 INFO L276 IsEmpty]: Start isEmpty. Operand 28873 states and 153454 transitions. [2020-10-05 23:02:42,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:02:42,738 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:42,738 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:42,938 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:02:42,939 INFO L427 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]=== [2020-10-05 23:02:42,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:42,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1699177508, now seen corresponding path program 2 times [2020-10-05 23:02:42,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:42,940 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889310826] [2020-10-05 23:02:42,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:02:42,986 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889310826] [2020-10-05 23:02:42,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:42,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:02:42,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518793978] [2020-10-05 23:02:42,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:02:42,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:42,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:02:42,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:02:42,988 INFO L87 Difference]: Start difference. First operand 28873 states and 153454 transitions. Second operand 7 states. [2020-10-05 23:02:43,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:43,666 INFO L93 Difference]: Finished difference Result 70510 states and 333491 transitions. [2020-10-05 23:02:43,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:02:43,667 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:02:43,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:43,900 INFO L225 Difference]: With dead ends: 70510 [2020-10-05 23:02:43,901 INFO L226 Difference]: Without dead ends: 70477 [2020-10-05 23:02:43,901 INFO L675 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 [2020-10-05 23:02:45,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70477 states. [2020-10-05 23:02:46,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70477 to 28942. [2020-10-05 23:02:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28942 states. [2020-10-05 23:02:46,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28942 states to 28942 states and 153921 transitions. [2020-10-05 23:02:46,122 INFO L78 Accepts]: Start accepts. Automaton has 28942 states and 153921 transitions. Word has length 19 [2020-10-05 23:02:46,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:46,123 INFO L479 AbstractCegarLoop]: Abstraction has 28942 states and 153921 transitions. [2020-10-05 23:02:46,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:02:46,123 INFO L276 IsEmpty]: Start isEmpty. Operand 28942 states and 153921 transitions. [2020-10-05 23:02:46,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:02:46,123 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:46,124 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:46,124 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2020-10-05 23:02:46,124 INFO L427 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]=== [2020-10-05 23:02:46,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:46,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1699205315, now seen corresponding path program 2 times [2020-10-05 23:02:46,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:46,125 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587712583] [2020-10-05 23:02:46,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:46,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:02:46,169 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587712583] [2020-10-05 23:02:46,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:46,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:02:46,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894639730] [2020-10-05 23:02:46,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:02:46,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:46,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:02:46,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:02:46,170 INFO L87 Difference]: Start difference. First operand 28942 states and 153921 transitions. Second operand 7 states. [2020-10-05 23:02:46,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:46,841 INFO L93 Difference]: Finished difference Result 70096 states and 331298 transitions. [2020-10-05 23:02:46,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:02:46,842 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:02:46,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:47,077 INFO L225 Difference]: With dead ends: 70096 [2020-10-05 23:02:47,077 INFO L226 Difference]: Without dead ends: 70063 [2020-10-05 23:02:47,077 INFO L675 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 [2020-10-05 23:02:47,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70063 states. [2020-10-05 23:02:48,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70063 to 29094. [2020-10-05 23:02:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29094 states. [2020-10-05 23:02:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29094 states to 29094 states and 154883 transitions. [2020-10-05 23:02:49,566 INFO L78 Accepts]: Start accepts. Automaton has 29094 states and 154883 transitions. Word has length 19 [2020-10-05 23:02:49,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:49,566 INFO L479 AbstractCegarLoop]: Abstraction has 29094 states and 154883 transitions. [2020-10-05 23:02:49,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:02:49,566 INFO L276 IsEmpty]: Start isEmpty. Operand 29094 states and 154883 transitions. [2020-10-05 23:02:49,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:02:49,567 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:49,567 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:49,567 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2020-10-05 23:02:49,567 INFO L427 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]=== [2020-10-05 23:02:49,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:49,568 INFO L82 PathProgramCache]: Analyzing trace with hash -228866966, now seen corresponding path program 1 times [2020-10-05 23:02:49,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:49,568 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252000213] [2020-10-05 23:02:49,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:02:49,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252000213] [2020-10-05 23:02:49,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057450328] [2020-10-05 23:02:49,635 INFO L95 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 [2020-10-05 23:02:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:49,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:02:49,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:49,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:02:49,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:49,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:02:49,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555502448] [2020-10-05 23:02:49,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:02:49,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:49,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:02:49,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:02:49,826 INFO L87 Difference]: Start difference. First operand 29094 states and 154883 transitions. Second operand 16 states. [2020-10-05 23:02:51,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:51,301 INFO L93 Difference]: Finished difference Result 100731 states and 448596 transitions. [2020-10-05 23:02:51,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:51,302 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:02:51,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:51,617 INFO L225 Difference]: With dead ends: 100731 [2020-10-05 23:02:51,617 INFO L226 Difference]: Without dead ends: 100715 [2020-10-05 23:02:51,618 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:02:52,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100715 states. [2020-10-05 23:02:54,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100715 to 28719. [2020-10-05 23:02:54,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28719 states. [2020-10-05 23:02:54,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28719 states to 28719 states and 152760 transitions. [2020-10-05 23:02:54,530 INFO L78 Accepts]: Start accepts. Automaton has 28719 states and 152760 transitions. Word has length 21 [2020-10-05 23:02:54,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:54,530 INFO L479 AbstractCegarLoop]: Abstraction has 28719 states and 152760 transitions. [2020-10-05 23:02:54,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:02:54,530 INFO L276 IsEmpty]: Start isEmpty. Operand 28719 states and 152760 transitions. [2020-10-05 23:02:54,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:02:54,531 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:54,531 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:54,732 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable85 [2020-10-05 23:02:54,732 INFO L427 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]=== [2020-10-05 23:02:54,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:54,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1302908714, now seen corresponding path program 2 times [2020-10-05 23:02:54,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:54,733 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096462422] [2020-10-05 23:02:54,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:02:54,805 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096462422] [2020-10-05 23:02:54,805 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85255581] [2020-10-05 23:02:54,806 INFO L93 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 [2020-10-05 23:02:54,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:02:54,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:02:54,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:02:54,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:02:54,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:54,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:02:54,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001318991] [2020-10-05 23:02:54,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:02:54,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:54,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:02:54,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:02:54,997 INFO L87 Difference]: Start difference. First operand 28719 states and 152760 transitions. Second operand 16 states. [2020-10-05 23:02:56,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:56,546 INFO L93 Difference]: Finished difference Result 99876 states and 444348 transitions. [2020-10-05 23:02:56,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:56,546 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:02:56,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:56,868 INFO L225 Difference]: With dead ends: 99876 [2020-10-05 23:02:56,868 INFO L226 Difference]: Without dead ends: 99855 [2020-10-05 23:02:56,868 INFO L675 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 [2020-10-05 23:02:57,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99855 states. [2020-10-05 23:02:59,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99855 to 28343. [2020-10-05 23:02:59,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28343 states. [2020-10-05 23:02:59,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28343 states to 28343 states and 150639 transitions. [2020-10-05 23:02:59,599 INFO L78 Accepts]: Start accepts. Automaton has 28343 states and 150639 transitions. Word has length 21 [2020-10-05 23:02:59,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:59,599 INFO L479 AbstractCegarLoop]: Abstraction has 28343 states and 150639 transitions. [2020-10-05 23:02:59,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:02:59,599 INFO L276 IsEmpty]: Start isEmpty. Operand 28343 states and 150639 transitions. [2020-10-05 23:02:59,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:02:59,600 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:59,600 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:59,801 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:02:59,801 INFO L427 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]=== [2020-10-05 23:02:59,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:59,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1149181014, now seen corresponding path program 3 times [2020-10-05 23:02:59,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:59,802 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106040160] [2020-10-05 23:02:59,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:59,864 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:02:59,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106040160] [2020-10-05 23:02:59,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579784515] [2020-10-05 23:02:59,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:02:59,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:02:59,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:02:59,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:02:59,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:03:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:03:00,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:03:00,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:03:00,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623476409] [2020-10-05 23:03:00,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:03:00,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:00,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:03:00,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:03:00,055 INFO L87 Difference]: Start difference. First operand 28343 states and 150639 transitions. Second operand 16 states. [2020-10-05 23:03:01,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:01,525 INFO L93 Difference]: Finished difference Result 100071 states and 445291 transitions. [2020-10-05 23:03:01,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:03:01,525 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:03:01,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:01,811 INFO L225 Difference]: With dead ends: 100071 [2020-10-05 23:03:01,811 INFO L226 Difference]: Without dead ends: 100055 [2020-10-05 23:03:01,811 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:03:03,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100055 states. [2020-10-05 23:03:04,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100055 to 27654. [2020-10-05 23:03:04,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27654 states. [2020-10-05 23:03:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27654 states to 27654 states and 147080 transitions. [2020-10-05 23:03:04,468 INFO L78 Accepts]: Start accepts. Automaton has 27654 states and 147080 transitions. Word has length 21 [2020-10-05 23:03:04,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:04,468 INFO L479 AbstractCegarLoop]: Abstraction has 27654 states and 147080 transitions. [2020-10-05 23:03:04,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:03:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 27654 states and 147080 transitions. [2020-10-05 23:03:04,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:03:04,469 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:04,469 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:04,677 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2020-10-05 23:03:04,678 INFO L427 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]=== [2020-10-05 23:03:04,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:04,678 INFO L82 PathProgramCache]: Analyzing trace with hash 315341610, now seen corresponding path program 4 times [2020-10-05 23:03:04,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:04,679 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648761616] [2020-10-05 23:03:04,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:04,742 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:03:04,743 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648761616] [2020-10-05 23:03:04,743 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691323204] [2020-10-05 23:03:04,743 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:03:04,825 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:03:04,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:03:04,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:03:04,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:03:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:03:04,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:03:04,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:03:04,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65482256] [2020-10-05 23:03:04,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:03:04,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:04,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:03:04,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:03:04,933 INFO L87 Difference]: Start difference. First operand 27654 states and 147080 transitions. Second operand 16 states. [2020-10-05 23:03:06,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:06,259 INFO L93 Difference]: Finished difference Result 99523 states and 442763 transitions. [2020-10-05 23:03:06,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:03:06,260 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:03:06,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:07,189 INFO L225 Difference]: With dead ends: 99523 [2020-10-05 23:03:07,189 INFO L226 Difference]: Without dead ends: 99502 [2020-10-05 23:03:07,189 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:03:08,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99502 states. [2020-10-05 23:03:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99502 to 27278. [2020-10-05 23:03:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27278 states. [2020-10-05 23:03:09,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27278 states to 27278 states and 144959 transitions. [2020-10-05 23:03:09,219 INFO L78 Accepts]: Start accepts. Automaton has 27278 states and 144959 transitions. Word has length 21 [2020-10-05 23:03:09,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:09,219 INFO L479 AbstractCegarLoop]: Abstraction has 27278 states and 144959 transitions. [2020-10-05 23:03:09,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:03:09,219 INFO L276 IsEmpty]: Start isEmpty. Operand 27278 states and 144959 transitions. [2020-10-05 23:03:09,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:03:09,220 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:09,220 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:09,420 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2020-10-05 23:03:09,421 INFO L427 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]=== [2020-10-05 23:03:09,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:09,422 INFO L82 PathProgramCache]: Analyzing trace with hash -822012438, now seen corresponding path program 5 times [2020-10-05 23:03:09,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:09,422 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138569725] [2020-10-05 23:03:09,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:03:09,488 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138569725] [2020-10-05 23:03:09,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:03:09,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:03:09,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723103166] [2020-10-05 23:03:09,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:03:09,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:09,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:03:09,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:03:09,490 INFO L87 Difference]: Start difference. First operand 27278 states and 144959 transitions. Second operand 9 states. [2020-10-05 23:03:11,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:11,355 INFO L93 Difference]: Finished difference Result 99710 states and 443686 transitions. [2020-10-05 23:03:11,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:03:11,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:03:11,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:11,689 INFO L225 Difference]: With dead ends: 99710 [2020-10-05 23:03:11,689 INFO L226 Difference]: Without dead ends: 99694 [2020-10-05 23:03:11,690 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:03:12,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99694 states. [2020-10-05 23:03:13,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99694 to 26597. [2020-10-05 23:03:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26597 states. [2020-10-05 23:03:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26597 states to 26597 states and 141420 transitions. [2020-10-05 23:03:13,903 INFO L78 Accepts]: Start accepts. Automaton has 26597 states and 141420 transitions. Word has length 21 [2020-10-05 23:03:13,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:13,903 INFO L479 AbstractCegarLoop]: Abstraction has 26597 states and 141420 transitions. [2020-10-05 23:03:13,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:03:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 26597 states and 141420 transitions. [2020-10-05 23:03:13,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:03:13,904 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:13,904 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:13,904 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2020-10-05 23:03:13,904 INFO L427 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]=== [2020-10-05 23:03:13,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:13,904 INFO L82 PathProgramCache]: Analyzing trace with hash -848707158, now seen corresponding path program 6 times [2020-10-05 23:03:13,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:13,905 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306733820] [2020-10-05 23:03:13,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:15,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:03:15,650 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306733820] [2020-10-05 23:03:15,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:03:15,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:03:15,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652858679] [2020-10-05 23:03:15,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:03:15,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:15,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:03:15,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:03:15,651 INFO L87 Difference]: Start difference. First operand 26597 states and 141420 transitions. Second operand 9 states. [2020-10-05 23:03:16,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:16,977 INFO L93 Difference]: Finished difference Result 98863 states and 439458 transitions. [2020-10-05 23:03:16,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:03:16,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:03:16,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:17,278 INFO L225 Difference]: With dead ends: 98863 [2020-10-05 23:03:17,278 INFO L226 Difference]: Without dead ends: 98841 [2020-10-05 23:03:17,278 INFO L675 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 [2020-10-05 23:03:18,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98841 states. [2020-10-05 23:03:19,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98841 to 25744. [2020-10-05 23:03:19,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25744 states. [2020-10-05 23:03:19,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25744 states to 25744 states and 137181 transitions. [2020-10-05 23:03:19,800 INFO L78 Accepts]: Start accepts. Automaton has 25744 states and 137181 transitions. Word has length 21 [2020-10-05 23:03:19,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:19,800 INFO L479 AbstractCegarLoop]: Abstraction has 25744 states and 137181 transitions. [2020-10-05 23:03:19,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:03:19,800 INFO L276 IsEmpty]: Start isEmpty. Operand 25744 states and 137181 transitions. [2020-10-05 23:03:19,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:03:19,801 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:19,801 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:19,802 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2020-10-05 23:03:19,802 INFO L427 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]=== [2020-10-05 23:03:19,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:19,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1818695965, now seen corresponding path program 1 times [2020-10-05 23:03:19,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:19,803 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349984252] [2020-10-05 23:03:19,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:19,830 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:03:19,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349984252] [2020-10-05 23:03:19,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:03:19,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:03:19,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181962680] [2020-10-05 23:03:19,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:03:19,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:19,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:03:19,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:03:19,831 INFO L87 Difference]: Start difference. First operand 25744 states and 137181 transitions. Second operand 5 states. [2020-10-05 23:03:20,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:20,179 INFO L93 Difference]: Finished difference Result 46463 states and 236107 transitions. [2020-10-05 23:03:20,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:03:20,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-05 23:03:20,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:20,337 INFO L225 Difference]: With dead ends: 46463 [2020-10-05 23:03:20,337 INFO L226 Difference]: Without dead ends: 46417 [2020-10-05 23:03:20,337 INFO L675 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 [2020-10-05 23:03:20,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46417 states. [2020-10-05 23:03:21,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46417 to 31960. [2020-10-05 23:03:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31960 states. [2020-10-05 23:03:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31960 states to 31960 states and 171209 transitions. [2020-10-05 23:03:21,832 INFO L78 Accepts]: Start accepts. Automaton has 31960 states and 171209 transitions. Word has length 21 [2020-10-05 23:03:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:21,832 INFO L479 AbstractCegarLoop]: Abstraction has 31960 states and 171209 transitions. [2020-10-05 23:03:21,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:03:21,833 INFO L276 IsEmpty]: Start isEmpty. Operand 31960 states and 171209 transitions. [2020-10-05 23:03:21,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:03:21,834 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:21,834 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:21,834 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2020-10-05 23:03:21,834 INFO L427 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]=== [2020-10-05 23:03:21,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:21,835 INFO L82 PathProgramCache]: Analyzing trace with hash 605532395, now seen corresponding path program 1 times [2020-10-05 23:03:21,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:21,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197413063] [2020-10-05 23:03:21,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:03:21,883 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197413063] [2020-10-05 23:03:21,883 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406011007] [2020-10-05 23:03:21,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:03:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:21,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:03:21,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:03:22,040 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:03:22,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:03:22,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:03:22,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773722093] [2020-10-05 23:03:22,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:03:22,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:22,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:03:22,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:03:22,042 INFO L87 Difference]: Start difference. First operand 31960 states and 171209 transitions. Second operand 12 states. [2020-10-05 23:03:23,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:23,256 INFO L93 Difference]: Finished difference Result 75380 states and 361389 transitions. [2020-10-05 23:03:23,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:03:23,257 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:03:23,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:23,561 INFO L225 Difference]: With dead ends: 75380 [2020-10-05 23:03:23,561 INFO L226 Difference]: Without dead ends: 75344 [2020-10-05 23:03:23,562 INFO L675 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 [2020-10-05 23:03:24,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75344 states. [2020-10-05 23:03:25,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75344 to 32974. [2020-10-05 23:03:25,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32974 states. [2020-10-05 23:03:25,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32974 states to 32974 states and 176363 transitions. [2020-10-05 23:03:25,455 INFO L78 Accepts]: Start accepts. Automaton has 32974 states and 176363 transitions. Word has length 23 [2020-10-05 23:03:25,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:25,455 INFO L479 AbstractCegarLoop]: Abstraction has 32974 states and 176363 transitions. [2020-10-05 23:03:25,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:03:25,455 INFO L276 IsEmpty]: Start isEmpty. Operand 32974 states and 176363 transitions. [2020-10-05 23:03:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:03:25,457 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:25,457 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:25,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:03:25,664 INFO L427 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]=== [2020-10-05 23:03:25,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:25,664 INFO L82 PathProgramCache]: Analyzing trace with hash 768040394, now seen corresponding path program 1 times [2020-10-05 23:03:25,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:25,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118103199] [2020-10-05 23:03:25,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:25,709 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:03:25,709 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118103199] [2020-10-05 23:03:25,710 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638774998] [2020-10-05 23:03:25,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-05 23:03:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:25,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:03:25,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:03:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:03:25,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:03:25,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:03:25,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001208386] [2020-10-05 23:03:25,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:03:25,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:25,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:03:25,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:03:25,861 INFO L87 Difference]: Start difference. First operand 32974 states and 176363 transitions. Second operand 12 states. [2020-10-05 23:03:26,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:26,931 INFO L93 Difference]: Finished difference Result 79487 states and 381757 transitions. [2020-10-05 23:03:26,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:03:26,932 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:03:26,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:27,168 INFO L225 Difference]: With dead ends: 79487 [2020-10-05 23:03:27,168 INFO L226 Difference]: Without dead ends: 79445 [2020-10-05 23:03:27,168 INFO L675 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 [2020-10-05 23:03:28,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79445 states. [2020-10-05 23:03:28,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79445 to 33981. [2020-10-05 23:03:28,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33981 states. [2020-10-05 23:03:29,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33981 states to 33981 states and 181710 transitions. [2020-10-05 23:03:29,064 INFO L78 Accepts]: Start accepts. Automaton has 33981 states and 181710 transitions. Word has length 23 [2020-10-05 23:03:29,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:29,065 INFO L479 AbstractCegarLoop]: Abstraction has 33981 states and 181710 transitions. [2020-10-05 23:03:29,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:03:29,065 INFO L276 IsEmpty]: Start isEmpty. Operand 33981 states and 181710 transitions. [2020-10-05 23:03:29,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:03:29,067 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:29,067 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:29,267 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:03:29,268 INFO L427 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]=== [2020-10-05 23:03:29,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:29,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1041867770, now seen corresponding path program 1 times [2020-10-05 23:03:29,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:29,269 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412664292] [2020-10-05 23:03:29,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:03:29,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412664292] [2020-10-05 23:03:29,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007777583] [2020-10-05 23:03:29,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:03:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:29,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:03:29,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:03:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:03:29,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:03:29,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:03:29,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446090583] [2020-10-05 23:03:29,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:03:29,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:29,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:03:29,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:03:29,457 INFO L87 Difference]: Start difference. First operand 33981 states and 181710 transitions. Second operand 12 states. [2020-10-05 23:03:30,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:30,602 INFO L93 Difference]: Finished difference Result 82728 states and 398553 transitions. [2020-10-05 23:03:30,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:03:30,603 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:03:30,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:30,861 INFO L225 Difference]: With dead ends: 82728 [2020-10-05 23:03:30,861 INFO L226 Difference]: Without dead ends: 82673 [2020-10-05 23:03:30,861 INFO L675 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 [2020-10-05 23:03:31,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82673 states. [2020-10-05 23:03:32,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82673 to 34821. [2020-10-05 23:03:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34821 states. [2020-10-05 23:03:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34821 states to 34821 states and 186422 transitions. [2020-10-05 23:03:32,866 INFO L78 Accepts]: Start accepts. Automaton has 34821 states and 186422 transitions. Word has length 23 [2020-10-05 23:03:32,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:32,867 INFO L479 AbstractCegarLoop]: Abstraction has 34821 states and 186422 transitions. [2020-10-05 23:03:32,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:03:32,867 INFO L276 IsEmpty]: Start isEmpty. Operand 34821 states and 186422 transitions. [2020-10-05 23:03:32,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:03:32,869 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:32,869 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:33,069 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:03:33,070 INFO L427 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]=== [2020-10-05 23:03:33,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:33,071 INFO L82 PathProgramCache]: Analyzing trace with hash -284839030, now seen corresponding path program 2 times [2020-10-05 23:03:33,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:33,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837548478] [2020-10-05 23:03:33,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:33,118 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:03:33,118 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837548478] [2020-10-05 23:03:33,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:03:33,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:03:33,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480429415] [2020-10-05 23:03:33,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:03:33,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:33,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:03:33,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:03:33,120 INFO L87 Difference]: Start difference. First operand 34821 states and 186422 transitions. Second operand 7 states. [2020-10-05 23:03:34,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:34,352 INFO L93 Difference]: Finished difference Result 83507 states and 402693 transitions. [2020-10-05 23:03:34,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:03:34,353 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:03:34,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:34,620 INFO L225 Difference]: With dead ends: 83507 [2020-10-05 23:03:34,621 INFO L226 Difference]: Without dead ends: 83452 [2020-10-05 23:03:34,621 INFO L675 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 [2020-10-05 23:03:35,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83452 states. [2020-10-05 23:03:36,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83452 to 35694. [2020-10-05 23:03:36,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35694 states. [2020-10-05 23:03:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35694 states to 35694 states and 191145 transitions. [2020-10-05 23:03:36,594 INFO L78 Accepts]: Start accepts. Automaton has 35694 states and 191145 transitions. Word has length 23 [2020-10-05 23:03:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:36,594 INFO L479 AbstractCegarLoop]: Abstraction has 35694 states and 191145 transitions. [2020-10-05 23:03:36,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:03:36,594 INFO L276 IsEmpty]: Start isEmpty. Operand 35694 states and 191145 transitions. [2020-10-05 23:03:36,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:03:36,596 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:36,596 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:36,596 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2020-10-05 23:03:36,596 INFO L427 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]=== [2020-10-05 23:03:36,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:36,596 INFO L82 PathProgramCache]: Analyzing trace with hash -284850438, now seen corresponding path program 2 times [2020-10-05 23:03:36,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:36,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74773946] [2020-10-05 23:03:36,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:03:36,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74773946] [2020-10-05 23:03:36,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:03:36,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:03:36,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450089861] [2020-10-05 23:03:36,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:03:36,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:36,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:03:36,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:03:36,641 INFO L87 Difference]: Start difference. First operand 35694 states and 191145 transitions. Second operand 7 states. [2020-10-05 23:03:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:37,417 INFO L93 Difference]: Finished difference Result 83523 states and 402462 transitions. [2020-10-05 23:03:37,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:03:37,418 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:03:37,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:38,358 INFO L225 Difference]: With dead ends: 83523 [2020-10-05 23:03:38,359 INFO L226 Difference]: Without dead ends: 83468 [2020-10-05 23:03:38,359 INFO L675 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 [2020-10-05 23:03:39,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83468 states. [2020-10-05 23:03:40,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83468 to 36306. [2020-10-05 23:03:40,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36306 states. [2020-10-05 23:03:40,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36306 states to 36306 states and 194552 transitions. [2020-10-05 23:03:40,295 INFO L78 Accepts]: Start accepts. Automaton has 36306 states and 194552 transitions. Word has length 23 [2020-10-05 23:03:40,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:40,295 INFO L479 AbstractCegarLoop]: Abstraction has 36306 states and 194552 transitions. [2020-10-05 23:03:40,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:03:40,296 INFO L276 IsEmpty]: Start isEmpty. Operand 36306 states and 194552 transitions. [2020-10-05 23:03:40,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:03:40,298 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:40,298 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:40,298 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2020-10-05 23:03:40,298 INFO L427 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]=== [2020-10-05 23:03:40,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:40,298 INFO L82 PathProgramCache]: Analyzing trace with hash -284866837, now seen corresponding path program 2 times [2020-10-05 23:03:40,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:40,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118202247] [2020-10-05 23:03:40,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:03:40,339 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118202247] [2020-10-05 23:03:40,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:03:40,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:03:40,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844789627] [2020-10-05 23:03:40,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:03:40,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:40,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:03:40,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:03:40,340 INFO L87 Difference]: Start difference. First operand 36306 states and 194552 transitions. Second operand 7 states. [2020-10-05 23:03:41,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:41,125 INFO L93 Difference]: Finished difference Result 83918 states and 404136 transitions. [2020-10-05 23:03:41,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:03:41,126 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:03:41,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:41,469 INFO L225 Difference]: With dead ends: 83918 [2020-10-05 23:03:41,470 INFO L226 Difference]: Without dead ends: 83863 [2020-10-05 23:03:41,479 INFO L675 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 [2020-10-05 23:03:43,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83863 states. [2020-10-05 23:03:43,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83863 to 37062. [2020-10-05 23:03:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37062 states. [2020-10-05 23:03:44,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37062 states to 37062 states and 198528 transitions. [2020-10-05 23:03:44,034 INFO L78 Accepts]: Start accepts. Automaton has 37062 states and 198528 transitions. Word has length 23 [2020-10-05 23:03:44,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:44,034 INFO L479 AbstractCegarLoop]: Abstraction has 37062 states and 198528 transitions. [2020-10-05 23:03:44,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:03:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 37062 states and 198528 transitions. [2020-10-05 23:03:44,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:03:44,037 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:44,037 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:44,037 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2020-10-05 23:03:44,037 INFO L427 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]=== [2020-10-05 23:03:44,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:44,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1146013160, now seen corresponding path program 1 times [2020-10-05 23:03:44,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:44,038 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766838221] [2020-10-05 23:03:44,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:03:44,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766838221] [2020-10-05 23:03:44,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532290813] [2020-10-05 23:03:44,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-05 23:03:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:44,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:03:44,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:03:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:03:44,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:03:44,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:03:44,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23206585] [2020-10-05 23:03:44,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:03:44,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:44,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:03:44,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:03:44,291 INFO L87 Difference]: Start difference. First operand 37062 states and 198528 transitions. Second operand 16 states. [2020-10-05 23:03:45,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:45,947 INFO L93 Difference]: Finished difference Result 122892 states and 561130 transitions. [2020-10-05 23:03:45,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:03:45,948 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:03:45,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:47,039 INFO L225 Difference]: With dead ends: 122892 [2020-10-05 23:03:47,039 INFO L226 Difference]: Without dead ends: 122862 [2020-10-05 23:03:47,039 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:03:48,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122862 states. [2020-10-05 23:03:49,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122862 to 36727. [2020-10-05 23:03:49,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36727 states. [2020-10-05 23:03:49,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36727 states to 36727 states and 196466 transitions. [2020-10-05 23:03:49,434 INFO L78 Accepts]: Start accepts. Automaton has 36727 states and 196466 transitions. Word has length 25 [2020-10-05 23:03:49,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:49,435 INFO L479 AbstractCegarLoop]: Abstraction has 36727 states and 196466 transitions. [2020-10-05 23:03:49,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:03:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 36727 states and 196466 transitions. [2020-10-05 23:03:49,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:03:49,437 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:49,438 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:49,638 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2020-10-05 23:03:49,638 INFO L427 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]=== [2020-10-05 23:03:49,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:49,639 INFO L82 PathProgramCache]: Analyzing trace with hash -872185784, now seen corresponding path program 1 times [2020-10-05 23:03:49,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:49,640 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230174122] [2020-10-05 23:03:49,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:03:49,700 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230174122] [2020-10-05 23:03:49,700 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969752928] [2020-10-05 23:03:49,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-05 23:03:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:49,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:03:49,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:03:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:03:49,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:03:49,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:03:49,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028487794] [2020-10-05 23:03:49,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:03:49,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:49,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:03:49,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:03:49,882 INFO L87 Difference]: Start difference. First operand 36727 states and 196466 transitions. Second operand 16 states. [2020-10-05 23:03:51,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:51,791 INFO L93 Difference]: Finished difference Result 121590 states and 554657 transitions. [2020-10-05 23:03:51,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:03:51,792 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:03:51,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:52,139 INFO L225 Difference]: With dead ends: 121590 [2020-10-05 23:03:52,139 INFO L226 Difference]: Without dead ends: 121560 [2020-10-05 23:03:52,140 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:03:53,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121560 states. [2020-10-05 23:03:57,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121560 to 36513. [2020-10-05 23:03:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36513 states. [2020-10-05 23:03:57,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36513 states to 36513 states and 195090 transitions. [2020-10-05 23:03:57,559 INFO L78 Accepts]: Start accepts. Automaton has 36513 states and 195090 transitions. Word has length 25 [2020-10-05 23:03:57,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:57,559 INFO L479 AbstractCegarLoop]: Abstraction has 36513 states and 195090 transitions. [2020-10-05 23:03:57,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:03:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 36513 states and 195090 transitions. [2020-10-05 23:03:57,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:03:57,563 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:57,563 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:57,770 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:03:57,771 INFO L427 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]=== [2020-10-05 23:03:57,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:57,771 INFO L82 PathProgramCache]: Analyzing trace with hash 2096074712, now seen corresponding path program 2 times [2020-10-05 23:03:57,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:57,772 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186880239] [2020-10-05 23:03:57,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:03:57,834 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186880239] [2020-10-05 23:03:57,834 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049265808] [2020-10-05 23:03:57,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-10-05 23:03:57,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:03:57,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:03:57,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:03:57,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:03:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:03:58,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:03:58,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:03:58,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502852827] [2020-10-05 23:03:58,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:03:58,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:58,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:03:58,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:03:58,016 INFO L87 Difference]: Start difference. First operand 36513 states and 195090 transitions. Second operand 16 states. [2020-10-05 23:03:59,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:59,452 INFO L93 Difference]: Finished difference Result 120395 states and 548664 transitions. [2020-10-05 23:03:59,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:03:59,453 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:03:59,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:59,788 INFO L225 Difference]: With dead ends: 120395 [2020-10-05 23:03:59,788 INFO L226 Difference]: Without dead ends: 120362 [2020-10-05 23:03:59,789 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:04:01,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120362 states. [2020-10-05 23:04:02,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120362 to 36444. [2020-10-05 23:04:02,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36444 states. [2020-10-05 23:04:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36444 states to 36444 states and 194571 transitions. [2020-10-05 23:04:02,936 INFO L78 Accepts]: Start accepts. Automaton has 36444 states and 194571 transitions. Word has length 25 [2020-10-05 23:04:02,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:04:02,936 INFO L479 AbstractCegarLoop]: Abstraction has 36444 states and 194571 transitions. [2020-10-05 23:04:02,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:04:02,936 INFO L276 IsEmpty]: Start isEmpty. Operand 36444 states and 194571 transitions. [2020-10-05 23:04:02,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:04:02,938 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:04:02,938 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:04:03,139 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2020-10-05 23:04:03,139 INFO L427 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]=== [2020-10-05 23:04:03,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:04:03,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2096063304, now seen corresponding path program 2 times [2020-10-05 23:04:03,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:04:03,140 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010027408] [2020-10-05 23:04:03,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:04:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:04:03,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010027408] [2020-10-05 23:04:03,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982885081] [2020-10-05 23:04:03,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-10-05 23:04:03,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:04:03,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:04:03,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:04:03,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:04:03,382 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:04:03,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:04:03,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:04:03,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848484052] [2020-10-05 23:04:03,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:04:03,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:04:03,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:04:03,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:04:03,384 INFO L87 Difference]: Start difference. First operand 36444 states and 194571 transitions. Second operand 16 states. [2020-10-05 23:04:07,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:04:07,334 INFO L93 Difference]: Finished difference Result 119346 states and 543724 transitions. [2020-10-05 23:04:07,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:04:07,335 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:04:07,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:04:07,654 INFO L225 Difference]: With dead ends: 119346 [2020-10-05 23:04:07,655 INFO L226 Difference]: Without dead ends: 119313 [2020-10-05 23:04:07,655 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:04:08,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119313 states. [2020-10-05 23:04:09,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119313 to 36040. [2020-10-05 23:04:09,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36040 states. [2020-10-05 23:04:09,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36040 states to 36040 states and 192287 transitions. [2020-10-05 23:04:09,997 INFO L78 Accepts]: Start accepts. Automaton has 36040 states and 192287 transitions. Word has length 25 [2020-10-05 23:04:09,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:04:09,997 INFO L479 AbstractCegarLoop]: Abstraction has 36040 states and 192287 transitions. [2020-10-05 23:04:09,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:04:09,997 INFO L276 IsEmpty]: Start isEmpty. Operand 36040 states and 192287 transitions. [2020-10-05 23:04:09,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:04:09,999 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:04:09,999 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forcibly destroying the process [2020-10-05 23:04:10,491 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2020-10-05 23:04:10,491 INFO L427 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]=== [2020-10-05 23:04:10,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:04:10,491 INFO L82 PathProgramCache]: Analyzing trace with hash 582269272, now seen corresponding path program 3 times [2020-10-05 23:04:10,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:04:10,492 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334363095] [2020-10-05 23:04:10,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:04:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:10,554 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:04:10,555 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334363095] [2020-10-05 23:04:10,555 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480146706] [2020-10-05 23:04:10,555 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:04:10,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-05 23:04:10,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:04:10,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:04:10,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:04:10,733 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:04:10,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:04:10,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:04:10,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222462005] [2020-10-05 23:04:10,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:04:10,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:04:10,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:04:10,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:04:10,735 INFO L87 Difference]: Start difference. First operand 36040 states and 192287 transitions. Second operand 16 states. [2020-10-05 23:04:12,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:04:12,346 INFO L93 Difference]: Finished difference Result 119770 states and 545635 transitions. [2020-10-05 23:04:12,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:04:12,347 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:04:12,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:04:12,676 INFO L225 Difference]: With dead ends: 119770 [2020-10-05 23:04:12,676 INFO L226 Difference]: Without dead ends: 119740 [2020-10-05 23:04:12,676 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:04:13,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119740 states. [2020-10-05 23:04:17,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119740 to 35471. [2020-10-05 23:04:17,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35471 states. [2020-10-05 23:04:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35471 states to 35471 states and 189238 transitions. [2020-10-05 23:04:18,053 INFO L78 Accepts]: Start accepts. Automaton has 35471 states and 189238 transitions. Word has length 25 [2020-10-05 23:04:18,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:04:18,053 INFO L479 AbstractCegarLoop]: Abstraction has 35471 states and 189238 transitions. [2020-10-05 23:04:18,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:04:18,054 INFO L276 IsEmpty]: Start isEmpty. Operand 35471 states and 189238 transitions. [2020-10-05 23:04:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:04:18,057 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:04:18,057 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:04:18,257 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2020-10-05 23:04:18,258 INFO L427 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]=== [2020-10-05 23:04:18,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:04:18,258 INFO L82 PathProgramCache]: Analyzing trace with hash 679178599, now seen corresponding path program 1 times [2020-10-05 23:04:18,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:04:18,259 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817150663] [2020-10-05 23:04:18,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:04:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:04:18,323 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817150663] [2020-10-05 23:04:18,323 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419223573] [2020-10-05 23:04:18,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:04:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:18,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:04:18,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:04:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:04:18,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:04:18,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:04:18,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666568197] [2020-10-05 23:04:18,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:04:18,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:04:18,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:04:18,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:04:18,516 INFO L87 Difference]: Start difference. First operand 35471 states and 189238 transitions. Second operand 16 states. [2020-10-05 23:04:20,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:04:20,015 INFO L93 Difference]: Finished difference Result 121131 states and 553230 transitions. [2020-10-05 23:04:20,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:04:20,016 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:04:20,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:04:20,346 INFO L225 Difference]: With dead ends: 121131 [2020-10-05 23:04:20,346 INFO L226 Difference]: Without dead ends: 121101 [2020-10-05 23:04:20,346 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:04:22,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121101 states. [2020-10-05 23:04:23,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121101 to 35374. [2020-10-05 23:04:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35374 states. [2020-10-05 23:04:23,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35374 states to 35374 states and 188534 transitions. [2020-10-05 23:04:23,324 INFO L78 Accepts]: Start accepts. Automaton has 35374 states and 188534 transitions. Word has length 25 [2020-10-05 23:04:23,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:04:23,324 INFO L479 AbstractCegarLoop]: Abstraction has 35374 states and 188534 transitions. [2020-10-05 23:04:23,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:04:23,325 INFO L276 IsEmpty]: Start isEmpty. Operand 35374 states and 188534 transitions. [2020-10-05 23:04:23,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:04:23,327 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:04:23,327 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:04:23,527 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2020-10-05 23:04:23,528 INFO L427 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]=== [2020-10-05 23:04:23,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:04:23,528 INFO L82 PathProgramCache]: Analyzing trace with hash -647539609, now seen corresponding path program 2 times [2020-10-05 23:04:23,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:04:23,529 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110104669] [2020-10-05 23:04:23,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:04:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:04:23,593 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110104669] [2020-10-05 23:04:23,593 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283271027] [2020-10-05 23:04:23,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:04:23,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:04:23,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:04:23,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:04:23,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:04:23,777 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:04:23,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:04:23,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:04:23,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210396928] [2020-10-05 23:04:23,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:04:23,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:04:23,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:04:23,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:04:23,779 INFO L87 Difference]: Start difference. First operand 35374 states and 188534 transitions. Second operand 16 states. [2020-10-05 23:04:25,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:04:25,934 INFO L93 Difference]: Finished difference Result 120194 states and 548412 transitions. [2020-10-05 23:04:25,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:04:25,935 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:04:25,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:04:26,266 INFO L225 Difference]: With dead ends: 120194 [2020-10-05 23:04:26,266 INFO L226 Difference]: Without dead ends: 120154 [2020-10-05 23:04:26,266 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:04:27,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120154 states. [2020-10-05 23:04:28,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120154 to 35219. [2020-10-05 23:04:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35219 states. Received shutdown request... [2020-10-05 23:04:32,352 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:04:32,353 WARN L544 AbstractCegarLoop]: Verification canceled [2020-10-05 23:04:32,358 WARN L228 ceAbstractionStarter]: Timeout [2020-10-05 23:04:32,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:04:32 BasicIcfg [2020-10-05 23:04:32,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:04:32,360 INFO L168 Benchmark]: Toolchain (without parser) took 230244.44 ms. Allocated memory was 141.0 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 102.4 MB in the beginning and 2.4 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2020-10-05 23:04:32,360 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 141.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-10-05 23:04:32,360 INFO L168 Benchmark]: CACSL2BoogieTranslator took 722.96 ms. Allocated memory was 141.0 MB in the beginning and 204.5 MB in the end (delta: 63.4 MB). Free memory was 102.2 MB in the beginning and 163.6 MB in the end (delta: -61.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2020-10-05 23:04:32,361 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.46 ms. Allocated memory is still 204.5 MB. Free memory was 163.6 MB in the beginning and 161.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:04:32,361 INFO L168 Benchmark]: Boogie Preprocessor took 26.46 ms. Allocated memory is still 204.5 MB. Free memory was 161.7 MB in the beginning and 159.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:04:32,361 INFO L168 Benchmark]: RCFGBuilder took 436.71 ms. Allocated memory is still 204.5 MB. Free memory was 159.7 MB in the beginning and 139.8 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:04:32,361 INFO L168 Benchmark]: TraceAbstraction took 229001.25 ms. Allocated memory was 204.5 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 139.1 MB in the beginning and 2.4 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2020-10-05 23:04:32,363 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 141.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 722.96 ms. Allocated memory was 141.0 MB in the beginning and 204.5 MB in the end (delta: 63.4 MB). Free memory was 102.2 MB in the beginning and 163.6 MB in the end (delta: -61.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.46 ms. Allocated memory is still 204.5 MB. Free memory was 163.6 MB in the beginning and 161.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.46 ms. Allocated memory is still 204.5 MB. Free memory was 161.7 MB in the beginning and 159.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 436.71 ms. Allocated memory is still 204.5 MB. Free memory was 159.7 MB in the beginning and 139.8 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 229001.25 ms. Allocated memory was 204.5 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 139.1 MB in the beginning and 2.4 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.8s, 61 ProgramPointsBefore, 18 ProgramPointsAfterwards, 58 TransitionsBefore, 12 TransitionsAfterwards, 592 CoEnabledTransitionPairs, 7 FixpointIterations, 21 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 3 ChoiceCompositions, 304 VarBasedMoverChecksPositive, 3 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 3 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 486 CheckedPairsTotal, 51 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.5s, 80 ProgramPointsBefore, 31 ProgramPointsAfterwards, 74 TransitionsBefore, 21 TransitionsAfterwards, 920 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 4 ChoiceCompositions, 472 VarBasedMoverChecksPositive, 9 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 11 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 942 CheckedPairsTotal, 62 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.7s, 99 ProgramPointsBefore, 41 ProgramPointsAfterwards, 90 TransitionsBefore, 27 TransitionsAfterwards, 1308 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 3 ConcurrentYvCompositions, 5 ChoiceCompositions, 673 VarBasedMoverChecksPositive, 16 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 17 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1426 CheckedPairsTotal, 74 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.2s, 118 ProgramPointsBefore, 51 ProgramPointsAfterwards, 106 TransitionsBefore, 33 TransitionsAfterwards, 1756 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 4 ConcurrentYvCompositions, 6 ChoiceCompositions, 840 VarBasedMoverChecksPositive, 18 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 20 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 2033 CheckedPairsTotal, 86 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.2s, 137 ProgramPointsBefore, 61 ProgramPointsAfterwards, 122 TransitionsBefore, 39 TransitionsAfterwards, 2264 CoEnabledTransitionPairs, 7 FixpointIterations, 61 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 3 ConcurrentYvCompositions, 7 ChoiceCompositions, 1058 VarBasedMoverChecksPositive, 27 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 30 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 2999 CheckedPairsTotal, 104 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.6s, 156 ProgramPointsBefore, 71 ProgramPointsAfterwards, 138 TransitionsBefore, 45 TransitionsAfterwards, 2832 CoEnabledTransitionPairs, 6 FixpointIterations, 66 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 8 ChoiceCompositions, 1407 VarBasedMoverChecksPositive, 30 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 34 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 3678 CheckedPairsTotal, 113 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 678]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 678). Cancelled while ReachableStatesComputation was computing reachable states (18925 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 55 locations, 1 error locations. Started 6 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 228.6s, OverallIterations: 105, TraceHistogramMax: 6, AutomataDifference: 88.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.9s, HoareTripleCheckerStatistics: 4696 SDtfs, 24936 SDslu, 17023 SDs, 0 SdLazy, 32021 SolverSat, 2219 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2796 GetRequests, 695 SyntacticMatches, 0 SemanticMatches, 2101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14324 ImplicationChecksByTransitivity, 24.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37062occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 97.7s AutomataMinimizationTime, 100 MinimizatonAttempts, 2171074 StatesRemovedByMinimization, 92 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 3045 NumberOfCodeBlocks, 3017 NumberOfCodeBlocksAsserted, 178 NumberOfCheckSat, 2810 ConstructedInterpolants, 0 QuantifiedInterpolants, 377700 SizeOfPredicates, 250 NumberOfNonLiveVariables, 5290 ConjunctsInSsa, 391 ConjunctsInUnsatCore, 147 InterpolantComputations, 53 PerfectInterpolantSequences, 900/1652 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown