/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-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:32:41,828 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:32:41,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:32:41,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:32:41,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:32:41,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:32:41,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:32:41,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:32:41,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:32:41,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:32:41,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:32:41,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:32:41,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:32:41,869 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:32:41,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:32:41,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:32:41,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:32:41,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:32:41,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:32:41,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:32:41,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:32:41,890 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:32:41,891 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:32:41,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:32:41,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:32:41,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:32:41,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:32:41,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:32:41,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:32:41,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:32:41,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:32:41,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:32:41,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:32:41,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:32:41,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:32:41,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:32:41,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:32:41,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:32:41,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:32:41,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:32:41,914 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:32:41,915 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 15:32:41,943 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:32:41,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:32:41,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:32:41,948 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:32:41,948 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:32:41,948 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:32:41,949 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:32:41,949 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:32:41,949 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:32:41,949 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:32:41,949 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:32:41,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:32:41,950 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:32:41,950 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:32:41,950 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:32:41,951 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:32:41,951 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:32:41,951 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:32:41,951 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:32:41,952 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:32:41,952 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:32:41,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:32:41,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:32:41,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:32:41,953 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:32:41,953 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:32:41,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:32:41,953 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:32:41,953 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:32:41,954 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:32:42,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:32:42,233 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:32:42,236 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:32:42,238 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:32:42,238 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:32:42,239 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-2.i [2019-12-18 15:32:42,302 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3126d510/4a5e087deabb4867acce579aefe53c92/FLAG15318200b [2019-12-18 15:32:42,898 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:32:42,899 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-2.i [2019-12-18 15:32:42,913 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3126d510/4a5e087deabb4867acce579aefe53c92/FLAG15318200b [2019-12-18 15:32:43,136 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3126d510/4a5e087deabb4867acce579aefe53c92 [2019-12-18 15:32:43,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:32:43,152 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:32:43,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:32:43,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:32:43,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:32:43,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:32:43" (1/1) ... [2019-12-18 15:32:43,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cc742e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:32:43, skipping insertion in model container [2019-12-18 15:32:43,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:32:43" (1/1) ... [2019-12-18 15:32:43,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:32:43,233 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:32:43,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:32:43,750 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:32:43,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:32:43,855 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:32:43,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:32:43 WrapperNode [2019-12-18 15:32:43,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:32:43,857 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:32:43,857 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:32:43,857 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:32:43,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:32:43" (1/1) ... [2019-12-18 15:32:43,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:32:43" (1/1) ... [2019-12-18 15:32:43,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:32:43,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:32:43,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:32:43,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:32:43,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:32:43" (1/1) ... [2019-12-18 15:32:43,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:32:43" (1/1) ... [2019-12-18 15:32:43,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:32:43" (1/1) ... [2019-12-18 15:32:43,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:32:43" (1/1) ... [2019-12-18 15:32:43,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:32:43" (1/1) ... [2019-12-18 15:32:43,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:32:43" (1/1) ... [2019-12-18 15:32:43,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:32:43" (1/1) ... [2019-12-18 15:32:43,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:32:43,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:32:43,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:32:43,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:32:43,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:32:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:32:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-18 15:32:43,989 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-18 15:32:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-18 15:32:43,989 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-18 15:32:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:32:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:32:43,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:32:43,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:32:43,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:32:43,992 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 15:32:44,316 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:32:44,316 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-18 15:32:44,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:32:44 BoogieIcfgContainer [2019-12-18 15:32:44,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:32:44,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:32:44,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:32:44,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:32:44,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:32:43" (1/3) ... [2019-12-18 15:32:44,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2423a77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:32:44, skipping insertion in model container [2019-12-18 15:32:44,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:32:43" (2/3) ... [2019-12-18 15:32:44,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2423a77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:32:44, skipping insertion in model container [2019-12-18 15:32:44,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:32:44" (3/3) ... [2019-12-18 15:32:44,327 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-2.i [2019-12-18 15:32:44,336 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:32:44,336 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:32:44,343 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-18 15:32:44,344 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:32:44,371 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,371 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,371 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,372 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,372 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,373 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,373 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,374 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,374 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,376 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,376 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,376 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,377 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,377 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,381 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,381 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,381 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,382 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,382 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,387 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,387 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,388 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,388 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,388 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,389 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:44,405 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-18 15:32:44,422 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:32:44,422 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:32:44,422 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:32:44,422 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:32:44,423 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:32:44,423 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:32:44,423 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:32:44,423 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:32:44,435 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 53 transitions [2019-12-18 15:32:44,436 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 57 places, 53 transitions [2019-12-18 15:32:44,479 INFO L126 PetriNetUnfolder]: 3/63 cut-off events. [2019-12-18 15:32:44,479 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:32:44,487 INFO L76 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 63 events. 3/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs. 8/65 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2019-12-18 15:32:44,492 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 57 places, 53 transitions [2019-12-18 15:32:44,512 INFO L126 PetriNetUnfolder]: 3/63 cut-off events. [2019-12-18 15:32:44,513 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:32:44,514 INFO L76 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 63 events. 3/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs. 8/65 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2019-12-18 15:32:44,517 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 592 [2019-12-18 15:32:44,518 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:32:45,954 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-18 15:32:46,119 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-12-18 15:32:46,124 INFO L206 etLargeBlockEncoding]: Checked pairs total: 489 [2019-12-18 15:32:46,125 INFO L214 etLargeBlockEncoding]: Total number of compositions: 46 [2019-12-18 15:32:46,129 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions [2019-12-18 15:32:46,144 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2019-12-18 15:32:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-18 15:32:46,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 15:32:46,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:46,159 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 15:32:46,159 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:32:46,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:46,168 INFO L82 PathProgramCache]: Analyzing trace with hash 210014, now seen corresponding path program 1 times [2019-12-18 15:32:46,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:46,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243454691] [2019-12-18 15:32:46,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:46,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243454691] [2019-12-18 15:32:46,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:46,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:32:46,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769117709] [2019-12-18 15:32:46,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:32:46,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:46,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:32:46,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:32:46,479 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-12-18 15:32:46,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:46,515 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2019-12-18 15:32:46,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:32:46,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 15:32:46,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:46,528 INFO L225 Difference]: With dead ends: 35 [2019-12-18 15:32:46,529 INFO L226 Difference]: Without dead ends: 31 [2019-12-18 15:32:46,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:32:46,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-18 15:32:46,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-18 15:32:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-18 15:32:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-12-18 15:32:46,568 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2019-12-18 15:32:46,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:46,569 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-12-18 15:32:46,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:32:46,569 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-12-18 15:32:46,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 15:32:46,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:46,570 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:46,571 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:32:46,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:46,571 INFO L82 PathProgramCache]: Analyzing trace with hash 647068079, now seen corresponding path program 1 times [2019-12-18 15:32:46,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:46,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245138745] [2019-12-18 15:32:46,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:46,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:46,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245138745] [2019-12-18 15:32:46,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:46,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:32:46,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234409830] [2019-12-18 15:32:46,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:32:46,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:46,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:32:46,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:32:46,648 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-12-18 15:32:46,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:46,669 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2019-12-18 15:32:46,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:32:46,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-18 15:32:46,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:46,670 INFO L225 Difference]: With dead ends: 26 [2019-12-18 15:32:46,670 INFO L226 Difference]: Without dead ends: 24 [2019-12-18 15:32:46,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:32:46,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-18 15:32:46,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-18 15:32:46,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-18 15:32:46,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2019-12-18 15:32:46,676 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2019-12-18 15:32:46,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:46,676 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2019-12-18 15:32:46,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:32:46,677 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2019-12-18 15:32:46,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-18 15:32:46,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:46,678 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:46,678 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:32:46,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:46,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1415732781, now seen corresponding path program 1 times [2019-12-18 15:32:46,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:46,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406357270] [2019-12-18 15:32:46,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:32:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:32:46,776 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:32:46,776 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:32:46,777 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 15:32:46,777 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-18 15:32:46,790 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,790 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,790 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,790 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,791 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,791 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,791 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,791 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,792 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,793 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,793 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,793 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,794 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,794 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,794 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,795 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,795 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,795 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,795 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,795 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,796 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,796 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,796 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,796 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,797 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,797 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,797 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,799 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,799 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,801 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,801 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,801 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,802 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,804 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,807 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,807 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,807 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,808 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,808 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,811 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,811 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,812 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,812 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,812 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,814 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,814 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,815 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,815 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,815 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,815 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,817 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,817 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,817 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,818 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,818 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,818 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:46,820 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 15:32:46,820 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:32:46,820 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:32:46,821 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:32:46,821 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:32:46,821 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:32:46,821 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:32:46,821 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:32:46,821 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:32:46,825 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions [2019-12-18 15:32:46,825 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-18 15:32:46,852 INFO L126 PetriNetUnfolder]: 4/84 cut-off events. [2019-12-18 15:32:46,852 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:32:46,854 INFO L76 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 84 events. 4/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 117 event pairs. 20/96 useless extension candidates. Maximal degree in co-relation 93. Up to 6 conditions per place. [2019-12-18 15:32:46,864 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-18 15:32:46,899 INFO L126 PetriNetUnfolder]: 4/84 cut-off events. [2019-12-18 15:32:46,899 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:32:46,901 INFO L76 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 84 events. 4/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 117 event pairs. 20/96 useless extension candidates. Maximal degree in co-relation 93. Up to 6 conditions per place. [2019-12-18 15:32:46,904 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 920 [2019-12-18 15:32:46,904 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:32:48,231 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-18 15:32:48,327 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1034 [2019-12-18 15:32:48,327 INFO L214 etLargeBlockEncoding]: Total number of compositions: 57 [2019-12-18 15:32:48,328 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions [2019-12-18 15:32:48,339 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2019-12-18 15:32:48,339 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-12-18 15:32:48,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 15:32:48,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:48,340 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 15:32:48,340 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:48,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:48,341 INFO L82 PathProgramCache]: Analyzing trace with hash 353600, now seen corresponding path program 1 times [2019-12-18 15:32:48,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:48,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128507147] [2019-12-18 15:32:48,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:48,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:48,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128507147] [2019-12-18 15:32:48,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:48,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:32:48,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788126324] [2019-12-18 15:32:48,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:32:48,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:48,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:32:48,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:32:48,388 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-12-18 15:32:48,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:48,435 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2019-12-18 15:32:48,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:32:48,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 15:32:48,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:48,440 INFO L225 Difference]: With dead ends: 185 [2019-12-18 15:32:48,440 INFO L226 Difference]: Without dead ends: 171 [2019-12-18 15:32:48,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:32:48,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-18 15:32:48,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-12-18 15:32:48,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-18 15:32:48,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 417 transitions. [2019-12-18 15:32:48,465 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 417 transitions. Word has length 3 [2019-12-18 15:32:48,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:48,465 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 417 transitions. [2019-12-18 15:32:48,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:32:48,466 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 417 transitions. [2019-12-18 15:32:48,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 15:32:48,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:48,466 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:48,467 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:48,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:48,467 INFO L82 PathProgramCache]: Analyzing trace with hash -677960350, now seen corresponding path program 1 times [2019-12-18 15:32:48,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:48,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408659553] [2019-12-18 15:32:48,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:48,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:48,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408659553] [2019-12-18 15:32:48,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:48,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:32:48,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657044293] [2019-12-18 15:32:48,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:32:48,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:48,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:32:48,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:32:48,516 INFO L87 Difference]: Start difference. First operand 169 states and 417 transitions. Second operand 5 states. [2019-12-18 15:32:48,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:48,608 INFO L93 Difference]: Finished difference Result 204 states and 460 transitions. [2019-12-18 15:32:48,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:32:48,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 15:32:48,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:48,611 INFO L225 Difference]: With dead ends: 204 [2019-12-18 15:32:48,611 INFO L226 Difference]: Without dead ends: 201 [2019-12-18 15:32:48,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:32:48,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-12-18 15:32:48,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2019-12-18 15:32:48,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-18 15:32:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2019-12-18 15:32:48,630 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2019-12-18 15:32:48,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:48,630 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2019-12-18 15:32:48,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:32:48,630 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2019-12-18 15:32:48,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:32:48,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:48,632 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:48,632 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:48,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:48,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1901960811, now seen corresponding path program 1 times [2019-12-18 15:32:48,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:48,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373197495] [2019-12-18 15:32:48,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 15:32:48,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373197495] [2019-12-18 15:32:48,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:48,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:32:48,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073296842] [2019-12-18 15:32:48,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:32:48,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:48,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:32:48,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:32:48,702 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2019-12-18 15:32:48,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:48,793 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2019-12-18 15:32:48,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:32:48,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 15:32:48,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:48,795 INFO L225 Difference]: With dead ends: 189 [2019-12-18 15:32:48,796 INFO L226 Difference]: Without dead ends: 185 [2019-12-18 15:32:48,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:32:48,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-18 15:32:48,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2019-12-18 15:32:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-18 15:32:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2019-12-18 15:32:48,809 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2019-12-18 15:32:48,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:48,810 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2019-12-18 15:32:48,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:32:48,811 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2019-12-18 15:32:48,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 15:32:48,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:48,812 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:48,812 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:48,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:48,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1166778350, now seen corresponding path program 1 times [2019-12-18 15:32:48,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:48,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146756484] [2019-12-18 15:32:48,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:32:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:32:48,870 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:32:48,872 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:32:48,872 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 15:32:48,872 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-18 15:32:48,883 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,883 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,883 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,884 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,884 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,884 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,884 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,884 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,884 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,885 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,885 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,885 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,885 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,885 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,886 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,886 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,886 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,886 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,886 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,887 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,887 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,887 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,888 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,888 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,888 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,888 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,888 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,888 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,889 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,889 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,889 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,890 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,890 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,890 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,890 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,890 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,890 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,891 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,891 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,891 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,891 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,892 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,892 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,892 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,892 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,892 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,892 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,893 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,893 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,893 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,893 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,894 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,894 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,894 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,894 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,894 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,896 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,896 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,896 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,896 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,896 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,897 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,897 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,897 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,898 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,898 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,903 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,904 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,904 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,904 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,904 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,904 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,905 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,905 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,905 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,905 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,906 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,906 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,907 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,907 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,907 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,907 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,907 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,907 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:48,908 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 15:32:48,909 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:32:48,909 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:32:48,909 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:32:48,909 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:32:48,909 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:32:48,909 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:32:48,909 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:32:48,909 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:32:48,911 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 85 transitions [2019-12-18 15:32:48,911 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 95 places, 85 transitions [2019-12-18 15:32:48,928 INFO L126 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-18 15:32:48,929 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:32:48,930 INFO L76 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 153 event pairs. 36/131 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-18 15:32:48,934 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 95 places, 85 transitions [2019-12-18 15:32:48,950 INFO L126 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-18 15:32:48,951 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:32:48,952 INFO L76 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 153 event pairs. 36/131 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-18 15:32:48,956 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1308 [2019-12-18 15:32:48,956 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:32:50,515 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-18 15:32:50,619 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1615 [2019-12-18 15:32:50,619 INFO L214 etLargeBlockEncoding]: Total number of compositions: 69 [2019-12-18 15:32:50,619 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 27 transitions [2019-12-18 15:32:50,643 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2019-12-18 15:32:50,644 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-12-18 15:32:50,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 15:32:50,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:50,644 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 15:32:50,644 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:50,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:50,645 INFO L82 PathProgramCache]: Analyzing trace with hash 525945, now seen corresponding path program 1 times [2019-12-18 15:32:50,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:50,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417728460] [2019-12-18 15:32:50,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:50,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417728460] [2019-12-18 15:32:50,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:50,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:32:50,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400068236] [2019-12-18 15:32:50,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:32:50,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:50,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:32:50,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:32:50,685 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2019-12-18 15:32:50,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:50,740 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2019-12-18 15:32:50,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:32:50,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 15:32:50,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:50,750 INFO L225 Difference]: With dead ends: 600 [2019-12-18 15:32:50,751 INFO L226 Difference]: Without dead ends: 559 [2019-12-18 15:32:50,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:32:50,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-18 15:32:50,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 547. [2019-12-18 15:32:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-18 15:32:50,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1723 transitions. [2019-12-18 15:32:50,789 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1723 transitions. Word has length 3 [2019-12-18 15:32:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:50,789 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1723 transitions. [2019-12-18 15:32:50,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:32:50,789 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1723 transitions. [2019-12-18 15:32:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 15:32:50,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:50,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:50,791 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:50,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:50,791 INFO L82 PathProgramCache]: Analyzing trace with hash -2106616436, now seen corresponding path program 1 times [2019-12-18 15:32:50,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:50,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309738689] [2019-12-18 15:32:50,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:50,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:50,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309738689] [2019-12-18 15:32:50,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:50,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:32:50,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56411749] [2019-12-18 15:32:50,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:32:50,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:50,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:32:50,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:32:50,854 INFO L87 Difference]: Start difference. First operand 547 states and 1723 transitions. Second operand 5 states. [2019-12-18 15:32:50,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:50,974 INFO L93 Difference]: Finished difference Result 802 states and 2304 transitions. [2019-12-18 15:32:50,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:32:50,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 15:32:50,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:50,980 INFO L225 Difference]: With dead ends: 802 [2019-12-18 15:32:50,980 INFO L226 Difference]: Without dead ends: 799 [2019-12-18 15:32:50,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:32:50,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-12-18 15:32:51,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 576. [2019-12-18 15:32:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-18 15:32:51,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1822 transitions. [2019-12-18 15:32:51,031 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1822 transitions. Word has length 9 [2019-12-18 15:32:51,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:51,031 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1822 transitions. [2019-12-18 15:32:51,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:32:51,032 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1822 transitions. [2019-12-18 15:32:51,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:32:51,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:51,039 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:51,039 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:51,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:51,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1813947824, now seen corresponding path program 1 times [2019-12-18 15:32:51,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:51,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577301340] [2019-12-18 15:32:51,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 15:32:51,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577301340] [2019-12-18 15:32:51,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:51,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:32:51,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364394600] [2019-12-18 15:32:51,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:32:51,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:51,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:32:51,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:32:51,105 INFO L87 Difference]: Start difference. First operand 576 states and 1822 transitions. Second operand 5 states. [2019-12-18 15:32:51,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:51,195 INFO L93 Difference]: Finished difference Result 832 states and 2399 transitions. [2019-12-18 15:32:51,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:32:51,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 15:32:51,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:51,202 INFO L225 Difference]: With dead ends: 832 [2019-12-18 15:32:51,202 INFO L226 Difference]: Without dead ends: 828 [2019-12-18 15:32:51,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:32:51,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-12-18 15:32:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 605. [2019-12-18 15:32:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 15:32:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1901 transitions. [2019-12-18 15:32:51,226 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1901 transitions. Word has length 13 [2019-12-18 15:32:51,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:51,226 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1901 transitions. [2019-12-18 15:32:51,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:32:51,226 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1901 transitions. [2019-12-18 15:32:51,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:32:51,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:51,227 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:51,228 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:51,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:51,228 INFO L82 PathProgramCache]: Analyzing trace with hash -693557262, now seen corresponding path program 1 times [2019-12-18 15:32:51,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:51,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33562517] [2019-12-18 15:32:51,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:51,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:51,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33562517] [2019-12-18 15:32:51,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402639622] [2019-12-18 15:32:51,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:32:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:51,358 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-18 15:32:51,360 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:32:51,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:51,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:32:51,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-18 15:32:51,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996083056] [2019-12-18 15:32:51,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:32:51,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:51,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:32:51,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:32:51,454 INFO L87 Difference]: Start difference. First operand 605 states and 1901 transitions. Second operand 12 states. [2019-12-18 15:32:51,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:51,794 INFO L93 Difference]: Finished difference Result 1052 states and 2813 transitions. [2019-12-18 15:32:51,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:32:51,795 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-18 15:32:51,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:51,802 INFO L225 Difference]: With dead ends: 1052 [2019-12-18 15:32:51,802 INFO L226 Difference]: Without dead ends: 1048 [2019-12-18 15:32:51,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:32:51,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-12-18 15:32:51,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 587. [2019-12-18 15:32:51,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-12-18 15:32:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1837 transitions. [2019-12-18 15:32:51,827 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1837 transitions. Word has length 15 [2019-12-18 15:32:51,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:51,828 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 1837 transitions. [2019-12-18 15:32:51,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:32:51,828 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1837 transitions. [2019-12-18 15:32:51,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:32:51,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:51,829 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:52,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:32:52,033 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:52,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:52,034 INFO L82 PathProgramCache]: Analyzing trace with hash -552862538, now seen corresponding path program 2 times [2019-12-18 15:32:52,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:52,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050881952] [2019-12-18 15:32:52,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 15:32:52,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050881952] [2019-12-18 15:32:52,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:52,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:32:52,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599250328] [2019-12-18 15:32:52,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:32:52,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:52,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:32:52,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:32:52,106 INFO L87 Difference]: Start difference. First operand 587 states and 1837 transitions. Second operand 7 states. [2019-12-18 15:32:52,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:52,374 INFO L93 Difference]: Finished difference Result 1050 states and 2805 transitions. [2019-12-18 15:32:52,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:32:52,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 15:32:52,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:52,389 INFO L225 Difference]: With dead ends: 1050 [2019-12-18 15:32:52,389 INFO L226 Difference]: Without dead ends: 1045 [2019-12-18 15:32:52,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:32:52,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-18 15:32:52,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2019-12-18 15:32:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-18 15:32:52,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2019-12-18 15:32:52,416 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2019-12-18 15:32:52,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:52,416 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2019-12-18 15:32:52,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:32:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2019-12-18 15:32:52,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:32:52,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:52,418 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:52,418 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:52,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:52,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1197543999, now seen corresponding path program 1 times [2019-12-18 15:32:52,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:52,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167141122] [2019-12-18 15:32:52,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:52,480 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:32:52,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167141122] [2019-12-18 15:32:52,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:52,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:32:52,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850218632] [2019-12-18 15:32:52,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:32:52,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:52,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:32:52,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:32:52,482 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2019-12-18 15:32:52,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:52,593 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2019-12-18 15:32:52,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:32:52,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 15:32:52,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:52,599 INFO L225 Difference]: With dead ends: 736 [2019-12-18 15:32:52,599 INFO L226 Difference]: Without dead ends: 728 [2019-12-18 15:32:52,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:32:52,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-18 15:32:52,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2019-12-18 15:32:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-12-18 15:32:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2019-12-18 15:32:52,616 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2019-12-18 15:32:52,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:52,617 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2019-12-18 15:32:52,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:32:52,617 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2019-12-18 15:32:52,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:32:52,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:52,618 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:52,618 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:32:52,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:52,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1527881090, now seen corresponding path program 1 times [2019-12-18 15:32:52,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:52,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616663620] [2019-12-18 15:32:52,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:32:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:32:52,645 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:32:52,646 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:32:52,646 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 15:32:52,646 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-18 15:32:52,657 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,658 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,658 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,658 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,658 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,658 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,659 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,659 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,659 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,659 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,659 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,659 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,660 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,660 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,660 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,660 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,660 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,660 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,661 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,661 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,661 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,661 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,661 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,661 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,662 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,662 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,662 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,662 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,662 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,663 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,663 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,663 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,663 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,663 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,663 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,663 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,664 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,664 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,664 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,664 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,664 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,664 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,665 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,665 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,665 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,665 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,665 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,665 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,666 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,666 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,666 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,666 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,666 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,666 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,666 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,667 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,667 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,667 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,667 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,667 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,667 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,668 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,668 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,668 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,668 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,668 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,668 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,668 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,669 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,669 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,669 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,669 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,669 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,671 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,671 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,671 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,671 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,672 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,673 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,673 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,673 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,673 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,674 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,675 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,675 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,675 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,675 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,675 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,677 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,677 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,677 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,677 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,678 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,678 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,680 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,680 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,680 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,681 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,681 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,681 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,683 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,683 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,683 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,683 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,684 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,684 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,686 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,686 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,686 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,686 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,687 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,687 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:32:52,689 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 15:32:52,689 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:32:52,689 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:32:52,689 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:32:52,690 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:32:52,690 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:32:52,690 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:32:52,690 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:32:52,690 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:32:52,692 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 101 transitions [2019-12-18 15:32:52,692 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 114 places, 101 transitions [2019-12-18 15:32:52,710 INFO L126 PetriNetUnfolder]: 6/126 cut-off events. [2019-12-18 15:32:52,710 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:32:52,712 INFO L76 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 126 events. 6/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 187 event pairs. 56/170 useless extension candidates. Maximal degree in co-relation 146. Up to 10 conditions per place. [2019-12-18 15:32:52,716 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 114 places, 101 transitions [2019-12-18 15:32:52,732 INFO L126 PetriNetUnfolder]: 6/126 cut-off events. [2019-12-18 15:32:52,732 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:32:52,734 INFO L76 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 126 events. 6/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 187 event pairs. 56/170 useless extension candidates. Maximal degree in co-relation 146. Up to 10 conditions per place. [2019-12-18 15:32:52,738 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1756 [2019-12-18 15:32:52,738 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:32:54,359 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-12-18 15:32:54,594 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2111 [2019-12-18 15:32:54,594 INFO L214 etLargeBlockEncoding]: Total number of compositions: 84 [2019-12-18 15:32:54,595 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions [2019-12-18 15:32:54,709 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2019-12-18 15:32:54,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2019-12-18 15:32:54,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 15:32:54,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:54,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 15:32:54,711 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:32:54,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:54,711 INFO L82 PathProgramCache]: Analyzing trace with hash 729974, now seen corresponding path program 1 times [2019-12-18 15:32:54,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:54,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045121237] [2019-12-18 15:32:54,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:54,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:54,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045121237] [2019-12-18 15:32:54,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:54,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:32:54,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654170776] [2019-12-18 15:32:54,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:32:54,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:54,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:32:54,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:32:54,732 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2019-12-18 15:32:54,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:54,774 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2019-12-18 15:32:54,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:32:54,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 15:32:54,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:54,793 INFO L225 Difference]: With dead ends: 1889 [2019-12-18 15:32:54,793 INFO L226 Difference]: Without dead ends: 1767 [2019-12-18 15:32:54,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:32:54,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-12-18 15:32:54,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1717. [2019-12-18 15:32:54,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-12-18 15:32:54,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 6597 transitions. [2019-12-18 15:32:54,881 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 6597 transitions. Word has length 3 [2019-12-18 15:32:54,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:54,883 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 6597 transitions. [2019-12-18 15:32:54,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:32:54,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 6597 transitions. [2019-12-18 15:32:54,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 15:32:54,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:54,884 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:54,884 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:32:54,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:54,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1449000874, now seen corresponding path program 1 times [2019-12-18 15:32:54,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:54,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41298638] [2019-12-18 15:32:54,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:54,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41298638] [2019-12-18 15:32:54,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:54,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:32:54,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19887754] [2019-12-18 15:32:54,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:32:54,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:54,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:32:54,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:32:54,937 INFO L87 Difference]: Start difference. First operand 1717 states and 6597 transitions. Second operand 5 states. [2019-12-18 15:32:55,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:55,044 INFO L93 Difference]: Finished difference Result 2826 states and 10014 transitions. [2019-12-18 15:32:55,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:32:55,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 15:32:55,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:55,068 INFO L225 Difference]: With dead ends: 2826 [2019-12-18 15:32:55,069 INFO L226 Difference]: Without dead ends: 2823 [2019-12-18 15:32:55,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:32:55,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-18 15:32:55,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 1914. [2019-12-18 15:32:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-18 15:32:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 7409 transitions. [2019-12-18 15:32:55,183 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 7409 transitions. Word has length 9 [2019-12-18 15:32:55,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:55,183 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 7409 transitions. [2019-12-18 15:32:55,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:32:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 7409 transitions. [2019-12-18 15:32:55,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:32:55,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:55,184 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:55,184 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:32:55,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:55,184 INFO L82 PathProgramCache]: Analyzing trace with hash 302089454, now seen corresponding path program 1 times [2019-12-18 15:32:55,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:55,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630931600] [2019-12-18 15:32:55,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:55,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 15:32:55,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630931600] [2019-12-18 15:32:55,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:55,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:32:55,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409897417] [2019-12-18 15:32:55,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:32:55,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:55,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:32:55,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:32:55,232 INFO L87 Difference]: Start difference. First operand 1914 states and 7409 transitions. Second operand 5 states. [2019-12-18 15:32:55,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:55,358 INFO L93 Difference]: Finished difference Result 3124 states and 11194 transitions. [2019-12-18 15:32:55,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:32:55,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 15:32:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:55,406 INFO L225 Difference]: With dead ends: 3124 [2019-12-18 15:32:55,407 INFO L226 Difference]: Without dead ends: 3120 [2019-12-18 15:32:55,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:32:55,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2019-12-18 15:32:55,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2147. [2019-12-18 15:32:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-18 15:32:55,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8364 transitions. [2019-12-18 15:32:55,518 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8364 transitions. Word has length 13 [2019-12-18 15:32:55,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:55,520 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8364 transitions. [2019-12-18 15:32:55,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:32:55,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8364 transitions. [2019-12-18 15:32:55,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:32:55,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:55,521 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:55,521 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:32:55,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:55,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1953005855, now seen corresponding path program 1 times [2019-12-18 15:32:55,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:55,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656517950] [2019-12-18 15:32:55,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:55,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:55,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656517950] [2019-12-18 15:32:55,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803500899] [2019-12-18 15:32:55,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:32:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:55,667 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-18 15:32:55,669 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:32:55,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:55,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:32:55,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-18 15:32:55,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851701541] [2019-12-18 15:32:55,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:32:55,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:55,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:32:55,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:32:55,737 INFO L87 Difference]: Start difference. First operand 2147 states and 8364 transitions. Second operand 12 states. [2019-12-18 15:32:56,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:56,101 INFO L93 Difference]: Finished difference Result 4460 states and 14778 transitions. [2019-12-18 15:32:56,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:32:56,101 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-18 15:32:56,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:56,121 INFO L225 Difference]: With dead ends: 4460 [2019-12-18 15:32:56,122 INFO L226 Difference]: Without dead ends: 4456 [2019-12-18 15:32:56,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:32:56,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2019-12-18 15:32:56,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 2109. [2019-12-18 15:32:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2019-12-18 15:32:56,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 8197 transitions. [2019-12-18 15:32:56,218 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 8197 transitions. Word has length 15 [2019-12-18 15:32:56,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:56,219 INFO L462 AbstractCegarLoop]: Abstraction has 2109 states and 8197 transitions. [2019-12-18 15:32:56,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:32:56,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 8197 transitions. [2019-12-18 15:32:56,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:32:56,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:56,220 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:56,423 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:32:56,423 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:32:56,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:56,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1749825449, now seen corresponding path program 2 times [2019-12-18 15:32:56,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:56,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833714356] [2019-12-18 15:32:56,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:56,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 15:32:56,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833714356] [2019-12-18 15:32:56,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:56,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:32:56,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936900322] [2019-12-18 15:32:56,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:32:56,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:56,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:32:56,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:32:56,473 INFO L87 Difference]: Start difference. First operand 2109 states and 8197 transitions. Second operand 7 states. [2019-12-18 15:32:56,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:56,791 INFO L93 Difference]: Finished difference Result 4522 states and 14986 transitions. [2019-12-18 15:32:56,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:32:56,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 15:32:56,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:56,814 INFO L225 Difference]: With dead ends: 4522 [2019-12-18 15:32:56,814 INFO L226 Difference]: Without dead ends: 4517 [2019-12-18 15:32:56,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:32:56,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-18 15:32:56,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 1998. [2019-12-18 15:32:56,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-18 15:32:56,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7779 transitions. [2019-12-18 15:32:56,905 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7779 transitions. Word has length 15 [2019-12-18 15:32:56,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:56,905 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 7779 transitions. [2019-12-18 15:32:56,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:32:56,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7779 transitions. [2019-12-18 15:32:56,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:32:56,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:56,907 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:56,907 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:32:56,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:56,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1726909890, now seen corresponding path program 1 times [2019-12-18 15:32:56,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:56,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303252756] [2019-12-18 15:32:56,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:32:56,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303252756] [2019-12-18 15:32:56,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:56,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:32:56,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087064302] [2019-12-18 15:32:56,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:32:56,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:56,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:32:56,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:32:56,952 INFO L87 Difference]: Start difference. First operand 1998 states and 7779 transitions. Second operand 5 states. [2019-12-18 15:32:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:57,073 INFO L93 Difference]: Finished difference Result 3208 states and 11604 transitions. [2019-12-18 15:32:57,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:32:57,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 15:32:57,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:57,089 INFO L225 Difference]: With dead ends: 3208 [2019-12-18 15:32:57,090 INFO L226 Difference]: Without dead ends: 3200 [2019-12-18 15:32:57,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:32:57,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2019-12-18 15:32:57,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 2245. [2019-12-18 15:32:57,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-12-18 15:32:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 8702 transitions. [2019-12-18 15:32:57,194 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 8702 transitions. Word has length 17 [2019-12-18 15:32:57,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:57,194 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 8702 transitions. [2019-12-18 15:32:57,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:32:57,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 8702 transitions. [2019-12-18 15:32:57,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:32:57,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:57,197 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:57,197 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:32:57,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:57,198 INFO L82 PathProgramCache]: Analyzing trace with hash -2140493091, now seen corresponding path program 1 times [2019-12-18 15:32:57,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:57,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150878710] [2019-12-18 15:32:57,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:57,280 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-18 15:32:57,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150878710] [2019-12-18 15:32:57,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52765166] [2019-12-18 15:32:57,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:32:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:57,357 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-18 15:32:57,358 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:32:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-18 15:32:57,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:32:57,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-18 15:32:57,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346045735] [2019-12-18 15:32:57,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:32:57,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:57,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:32:57,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:32:57,427 INFO L87 Difference]: Start difference. First operand 2245 states and 8702 transitions. Second operand 12 states. [2019-12-18 15:32:57,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:57,828 INFO L93 Difference]: Finished difference Result 4759 states and 15906 transitions. [2019-12-18 15:32:57,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:32:57,829 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-18 15:32:57,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:57,847 INFO L225 Difference]: With dead ends: 4759 [2019-12-18 15:32:57,848 INFO L226 Difference]: Without dead ends: 4753 [2019-12-18 15:32:57,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:32:57,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4753 states. [2019-12-18 15:32:57,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4753 to 2270. [2019-12-18 15:32:57,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2019-12-18 15:32:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 8766 transitions. [2019-12-18 15:32:57,997 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 8766 transitions. Word has length 19 [2019-12-18 15:32:57,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:57,998 INFO L462 AbstractCegarLoop]: Abstraction has 2270 states and 8766 transitions. [2019-12-18 15:32:57,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:32:57,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 8766 transitions. [2019-12-18 15:32:57,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:32:58,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:58,000 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:58,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:32:58,204 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:32:58,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:58,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1012596352, now seen corresponding path program 1 times [2019-12-18 15:32:58,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:58,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318034641] [2019-12-18 15:32:58,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:58,257 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 15:32:58,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318034641] [2019-12-18 15:32:58,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128807305] [2019-12-18 15:32:58,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:32:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:58,331 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-18 15:32:58,333 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:32:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 15:32:58,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:32:58,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-18 15:32:58,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937123470] [2019-12-18 15:32:58,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:32:58,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:58,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:32:58,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:32:58,422 INFO L87 Difference]: Start difference. First operand 2270 states and 8766 transitions. Second operand 12 states. [2019-12-18 15:32:58,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:58,746 INFO L93 Difference]: Finished difference Result 4884 states and 16344 transitions. [2019-12-18 15:32:58,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:32:58,747 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-18 15:32:58,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:58,764 INFO L225 Difference]: With dead ends: 4884 [2019-12-18 15:32:58,764 INFO L226 Difference]: Without dead ends: 4875 [2019-12-18 15:32:58,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:32:58,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-18 15:32:58,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2267. [2019-12-18 15:32:58,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-12-18 15:32:58,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 8739 transitions. [2019-12-18 15:32:58,866 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 8739 transitions. Word has length 19 [2019-12-18 15:32:58,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:58,866 INFO L462 AbstractCegarLoop]: Abstraction has 2267 states and 8739 transitions. [2019-12-18 15:32:58,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:32:58,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 8739 transitions. [2019-12-18 15:32:58,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:32:58,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:58,868 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:59,071 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:32:59,072 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:32:59,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:59,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1703029164, now seen corresponding path program 2 times [2019-12-18 15:32:59,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:59,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93083917] [2019-12-18 15:32:59,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:59,153 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:32:59,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93083917] [2019-12-18 15:32:59,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:59,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:32:59,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344658993] [2019-12-18 15:32:59,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:32:59,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:59,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:32:59,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:32:59,155 INFO L87 Difference]: Start difference. First operand 2267 states and 8739 transitions. Second operand 7 states. [2019-12-18 15:32:59,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:59,458 INFO L93 Difference]: Finished difference Result 4884 states and 16339 transitions. [2019-12-18 15:32:59,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:32:59,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 15:32:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:59,475 INFO L225 Difference]: With dead ends: 4884 [2019-12-18 15:32:59,475 INFO L226 Difference]: Without dead ends: 4875 [2019-12-18 15:32:59,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:32:59,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-18 15:32:59,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2192. [2019-12-18 15:32:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-12-18 15:32:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 8446 transitions. [2019-12-18 15:32:59,561 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 8446 transitions. Word has length 19 [2019-12-18 15:32:59,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:59,562 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 8446 transitions. [2019-12-18 15:32:59,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:32:59,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 8446 transitions. [2019-12-18 15:32:59,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:32:59,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:59,564 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:59,564 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:32:59,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:59,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1703042649, now seen corresponding path program 2 times [2019-12-18 15:32:59,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:59,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071891587] [2019-12-18 15:32:59,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:59,683 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:32:59,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071891587] [2019-12-18 15:32:59,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:32:59,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:32:59,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943502362] [2019-12-18 15:32:59,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:32:59,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:59,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:32:59,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:32:59,685 INFO L87 Difference]: Start difference. First operand 2192 states and 8446 transitions. Second operand 7 states. [2019-12-18 15:32:59,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:59,990 INFO L93 Difference]: Finished difference Result 4737 states and 15791 transitions. [2019-12-18 15:32:59,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:32:59,990 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 15:32:59,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:00,005 INFO L225 Difference]: With dead ends: 4737 [2019-12-18 15:33:00,006 INFO L226 Difference]: Without dead ends: 4728 [2019-12-18 15:33:00,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:33:00,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2019-12-18 15:33:00,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 2133. [2019-12-18 15:33:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-12-18 15:33:00,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 8224 transitions. [2019-12-18 15:33:00,094 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 8224 transitions. Word has length 19 [2019-12-18 15:33:00,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:00,094 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 8224 transitions. [2019-12-18 15:33:00,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:33:00,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 8224 transitions. [2019-12-18 15:33:00,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:33:00,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:00,096 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:00,097 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:33:00,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:00,097 INFO L82 PathProgramCache]: Analyzing trace with hash 269937843, now seen corresponding path program 1 times [2019-12-18 15:33:00,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:00,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232536082] [2019-12-18 15:33:00,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:00,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-18 15:33:00,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232536082] [2019-12-18 15:33:00,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140872540] [2019-12-18 15:33:00,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:00,246 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:33:00,248 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-18 15:33:00,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:00,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:33:00,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416127633] [2019-12-18 15:33:00,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:33:00,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:00,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:33:00,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:33:00,348 INFO L87 Difference]: Start difference. First operand 2133 states and 8224 transitions. Second operand 16 states. [2019-12-18 15:33:01,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:01,241 INFO L93 Difference]: Finished difference Result 5995 states and 18718 transitions. [2019-12-18 15:33:01,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:01,241 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-18 15:33:01,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:01,253 INFO L225 Difference]: With dead ends: 5995 [2019-12-18 15:33:01,253 INFO L226 Difference]: Without dead ends: 5991 [2019-12-18 15:33:01,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:33:01,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2019-12-18 15:33:01,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 2101. [2019-12-18 15:33:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-12-18 15:33:01,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 8089 transitions. [2019-12-18 15:33:01,425 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 8089 transitions. Word has length 21 [2019-12-18 15:33:01,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:01,426 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 8089 transitions. [2019-12-18 15:33:01,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:33:01,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 8089 transitions. [2019-12-18 15:33:01,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:33:01,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:01,429 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:01,632 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:01,633 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:33:01,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:01,634 INFO L82 PathProgramCache]: Analyzing trace with hash 275473203, now seen corresponding path program 2 times [2019-12-18 15:33:01,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:01,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147002960] [2019-12-18 15:33:01,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-18 15:33:01,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147002960] [2019-12-18 15:33:01,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617174793] [2019-12-18 15:33:01,698 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:01,779 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:33:01,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:33:01,781 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:33:01,782 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:01,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-18 15:33:01,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:01,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:33:01,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684900376] [2019-12-18 15:33:01,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:33:01,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:01,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:33:01,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:33:01,898 INFO L87 Difference]: Start difference. First operand 2101 states and 8089 transitions. Second operand 16 states. [2019-12-18 15:33:02,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:02,751 INFO L93 Difference]: Finished difference Result 5889 states and 18361 transitions. [2019-12-18 15:33:02,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:02,751 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-18 15:33:02,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:02,760 INFO L225 Difference]: With dead ends: 5889 [2019-12-18 15:33:02,760 INFO L226 Difference]: Without dead ends: 5883 [2019-12-18 15:33:02,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:33:02,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5883 states. [2019-12-18 15:33:02,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5883 to 2071. [2019-12-18 15:33:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-12-18 15:33:02,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7960 transitions. [2019-12-18 15:33:02,842 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7960 transitions. Word has length 21 [2019-12-18 15:33:02,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:02,842 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 7960 transitions. [2019-12-18 15:33:02,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:33:02,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7960 transitions. [2019-12-18 15:33:02,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:33:02,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:02,845 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:03,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:03,048 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:33:03,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:03,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1870977495, now seen corresponding path program 3 times [2019-12-18 15:33:03,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:03,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772124264] [2019-12-18 15:33:03,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:03,112 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 15:33:03,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772124264] [2019-12-18 15:33:03,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612221500] [2019-12-18 15:33:03,113 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:03,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 15:33:03,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:33:03,185 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:33:03,187 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:03,308 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 15:33:03,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:03,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:33:03,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784886967] [2019-12-18 15:33:03,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:33:03,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:03,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:33:03,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:33:03,310 INFO L87 Difference]: Start difference. First operand 2071 states and 7960 transitions. Second operand 16 states. [2019-12-18 15:33:04,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:04,159 INFO L93 Difference]: Finished difference Result 5888 states and 18357 transitions. [2019-12-18 15:33:04,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:04,160 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-18 15:33:04,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:04,170 INFO L225 Difference]: With dead ends: 5888 [2019-12-18 15:33:04,170 INFO L226 Difference]: Without dead ends: 5884 [2019-12-18 15:33:04,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:33:04,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5884 states. [2019-12-18 15:33:04,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5884 to 1997. [2019-12-18 15:33:04,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-12-18 15:33:04,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 7687 transitions. [2019-12-18 15:33:04,250 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 7687 transitions. Word has length 21 [2019-12-18 15:33:04,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:04,251 INFO L462 AbstractCegarLoop]: Abstraction has 1997 states and 7687 transitions. [2019-12-18 15:33:04,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:33:04,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 7687 transitions. [2019-12-18 15:33:04,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:33:04,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:04,253 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:04,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:04,456 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:33:04,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:04,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1852496535, now seen corresponding path program 4 times [2019-12-18 15:33:04,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:04,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392608788] [2019-12-18 15:33:04,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 15:33:04,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392608788] [2019-12-18 15:33:04,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563944797] [2019-12-18 15:33:04,517 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:04,585 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:33:04,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:33:04,586 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:33:04,588 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:04,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 15:33:04,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:04,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:33:04,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884839735] [2019-12-18 15:33:04,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:33:04,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:04,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:33:04,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:33:04,697 INFO L87 Difference]: Start difference. First operand 1997 states and 7687 transitions. Second operand 16 states. [2019-12-18 15:33:05,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:05,487 INFO L93 Difference]: Finished difference Result 5819 states and 18141 transitions. [2019-12-18 15:33:05,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:05,487 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-18 15:33:05,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:05,496 INFO L225 Difference]: With dead ends: 5819 [2019-12-18 15:33:05,496 INFO L226 Difference]: Without dead ends: 5813 [2019-12-18 15:33:05,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:33:05,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5813 states. [2019-12-18 15:33:05,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5813 to 1967. [2019-12-18 15:33:05,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-12-18 15:33:05,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 7558 transitions. [2019-12-18 15:33:05,568 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 7558 transitions. Word has length 21 [2019-12-18 15:33:05,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:05,568 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 7558 transitions. [2019-12-18 15:33:05,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:33:05,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 7558 transitions. [2019-12-18 15:33:05,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:33:05,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:05,571 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:05,782 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:05,783 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:33:05,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:05,783 INFO L82 PathProgramCache]: Analyzing trace with hash -748339188, now seen corresponding path program 1 times [2019-12-18 15:33:05,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:05,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603210821] [2019-12-18 15:33:05,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:05,839 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:33:05,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603210821] [2019-12-18 15:33:05,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:05,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:33:05,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071740138] [2019-12-18 15:33:05,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:33:05,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:05,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:33:05,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:33:05,841 INFO L87 Difference]: Start difference. First operand 1967 states and 7558 transitions. Second operand 5 states. [2019-12-18 15:33:06,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:06,001 INFO L93 Difference]: Finished difference Result 3010 states and 10835 transitions. [2019-12-18 15:33:06,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:33:06,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 15:33:06,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:06,010 INFO L225 Difference]: With dead ends: 3010 [2019-12-18 15:33:06,010 INFO L226 Difference]: Without dead ends: 2994 [2019-12-18 15:33:06,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:33:06,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2019-12-18 15:33:06,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2174. [2019-12-18 15:33:06,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2019-12-18 15:33:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 8201 transitions. [2019-12-18 15:33:06,080 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 8201 transitions. Word has length 21 [2019-12-18 15:33:06,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:06,080 INFO L462 AbstractCegarLoop]: Abstraction has 2174 states and 8201 transitions. [2019-12-18 15:33:06,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:33:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 8201 transitions. [2019-12-18 15:33:06,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:33:06,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:06,082 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:06,082 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:33:06,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:06,083 INFO L82 PathProgramCache]: Analyzing trace with hash -228501443, now seen corresponding path program 5 times [2019-12-18 15:33:06,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:06,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195412348] [2019-12-18 15:33:06,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:33:06,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195412348] [2019-12-18 15:33:06,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:06,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:33:06,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502918028] [2019-12-18 15:33:06,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:33:06,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:06,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:33:06,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:33:06,151 INFO L87 Difference]: Start difference. First operand 2174 states and 8201 transitions. Second operand 9 states. [2019-12-18 15:33:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:06,843 INFO L93 Difference]: Finished difference Result 6140 states and 19238 transitions. [2019-12-18 15:33:06,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:06,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 15:33:06,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:06,852 INFO L225 Difference]: With dead ends: 6140 [2019-12-18 15:33:06,852 INFO L226 Difference]: Without dead ends: 6133 [2019-12-18 15:33:06,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:33:06,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2019-12-18 15:33:06,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 2090. [2019-12-18 15:33:06,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2019-12-18 15:33:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7871 transitions. [2019-12-18 15:33:06,934 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7871 transitions. Word has length 21 [2019-12-18 15:33:06,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:06,934 INFO L462 AbstractCegarLoop]: Abstraction has 2090 states and 7871 transitions. [2019-12-18 15:33:06,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:33:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7871 transitions. [2019-12-18 15:33:06,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:33:06,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:06,937 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:06,937 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:33:06,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:06,938 INFO L82 PathProgramCache]: Analyzing trace with hash -241447043, now seen corresponding path program 6 times [2019-12-18 15:33:06,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:06,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037730141] [2019-12-18 15:33:06,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:07,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:33:07,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037730141] [2019-12-18 15:33:07,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:07,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:33:07,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988342969] [2019-12-18 15:33:07,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:33:07,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:07,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:33:07,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:33:07,044 INFO L87 Difference]: Start difference. First operand 2090 states and 7871 transitions. Second operand 9 states. [2019-12-18 15:33:07,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:07,912 INFO L93 Difference]: Finished difference Result 6012 states and 18787 transitions. [2019-12-18 15:33:07,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:07,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 15:33:07,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:07,921 INFO L225 Difference]: With dead ends: 6012 [2019-12-18 15:33:07,922 INFO L226 Difference]: Without dead ends: 6002 [2019-12-18 15:33:07,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:33:07,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2019-12-18 15:33:07,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 1965. [2019-12-18 15:33:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2019-12-18 15:33:08,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2019-12-18 15:33:08,005 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2019-12-18 15:33:08,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:08,006 INFO L462 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2019-12-18 15:33:08,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:33:08,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2019-12-18 15:33:08,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:33:08,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:08,008 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:08,008 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:33:08,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:08,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1727522141, now seen corresponding path program 1 times [2019-12-18 15:33:08,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:08,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576054789] [2019-12-18 15:33:08,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:33:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:33:08,033 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:33:08,033 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:33:08,033 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 15:33:08,033 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-18 15:33:08,090 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,090 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,090 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,090 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,091 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,091 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,091 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,091 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,092 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,092 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,092 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,092 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,092 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,094 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,094 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,095 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,095 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,095 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,095 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,095 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,096 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,096 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,096 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,096 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,096 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,096 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,096 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,097 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,097 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,097 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,097 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,097 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,097 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,097 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,097 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,098 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,098 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,098 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,098 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,098 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,099 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,099 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,099 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,099 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,099 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,100 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,100 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,100 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,100 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,101 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,101 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,101 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,101 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,101 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,101 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,102 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,102 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,102 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,102 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,103 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,103 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,103 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,103 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,103 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,103 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,104 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,104 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,104 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,104 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,104 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,104 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,105 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,105 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,105 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,105 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,105 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,105 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,105 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,106 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,106 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,106 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,106 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,106 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,106 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,106 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,107 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,107 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,108 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,108 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,108 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,109 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,109 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,110 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,110 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,110 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,112 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,112 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,112 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,113 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,113 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,115 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,115 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,115 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,116 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,116 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,118 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,118 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,118 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,119 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,119 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,121 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,121 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,121 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,122 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,122 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,122 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,124 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,124 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,124 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,124 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,125 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,125 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,126 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,126 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,126 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,126 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,127 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,127 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,128 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,128 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,128 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,128 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,129 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,129 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,130 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,130 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,130 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,130 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,131 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,131 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:33:08,132 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-18 15:33:08,132 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:33:08,132 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:33:08,132 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:33:08,133 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:33:08,133 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:33:08,133 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:33:08,133 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:33:08,133 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:33:08,134 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 117 transitions [2019-12-18 15:33:08,134 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 133 places, 117 transitions [2019-12-18 15:33:08,160 INFO L126 PetriNetUnfolder]: 7/147 cut-off events. [2019-12-18 15:33:08,160 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:33:08,162 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 147 events. 7/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 222 event pairs. 80/213 useless extension candidates. Maximal degree in co-relation 174. Up to 12 conditions per place. [2019-12-18 15:33:08,168 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 133 places, 117 transitions [2019-12-18 15:33:08,186 INFO L126 PetriNetUnfolder]: 7/147 cut-off events. [2019-12-18 15:33:08,186 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:33:08,188 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 147 events. 7/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 222 event pairs. 80/213 useless extension candidates. Maximal degree in co-relation 174. Up to 12 conditions per place. [2019-12-18 15:33:08,193 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2264 [2019-12-18 15:33:08,194 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:33:09,748 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-18 15:33:09,983 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2604 [2019-12-18 15:33:09,983 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-18 15:33:09,983 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 39 transitions [2019-12-18 15:33:10,269 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2019-12-18 15:33:10,270 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2019-12-18 15:33:10,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 15:33:10,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:10,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 15:33:10,270 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:10,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:10,271 INFO L82 PathProgramCache]: Analyzing trace with hash 963853, now seen corresponding path program 1 times [2019-12-18 15:33:10,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:10,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412653789] [2019-12-18 15:33:10,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:10,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412653789] [2019-12-18 15:33:10,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:10,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:33:10,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565526873] [2019-12-18 15:33:10,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:33:10,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:10,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:33:10,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:33:10,291 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2019-12-18 15:33:10,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:10,436 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2019-12-18 15:33:10,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:33:10,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 15:33:10,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:10,455 INFO L225 Difference]: With dead ends: 5844 [2019-12-18 15:33:10,456 INFO L226 Difference]: Without dead ends: 5479 [2019-12-18 15:33:10,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:33:10,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2019-12-18 15:33:10,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5299. [2019-12-18 15:33:10,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-18 15:33:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 24031 transitions. [2019-12-18 15:33:10,570 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 24031 transitions. Word has length 3 [2019-12-18 15:33:10,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:10,570 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 24031 transitions. [2019-12-18 15:33:10,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:33:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 24031 transitions. [2019-12-18 15:33:10,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 15:33:10,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:10,571 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:10,571 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:10,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:10,572 INFO L82 PathProgramCache]: Analyzing trace with hash 91439009, now seen corresponding path program 1 times [2019-12-18 15:33:10,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:10,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442748199] [2019-12-18 15:33:10,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:10,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:10,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442748199] [2019-12-18 15:33:10,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:10,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:33:10,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264720991] [2019-12-18 15:33:10,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:33:10,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:10,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:33:10,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:33:10,604 INFO L87 Difference]: Start difference. First operand 5299 states and 24031 transitions. Second operand 5 states. [2019-12-18 15:33:10,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:10,742 INFO L93 Difference]: Finished difference Result 9358 states and 39616 transitions. [2019-12-18 15:33:10,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:33:10,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 15:33:10,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:10,764 INFO L225 Difference]: With dead ends: 9358 [2019-12-18 15:33:10,765 INFO L226 Difference]: Without dead ends: 9355 [2019-12-18 15:33:10,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:33:10,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9355 states. [2019-12-18 15:33:10,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9355 to 6120. [2019-12-18 15:33:10,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2019-12-18 15:33:10,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 28016 transitions. [2019-12-18 15:33:10,925 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 28016 transitions. Word has length 9 [2019-12-18 15:33:10,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:10,925 INFO L462 AbstractCegarLoop]: Abstraction has 6120 states and 28016 transitions. [2019-12-18 15:33:10,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:33:10,925 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 28016 transitions. [2019-12-18 15:33:10,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:33:10,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:10,925 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:10,925 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:10,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:10,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1001063187, now seen corresponding path program 1 times [2019-12-18 15:33:10,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:10,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130781950] [2019-12-18 15:33:10,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 15:33:10,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130781950] [2019-12-18 15:33:10,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:10,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:33:10,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328630486] [2019-12-18 15:33:10,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:33:10,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:10,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:33:10,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:33:10,960 INFO L87 Difference]: Start difference. First operand 6120 states and 28016 transitions. Second operand 5 states. [2019-12-18 15:33:11,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:11,098 INFO L93 Difference]: Finished difference Result 10720 states and 46025 transitions. [2019-12-18 15:33:11,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:33:11,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 15:33:11,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:11,128 INFO L225 Difference]: With dead ends: 10720 [2019-12-18 15:33:11,128 INFO L226 Difference]: Without dead ends: 10716 [2019-12-18 15:33:11,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:33:11,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10716 states. [2019-12-18 15:33:11,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10716 to 7145. [2019-12-18 15:33:11,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-12-18 15:33:12,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 33093 transitions. [2019-12-18 15:33:12,052 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 33093 transitions. Word has length 13 [2019-12-18 15:33:12,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:12,052 INFO L462 AbstractCegarLoop]: Abstraction has 7145 states and 33093 transitions. [2019-12-18 15:33:12,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:33:12,052 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 33093 transitions. [2019-12-18 15:33:12,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:33:12,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:12,053 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:12,053 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:12,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:12,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1798371701, now seen corresponding path program 1 times [2019-12-18 15:33:12,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:12,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507469007] [2019-12-18 15:33:12,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:12,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:12,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507469007] [2019-12-18 15:33:12,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180854445] [2019-12-18 15:33:12,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:12,186 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-18 15:33:12,187 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:12,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:12,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-18 15:33:12,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989096173] [2019-12-18 15:33:12,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:33:12,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:12,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:33:12,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:33:12,250 INFO L87 Difference]: Start difference. First operand 7145 states and 33093 transitions. Second operand 12 states. [2019-12-18 15:33:12,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:12,643 INFO L93 Difference]: Finished difference Result 16250 states and 64977 transitions. [2019-12-18 15:33:12,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:33:12,643 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-18 15:33:12,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:12,677 INFO L225 Difference]: With dead ends: 16250 [2019-12-18 15:33:12,677 INFO L226 Difference]: Without dead ends: 16246 [2019-12-18 15:33:12,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:33:12,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16246 states. [2019-12-18 15:33:12,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16246 to 7067. [2019-12-18 15:33:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7067 states. [2019-12-18 15:33:12,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7067 states to 7067 states and 32681 transitions. [2019-12-18 15:33:12,874 INFO L78 Accepts]: Start accepts. Automaton has 7067 states and 32681 transitions. Word has length 15 [2019-12-18 15:33:12,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:12,874 INFO L462 AbstractCegarLoop]: Abstraction has 7067 states and 32681 transitions. [2019-12-18 15:33:12,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:33:12,874 INFO L276 IsEmpty]: Start isEmpty. Operand 7067 states and 32681 transitions. [2019-12-18 15:33:12,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:33:12,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:12,874 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:13,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:13,077 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:13,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:13,077 INFO L82 PathProgramCache]: Analyzing trace with hash -50954293, now seen corresponding path program 2 times [2019-12-18 15:33:13,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:13,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626874350] [2019-12-18 15:33:13,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 15:33:13,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626874350] [2019-12-18 15:33:13,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:13,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:33:13,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752422947] [2019-12-18 15:33:13,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:33:13,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:13,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:33:13,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:33:13,125 INFO L87 Difference]: Start difference. First operand 7067 states and 32681 transitions. Second operand 7 states. [2019-12-18 15:33:13,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:13,458 INFO L93 Difference]: Finished difference Result 16584 states and 66357 transitions. [2019-12-18 15:33:13,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:33:13,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 15:33:13,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:13,497 INFO L225 Difference]: With dead ends: 16584 [2019-12-18 15:33:13,497 INFO L226 Difference]: Without dead ends: 16579 [2019-12-18 15:33:13,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:33:13,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16579 states. [2019-12-18 15:33:13,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16579 to 6836. [2019-12-18 15:33:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6836 states. [2019-12-18 15:33:13,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 31606 transitions. [2019-12-18 15:33:13,840 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 31606 transitions. Word has length 15 [2019-12-18 15:33:13,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:13,840 INFO L462 AbstractCegarLoop]: Abstraction has 6836 states and 31606 transitions. [2019-12-18 15:33:13,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:33:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 31606 transitions. [2019-12-18 15:33:13,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:33:13,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:13,841 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:13,841 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:13,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:13,841 INFO L82 PathProgramCache]: Analyzing trace with hash 2086390321, now seen corresponding path program 1 times [2019-12-18 15:33:13,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:13,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930358862] [2019-12-18 15:33:13,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:33:13,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930358862] [2019-12-18 15:33:13,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:13,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:33:13,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600688789] [2019-12-18 15:33:13,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:33:13,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:13,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:33:13,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:33:13,879 INFO L87 Difference]: Start difference. First operand 6836 states and 31606 transitions. Second operand 5 states. [2019-12-18 15:33:14,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:14,049 INFO L93 Difference]: Finished difference Result 11876 states and 51707 transitions. [2019-12-18 15:33:14,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:33:14,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 15:33:14,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:14,087 INFO L225 Difference]: With dead ends: 11876 [2019-12-18 15:33:14,087 INFO L226 Difference]: Without dead ends: 11868 [2019-12-18 15:33:14,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:33:14,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2019-12-18 15:33:14,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 8095. [2019-12-18 15:33:14,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8095 states. [2019-12-18 15:33:14,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8095 states to 8095 states and 37697 transitions. [2019-12-18 15:33:14,269 INFO L78 Accepts]: Start accepts. Automaton has 8095 states and 37697 transitions. Word has length 17 [2019-12-18 15:33:14,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:14,270 INFO L462 AbstractCegarLoop]: Abstraction has 8095 states and 37697 transitions. [2019-12-18 15:33:14,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:33:14,270 INFO L276 IsEmpty]: Start isEmpty. Operand 8095 states and 37697 transitions. [2019-12-18 15:33:14,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:33:14,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:14,271 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:14,271 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:14,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:14,271 INFO L82 PathProgramCache]: Analyzing trace with hash 2036081631, now seen corresponding path program 1 times [2019-12-18 15:33:14,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:14,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207017217] [2019-12-18 15:33:14,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:14,320 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-18 15:33:14,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207017217] [2019-12-18 15:33:14,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537846693] [2019-12-18 15:33:14,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:14,399 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-18 15:33:14,400 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-18 15:33:14,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:14,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-18 15:33:14,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841467212] [2019-12-18 15:33:14,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:33:14,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:14,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:33:14,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:33:14,459 INFO L87 Difference]: Start difference. First operand 8095 states and 37697 transitions. Second operand 12 states. [2019-12-18 15:33:14,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:14,811 INFO L93 Difference]: Finished difference Result 18509 states and 75177 transitions. [2019-12-18 15:33:14,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:33:14,812 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-18 15:33:14,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:15,001 INFO L225 Difference]: With dead ends: 18509 [2019-12-18 15:33:15,001 INFO L226 Difference]: Without dead ends: 18503 [2019-12-18 15:33:15,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:33:15,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18503 states. [2019-12-18 15:33:15,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18503 to 8204. [2019-12-18 15:33:15,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2019-12-18 15:33:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 38127 transitions. [2019-12-18 15:33:15,219 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 38127 transitions. Word has length 19 [2019-12-18 15:33:15,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:15,219 INFO L462 AbstractCegarLoop]: Abstraction has 8204 states and 38127 transitions. [2019-12-18 15:33:15,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:33:15,220 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 38127 transitions. [2019-12-18 15:33:15,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:33:15,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:15,220 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:15,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:15,421 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:15,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:15,422 INFO L82 PathProgramCache]: Analyzing trace with hash -728631447, now seen corresponding path program 2 times [2019-12-18 15:33:15,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:15,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947354503] [2019-12-18 15:33:15,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:33:15,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947354503] [2019-12-18 15:33:15,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:15,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:33:15,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416703680] [2019-12-18 15:33:15,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:33:15,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:15,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:33:15,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:33:15,471 INFO L87 Difference]: Start difference. First operand 8204 states and 38127 transitions. Second operand 7 states. [2019-12-18 15:33:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:15,910 INFO L93 Difference]: Finished difference Result 18912 states and 76848 transitions. [2019-12-18 15:33:15,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:33:15,911 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 15:33:15,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:15,992 INFO L225 Difference]: With dead ends: 18912 [2019-12-18 15:33:15,992 INFO L226 Difference]: Without dead ends: 18903 [2019-12-18 15:33:15,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:33:16,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18903 states. [2019-12-18 15:33:16,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18903 to 7911. [2019-12-18 15:33:16,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7911 states. [2019-12-18 15:33:16,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7911 states to 7911 states and 36783 transitions. [2019-12-18 15:33:16,381 INFO L78 Accepts]: Start accepts. Automaton has 7911 states and 36783 transitions. Word has length 19 [2019-12-18 15:33:16,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:16,381 INFO L462 AbstractCegarLoop]: Abstraction has 7911 states and 36783 transitions. [2019-12-18 15:33:16,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:33:16,382 INFO L276 IsEmpty]: Start isEmpty. Operand 7911 states and 36783 transitions. [2019-12-18 15:33:16,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:33:16,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:16,383 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:16,383 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:16,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:16,383 INFO L82 PathProgramCache]: Analyzing trace with hash -728623232, now seen corresponding path program 1 times [2019-12-18 15:33:16,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:16,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981951262] [2019-12-18 15:33:16,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:16,440 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:33:16,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981951262] [2019-12-18 15:33:16,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:16,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:33:16,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070911479] [2019-12-18 15:33:16,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:33:16,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:16,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:33:16,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:33:16,442 INFO L87 Difference]: Start difference. First operand 7911 states and 36783 transitions. Second operand 7 states. [2019-12-18 15:33:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:16,818 INFO L93 Difference]: Finished difference Result 18895 states and 76839 transitions. [2019-12-18 15:33:16,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:33:16,819 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 15:33:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:16,861 INFO L225 Difference]: With dead ends: 18895 [2019-12-18 15:33:16,861 INFO L226 Difference]: Without dead ends: 18886 [2019-12-18 15:33:16,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:33:17,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18886 states. [2019-12-18 15:33:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18886 to 8150. [2019-12-18 15:33:17,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8150 states. [2019-12-18 15:33:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8150 states to 8150 states and 37871 transitions. [2019-12-18 15:33:17,216 INFO L78 Accepts]: Start accepts. Automaton has 8150 states and 37871 transitions. Word has length 19 [2019-12-18 15:33:17,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:17,216 INFO L462 AbstractCegarLoop]: Abstraction has 8150 states and 37871 transitions. [2019-12-18 15:33:17,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:33:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 8150 states and 37871 transitions. [2019-12-18 15:33:17,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:33:17,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:17,217 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:17,217 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:17,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:17,218 INFO L82 PathProgramCache]: Analyzing trace with hash -718028672, now seen corresponding path program 2 times [2019-12-18 15:33:17,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:17,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910817997] [2019-12-18 15:33:17,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:17,281 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:33:17,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910817997] [2019-12-18 15:33:17,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:17,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:33:17,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81740399] [2019-12-18 15:33:17,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:33:17,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:17,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:33:17,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:33:17,283 INFO L87 Difference]: Start difference. First operand 8150 states and 37871 transitions. Second operand 7 states. [2019-12-18 15:33:17,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:17,728 INFO L93 Difference]: Finished difference Result 19087 states and 77644 transitions. [2019-12-18 15:33:17,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:33:17,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 15:33:17,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:17,791 INFO L225 Difference]: With dead ends: 19087 [2019-12-18 15:33:17,791 INFO L226 Difference]: Without dead ends: 19078 [2019-12-18 15:33:17,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:33:17,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19078 states. [2019-12-18 15:33:18,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19078 to 8107. [2019-12-18 15:33:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8107 states. [2019-12-18 15:33:18,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8107 states to 8107 states and 37697 transitions. [2019-12-18 15:33:18,058 INFO L78 Accepts]: Start accepts. Automaton has 8107 states and 37697 transitions. Word has length 19 [2019-12-18 15:33:18,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:18,059 INFO L462 AbstractCegarLoop]: Abstraction has 8107 states and 37697 transitions. [2019-12-18 15:33:18,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:33:18,059 INFO L276 IsEmpty]: Start isEmpty. Operand 8107 states and 37697 transitions. [2019-12-18 15:33:18,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:33:18,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:18,060 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:18,060 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:18,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:18,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1830634066, now seen corresponding path program 1 times [2019-12-18 15:33:18,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:18,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241531000] [2019-12-18 15:33:18,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-18 15:33:18,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241531000] [2019-12-18 15:33:18,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993784787] [2019-12-18 15:33:18,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:18,223 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:33:18,225 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-18 15:33:18,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:18,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:33:18,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738784787] [2019-12-18 15:33:18,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:33:18,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:18,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:33:18,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:33:18,376 INFO L87 Difference]: Start difference. First operand 8107 states and 37697 transitions. Second operand 16 states. [2019-12-18 15:33:19,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:19,642 INFO L93 Difference]: Finished difference Result 26399 states and 100480 transitions. [2019-12-18 15:33:19,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:19,643 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-18 15:33:19,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:19,703 INFO L225 Difference]: With dead ends: 26399 [2019-12-18 15:33:19,704 INFO L226 Difference]: Without dead ends: 26395 [2019-12-18 15:33:19,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:33:19,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26395 states. [2019-12-18 15:33:19,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26395 to 8003. [2019-12-18 15:33:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8003 states. [2019-12-18 15:33:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8003 states to 8003 states and 37166 transitions. [2019-12-18 15:33:20,014 INFO L78 Accepts]: Start accepts. Automaton has 8003 states and 37166 transitions. Word has length 21 [2019-12-18 15:33:20,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:20,014 INFO L462 AbstractCegarLoop]: Abstraction has 8003 states and 37166 transitions. [2019-12-18 15:33:20,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:33:20,014 INFO L276 IsEmpty]: Start isEmpty. Operand 8003 states and 37166 transitions. [2019-12-18 15:33:20,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:33:20,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:20,015 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:20,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:20,216 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:20,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:20,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1820039506, now seen corresponding path program 2 times [2019-12-18 15:33:20,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:20,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730223653] [2019-12-18 15:33:20,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-18 15:33:20,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730223653] [2019-12-18 15:33:20,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724142431] [2019-12-18 15:33:20,279 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:20,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:33:20,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:33:20,359 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:33:20,360 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-18 15:33:20,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:20,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:33:20,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835371495] [2019-12-18 15:33:20,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:33:20,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:20,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:33:20,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:33:20,462 INFO L87 Difference]: Start difference. First operand 8003 states and 37166 transitions. Second operand 16 states. [2019-12-18 15:33:21,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:21,424 INFO L93 Difference]: Finished difference Result 26117 states and 99264 transitions. [2019-12-18 15:33:21,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:21,424 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-18 15:33:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:21,486 INFO L225 Difference]: With dead ends: 26117 [2019-12-18 15:33:21,487 INFO L226 Difference]: Without dead ends: 26111 [2019-12-18 15:33:21,487 INFO L631 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 [2019-12-18 15:33:21,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26111 states. [2019-12-18 15:33:21,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26111 to 7893. [2019-12-18 15:33:21,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7893 states. [2019-12-18 15:33:21,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 36616 transitions. [2019-12-18 15:33:21,933 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 36616 transitions. Word has length 21 [2019-12-18 15:33:21,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:21,934 INFO L462 AbstractCegarLoop]: Abstraction has 7893 states and 36616 transitions. [2019-12-18 15:33:21,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:33:21,934 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 36616 transitions. [2019-12-18 15:33:21,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:33:21,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:21,935 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:22,138 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:22,139 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:22,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:22,139 INFO L82 PathProgramCache]: Analyzing trace with hash -135145800, now seen corresponding path program 3 times [2019-12-18 15:33:22,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:22,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156729735] [2019-12-18 15:33:22,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:33:22,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156729735] [2019-12-18 15:33:22,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:22,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:33:22,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96529072] [2019-12-18 15:33:22,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:33:22,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:22,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:33:22,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:33:22,208 INFO L87 Difference]: Start difference. First operand 7893 states and 36616 transitions. Second operand 9 states. [2019-12-18 15:33:23,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:23,030 INFO L93 Difference]: Finished difference Result 26136 states and 99362 transitions. [2019-12-18 15:33:23,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:23,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 15:33:23,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:23,091 INFO L225 Difference]: With dead ends: 26136 [2019-12-18 15:33:23,091 INFO L226 Difference]: Without dead ends: 26132 [2019-12-18 15:33:23,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:33:23,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26132 states. [2019-12-18 15:33:23,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26132 to 7683. [2019-12-18 15:33:23,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7683 states. [2019-12-18 15:33:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7683 states to 7683 states and 35650 transitions. [2019-12-18 15:33:23,377 INFO L78 Accepts]: Start accepts. Automaton has 7683 states and 35650 transitions. Word has length 21 [2019-12-18 15:33:23,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:23,377 INFO L462 AbstractCegarLoop]: Abstraction has 7683 states and 35650 transitions. [2019-12-18 15:33:23,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:33:23,377 INFO L276 IsEmpty]: Start isEmpty. Operand 7683 states and 35650 transitions. [2019-12-18 15:33:23,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:33:23,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:23,379 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:23,379 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:23,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:23,380 INFO L82 PathProgramCache]: Analyzing trace with hash -127259400, now seen corresponding path program 4 times [2019-12-18 15:33:23,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:23,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493515662] [2019-12-18 15:33:23,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:23,443 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:33:23,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493515662] [2019-12-18 15:33:23,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:23,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:33:23,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857980331] [2019-12-18 15:33:23,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:33:23,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:23,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:33:23,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:33:23,445 INFO L87 Difference]: Start difference. First operand 7683 states and 35650 transitions. Second operand 9 states. [2019-12-18 15:33:24,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:24,248 INFO L93 Difference]: Finished difference Result 25967 states and 98669 transitions. [2019-12-18 15:33:24,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:24,248 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 15:33:24,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:24,471 INFO L225 Difference]: With dead ends: 25967 [2019-12-18 15:33:24,472 INFO L226 Difference]: Without dead ends: 25961 [2019-12-18 15:33:24,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:33:24,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25961 states. [2019-12-18 15:33:24,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25961 to 7577. [2019-12-18 15:33:24,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7577 states. [2019-12-18 15:33:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7577 states to 7577 states and 35112 transitions. [2019-12-18 15:33:24,736 INFO L78 Accepts]: Start accepts. Automaton has 7577 states and 35112 transitions. Word has length 21 [2019-12-18 15:33:24,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:24,737 INFO L462 AbstractCegarLoop]: Abstraction has 7577 states and 35112 transitions. [2019-12-18 15:33:24,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:33:24,737 INFO L276 IsEmpty]: Start isEmpty. Operand 7577 states and 35112 transitions. [2019-12-18 15:33:24,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:33:24,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:24,738 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:24,738 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:24,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:24,738 INFO L82 PathProgramCache]: Analyzing trace with hash 980776630, now seen corresponding path program 1 times [2019-12-18 15:33:24,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:24,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67514255] [2019-12-18 15:33:24,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:33:24,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67514255] [2019-12-18 15:33:24,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:24,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:33:24,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878668666] [2019-12-18 15:33:24,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:33:24,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:24,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:33:24,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:33:24,778 INFO L87 Difference]: Start difference. First operand 7577 states and 35112 transitions. Second operand 5 states. [2019-12-18 15:33:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:24,908 INFO L93 Difference]: Finished difference Result 12960 states and 56912 transitions. [2019-12-18 15:33:24,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:33:24,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 15:33:24,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:24,938 INFO L225 Difference]: With dead ends: 12960 [2019-12-18 15:33:24,938 INFO L226 Difference]: Without dead ends: 12944 [2019-12-18 15:33:24,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:33:24,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12944 states. [2019-12-18 15:33:25,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12944 to 9056. [2019-12-18 15:33:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9056 states. [2019-12-18 15:33:25,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9056 states to 9056 states and 41951 transitions. [2019-12-18 15:33:25,130 INFO L78 Accepts]: Start accepts. Automaton has 9056 states and 41951 transitions. Word has length 21 [2019-12-18 15:33:25,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:25,130 INFO L462 AbstractCegarLoop]: Abstraction has 9056 states and 41951 transitions. [2019-12-18 15:33:25,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:33:25,130 INFO L276 IsEmpty]: Start isEmpty. Operand 9056 states and 41951 transitions. [2019-12-18 15:33:25,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:33:25,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:25,131 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:25,132 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:25,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:25,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1464178168, now seen corresponding path program 5 times [2019-12-18 15:33:25,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:25,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652953195] [2019-12-18 15:33:25,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:33:25,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652953195] [2019-12-18 15:33:25,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:25,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:33:25,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457253308] [2019-12-18 15:33:25,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:33:25,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:25,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:33:25,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:33:25,205 INFO L87 Difference]: Start difference. First operand 9056 states and 41951 transitions. Second operand 9 states. [2019-12-18 15:33:26,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:26,034 INFO L93 Difference]: Finished difference Result 29260 states and 112921 transitions. [2019-12-18 15:33:26,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:26,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 15:33:26,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:26,101 INFO L225 Difference]: With dead ends: 29260 [2019-12-18 15:33:26,101 INFO L226 Difference]: Without dead ends: 29253 [2019-12-18 15:33:26,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:33:26,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29253 states. [2019-12-18 15:33:26,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29253 to 8780. [2019-12-18 15:33:26,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8780 states. [2019-12-18 15:33:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8780 states to 8780 states and 40645 transitions. [2019-12-18 15:33:26,675 INFO L78 Accepts]: Start accepts. Automaton has 8780 states and 40645 transitions. Word has length 21 [2019-12-18 15:33:26,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:26,675 INFO L462 AbstractCegarLoop]: Abstraction has 8780 states and 40645 transitions. [2019-12-18 15:33:26,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:33:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 8780 states and 40645 transitions. [2019-12-18 15:33:26,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:33:26,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:26,677 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:26,677 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:26,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:26,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1466886328, now seen corresponding path program 6 times [2019-12-18 15:33:26,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:26,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972826444] [2019-12-18 15:33:26,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:26,751 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:33:26,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972826444] [2019-12-18 15:33:26,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:26,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:33:26,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829688561] [2019-12-18 15:33:26,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:33:26,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:26,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:33:26,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:33:26,753 INFO L87 Difference]: Start difference. First operand 8780 states and 40645 transitions. Second operand 9 states. [2019-12-18 15:33:27,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:27,601 INFO L93 Difference]: Finished difference Result 28874 states and 111219 transitions. [2019-12-18 15:33:27,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:27,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 15:33:27,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:27,659 INFO L225 Difference]: With dead ends: 28874 [2019-12-18 15:33:27,659 INFO L226 Difference]: Without dead ends: 28864 [2019-12-18 15:33:27,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:33:27,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28864 states. [2019-12-18 15:33:27,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28864 to 8405. [2019-12-18 15:33:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8405 states. [2019-12-18 15:33:27,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8405 states to 8405 states and 38987 transitions. [2019-12-18 15:33:27,964 INFO L78 Accepts]: Start accepts. Automaton has 8405 states and 38987 transitions. Word has length 21 [2019-12-18 15:33:27,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:27,964 INFO L462 AbstractCegarLoop]: Abstraction has 8405 states and 38987 transitions. [2019-12-18 15:33:27,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:33:27,965 INFO L276 IsEmpty]: Start isEmpty. Operand 8405 states and 38987 transitions. [2019-12-18 15:33:27,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:33:27,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:27,967 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:27,967 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:27,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:27,967 INFO L82 PathProgramCache]: Analyzing trace with hash 792940754, now seen corresponding path program 1 times [2019-12-18 15:33:27,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:27,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140175642] [2019-12-18 15:33:27,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-18 15:33:28,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140175642] [2019-12-18 15:33:28,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843079046] [2019-12-18 15:33:28,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:28,099 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-18 15:33:28,100 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:28,157 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-18 15:33:28,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:28,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-18 15:33:28,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489207472] [2019-12-18 15:33:28,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:33:28,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:28,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:33:28,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:33:28,160 INFO L87 Difference]: Start difference. First operand 8405 states and 38987 transitions. Second operand 12 states. [2019-12-18 15:33:28,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:28,570 INFO L93 Difference]: Finished difference Result 19371 states and 79602 transitions. [2019-12-18 15:33:28,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:33:28,570 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-18 15:33:28,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:28,612 INFO L225 Difference]: With dead ends: 19371 [2019-12-18 15:33:28,612 INFO L226 Difference]: Without dead ends: 19359 [2019-12-18 15:33:28,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:33:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19359 states. [2019-12-18 15:33:28,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19359 to 8674. [2019-12-18 15:33:28,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-12-18 15:33:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 40123 transitions. [2019-12-18 15:33:28,839 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 40123 transitions. Word has length 23 [2019-12-18 15:33:28,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:28,839 INFO L462 AbstractCegarLoop]: Abstraction has 8674 states and 40123 transitions. [2019-12-18 15:33:28,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:33:28,839 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 40123 transitions. [2019-12-18 15:33:28,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:33:28,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:28,841 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:29,041 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:29,042 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:29,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:29,042 INFO L82 PathProgramCache]: Analyzing trace with hash 568712663, now seen corresponding path program 1 times [2019-12-18 15:33:29,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:29,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228660754] [2019-12-18 15:33:29,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:29,095 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:33:29,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228660754] [2019-12-18 15:33:29,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133235070] [2019-12-18 15:33:29,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:29,190 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-18 15:33:29,205 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:29,455 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-12-18 15:33:29,505 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:33:29,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:29,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-18 15:33:29,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488956145] [2019-12-18 15:33:29,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:33:29,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:29,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:33:29,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:33:29,507 INFO L87 Difference]: Start difference. First operand 8674 states and 40123 transitions. Second operand 12 states. [2019-12-18 15:33:29,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:30,000 INFO L93 Difference]: Finished difference Result 20307 states and 83553 transitions. [2019-12-18 15:33:30,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:33:30,000 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-18 15:33:30,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:30,044 INFO L225 Difference]: With dead ends: 20307 [2019-12-18 15:33:30,044 INFO L226 Difference]: Without dead ends: 20293 [2019-12-18 15:33:30,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:33:30,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20293 states. [2019-12-18 15:33:30,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20293 to 8934. [2019-12-18 15:33:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8934 states. [2019-12-18 15:33:30,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8934 states to 8934 states and 41293 transitions. [2019-12-18 15:33:30,286 INFO L78 Accepts]: Start accepts. Automaton has 8934 states and 41293 transitions. Word has length 23 [2019-12-18 15:33:30,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:30,286 INFO L462 AbstractCegarLoop]: Abstraction has 8934 states and 41293 transitions. [2019-12-18 15:33:30,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:33:30,287 INFO L276 IsEmpty]: Start isEmpty. Operand 8934 states and 41293 transitions. [2019-12-18 15:33:30,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:33:30,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:30,288 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:30,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:30,489 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:30,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:30,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1942317765, now seen corresponding path program 1 times [2019-12-18 15:33:30,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:30,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127587607] [2019-12-18 15:33:30,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:33:30,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127587607] [2019-12-18 15:33:30,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:30,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:33:30,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631587301] [2019-12-18 15:33:30,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:33:30,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:30,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:33:30,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:33:30,546 INFO L87 Difference]: Start difference. First operand 8934 states and 41293 transitions. Second operand 7 states. [2019-12-18 15:33:30,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:30,984 INFO L93 Difference]: Finished difference Result 21050 states and 86745 transitions. [2019-12-18 15:33:30,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:33:30,985 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 15:33:30,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:31,053 INFO L225 Difference]: With dead ends: 21050 [2019-12-18 15:33:31,053 INFO L226 Difference]: Without dead ends: 21031 [2019-12-18 15:33:31,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:33:31,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21031 states. [2019-12-18 15:33:31,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21031 to 9143. [2019-12-18 15:33:31,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9143 states. [2019-12-18 15:33:31,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9143 states to 9143 states and 42279 transitions. [2019-12-18 15:33:31,313 INFO L78 Accepts]: Start accepts. Automaton has 9143 states and 42279 transitions. Word has length 23 [2019-12-18 15:33:31,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:31,313 INFO L462 AbstractCegarLoop]: Abstraction has 9143 states and 42279 transitions. [2019-12-18 15:33:31,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:33:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 9143 states and 42279 transitions. [2019-12-18 15:33:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:33:31,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:31,316 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:31,316 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:31,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:31,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1928498089, now seen corresponding path program 2 times [2019-12-18 15:33:31,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:31,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849910090] [2019-12-18 15:33:31,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:31,360 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:33:31,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849910090] [2019-12-18 15:33:31,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:31,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:33:31,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703300625] [2019-12-18 15:33:31,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:33:31,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:31,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:33:31,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:33:31,362 INFO L87 Difference]: Start difference. First operand 9143 states and 42279 transitions. Second operand 7 states. [2019-12-18 15:33:31,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:31,701 INFO L93 Difference]: Finished difference Result 21118 states and 87107 transitions. [2019-12-18 15:33:31,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:33:31,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 15:33:31,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:31,751 INFO L225 Difference]: With dead ends: 21118 [2019-12-18 15:33:31,751 INFO L226 Difference]: Without dead ends: 21099 [2019-12-18 15:33:31,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:33:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21099 states. [2019-12-18 15:33:31,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21099 to 9234. [2019-12-18 15:33:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-12-18 15:33:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 42669 transitions. [2019-12-18 15:33:32,015 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 42669 transitions. Word has length 23 [2019-12-18 15:33:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:32,015 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 42669 transitions. [2019-12-18 15:33:32,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:33:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 42669 transitions. [2019-12-18 15:33:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:33:32,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:32,018 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:32,018 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:32,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:32,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1928500910, now seen corresponding path program 2 times [2019-12-18 15:33:32,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:32,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092195078] [2019-12-18 15:33:32,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:33:32,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092195078] [2019-12-18 15:33:32,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:32,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:33:32,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176218017] [2019-12-18 15:33:32,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:33:32,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:32,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:33:32,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:33:32,069 INFO L87 Difference]: Start difference. First operand 9234 states and 42669 transitions. Second operand 7 states. [2019-12-18 15:33:32,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:32,528 INFO L93 Difference]: Finished difference Result 20904 states and 85935 transitions. [2019-12-18 15:33:32,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:33:32,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 15:33:32,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:32,577 INFO L225 Difference]: With dead ends: 20904 [2019-12-18 15:33:32,577 INFO L226 Difference]: Without dead ends: 20885 [2019-12-18 15:33:32,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:33:32,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20885 states. [2019-12-18 15:33:32,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20885 to 9243. [2019-12-18 15:33:32,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9243 states. [2019-12-18 15:33:32,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9243 states to 9243 states and 42683 transitions. [2019-12-18 15:33:32,824 INFO L78 Accepts]: Start accepts. Automaton has 9243 states and 42683 transitions. Word has length 23 [2019-12-18 15:33:32,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:32,824 INFO L462 AbstractCegarLoop]: Abstraction has 9243 states and 42683 transitions. [2019-12-18 15:33:32,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:33:32,824 INFO L276 IsEmpty]: Start isEmpty. Operand 9243 states and 42683 transitions. [2019-12-18 15:33:32,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:33:32,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:32,827 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:32,827 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:32,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:32,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1928509125, now seen corresponding path program 2 times [2019-12-18 15:33:32,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:32,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812658264] [2019-12-18 15:33:32,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:32,878 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:33:32,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812658264] [2019-12-18 15:33:32,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:32,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:33:32,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980546754] [2019-12-18 15:33:32,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:33:32,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:32,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:33:32,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:33:32,880 INFO L87 Difference]: Start difference. First operand 9243 states and 42683 transitions. Second operand 7 states. [2019-12-18 15:33:33,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:33,249 INFO L93 Difference]: Finished difference Result 20784 states and 85269 transitions. [2019-12-18 15:33:33,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:33:33,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 15:33:33,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:33,297 INFO L225 Difference]: With dead ends: 20784 [2019-12-18 15:33:33,297 INFO L226 Difference]: Without dead ends: 20765 [2019-12-18 15:33:33,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:33:33,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20765 states. [2019-12-18 15:33:33,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20765 to 9286. [2019-12-18 15:33:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9286 states. [2019-12-18 15:33:33,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 42799 transitions. [2019-12-18 15:33:33,561 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 42799 transitions. Word has length 23 [2019-12-18 15:33:33,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:33,561 INFO L462 AbstractCegarLoop]: Abstraction has 9286 states and 42799 transitions. [2019-12-18 15:33:33,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:33:33,561 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 42799 transitions. [2019-12-18 15:33:33,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:33:33,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:33,564 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:33,565 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:33,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:33,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1810061765, now seen corresponding path program 1 times [2019-12-18 15:33:33,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:33,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343203693] [2019-12-18 15:33:33,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:33,624 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-18 15:33:33,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343203693] [2019-12-18 15:33:33,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405079298] [2019-12-18 15:33:33,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:33,699 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:33:33,700 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:33,796 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-18 15:33:33,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:33,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:33:33,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798604904] [2019-12-18 15:33:33,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:33:33,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:33,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:33:33,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:33:33,798 INFO L87 Difference]: Start difference. First operand 9286 states and 42799 transitions. Second operand 16 states. [2019-12-18 15:33:34,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:34,733 INFO L93 Difference]: Finished difference Result 29793 states and 115235 transitions. [2019-12-18 15:33:34,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:34,734 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-18 15:33:34,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:34,800 INFO L225 Difference]: With dead ends: 29793 [2019-12-18 15:33:34,800 INFO L226 Difference]: Without dead ends: 29783 [2019-12-18 15:33:34,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:33:34,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29783 states. [2019-12-18 15:33:35,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29783 to 9208. [2019-12-18 15:33:35,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9208 states. [2019-12-18 15:33:35,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9208 states to 9208 states and 42351 transitions. [2019-12-18 15:33:35,352 INFO L78 Accepts]: Start accepts. Automaton has 9208 states and 42351 transitions. Word has length 25 [2019-12-18 15:33:35,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:35,353 INFO L462 AbstractCegarLoop]: Abstraction has 9208 states and 42351 transitions. [2019-12-18 15:33:35,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:33:35,353 INFO L276 IsEmpty]: Start isEmpty. Operand 9208 states and 42351 transitions. [2019-12-18 15:33:35,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:33:35,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:35,356 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:35,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:35,557 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:35,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:35,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1820667361, now seen corresponding path program 1 times [2019-12-18 15:33:35,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:35,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321135939] [2019-12-18 15:33:35,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:35,625 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-18 15:33:35,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321135939] [2019-12-18 15:33:35,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822617594] [2019-12-18 15:33:35,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:35,703 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:33:35,704 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:35,801 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-18 15:33:35,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:35,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:33:35,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435409451] [2019-12-18 15:33:35,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:33:35,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:35,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:33:35,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:33:35,803 INFO L87 Difference]: Start difference. First operand 9208 states and 42351 transitions. Second operand 16 states. [2019-12-18 15:33:36,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:36,790 INFO L93 Difference]: Finished difference Result 29371 states and 113449 transitions. [2019-12-18 15:33:36,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:36,791 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-18 15:33:36,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:36,853 INFO L225 Difference]: With dead ends: 29371 [2019-12-18 15:33:36,853 INFO L226 Difference]: Without dead ends: 29361 [2019-12-18 15:33:36,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:33:36,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29361 states. [2019-12-18 15:33:37,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29361 to 9154. [2019-12-18 15:33:37,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9154 states. [2019-12-18 15:33:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9154 states to 9154 states and 42049 transitions. [2019-12-18 15:33:37,187 INFO L78 Accepts]: Start accepts. Automaton has 9154 states and 42049 transitions. Word has length 25 [2019-12-18 15:33:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:37,187 INFO L462 AbstractCegarLoop]: Abstraction has 9154 states and 42049 transitions. [2019-12-18 15:33:37,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:33:37,187 INFO L276 IsEmpty]: Start isEmpty. Operand 9154 states and 42049 transitions. [2019-12-18 15:33:37,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:33:37,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:37,190 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:37,391 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:37,391 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:37,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:37,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1806847685, now seen corresponding path program 2 times [2019-12-18 15:33:37,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:37,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806605214] [2019-12-18 15:33:37,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-18 15:33:37,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806605214] [2019-12-18 15:33:37,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447406912] [2019-12-18 15:33:37,455 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:37,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:33:37,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:33:37,533 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:33:37,534 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:37,624 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-18 15:33:37,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:37,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:33:37,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778840385] [2019-12-18 15:33:37,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:33:37,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:37,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:33:37,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:33:37,627 INFO L87 Difference]: Start difference. First operand 9154 states and 42049 transitions. Second operand 16 states. [2019-12-18 15:33:38,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:38,593 INFO L93 Difference]: Finished difference Result 28955 states and 111688 transitions. [2019-12-18 15:33:38,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:38,594 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-18 15:33:38,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:38,656 INFO L225 Difference]: With dead ends: 28955 [2019-12-18 15:33:38,656 INFO L226 Difference]: Without dead ends: 28944 [2019-12-18 15:33:38,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:33:38,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28944 states. [2019-12-18 15:33:38,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28944 to 9151. [2019-12-18 15:33:38,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9151 states. [2019-12-18 15:33:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9151 states to 9151 states and 41998 transitions. [2019-12-18 15:33:38,994 INFO L78 Accepts]: Start accepts. Automaton has 9151 states and 41998 transitions. Word has length 25 [2019-12-18 15:33:38,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:38,994 INFO L462 AbstractCegarLoop]: Abstraction has 9151 states and 41998 transitions. [2019-12-18 15:33:38,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:33:38,995 INFO L276 IsEmpty]: Start isEmpty. Operand 9151 states and 41998 transitions. [2019-12-18 15:33:38,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:33:38,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:38,998 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:39,198 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:39,198 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:39,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:39,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1806858721, now seen corresponding path program 2 times [2019-12-18 15:33:39,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:39,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907245718] [2019-12-18 15:33:39,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-18 15:33:39,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907245718] [2019-12-18 15:33:39,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858808229] [2019-12-18 15:33:39,259 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:39,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:33:39,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:33:39,347 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:33:39,348 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-18 15:33:39,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:39,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:33:39,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605314601] [2019-12-18 15:33:39,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:33:39,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:39,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:33:39,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:33:39,442 INFO L87 Difference]: Start difference. First operand 9151 states and 41998 transitions. Second operand 16 states. [2019-12-18 15:33:40,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:40,511 INFO L93 Difference]: Finished difference Result 28625 states and 110367 transitions. [2019-12-18 15:33:40,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:40,511 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-18 15:33:40,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:40,571 INFO L225 Difference]: With dead ends: 28625 [2019-12-18 15:33:40,572 INFO L226 Difference]: Without dead ends: 28614 [2019-12-18 15:33:40,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:33:40,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28614 states. [2019-12-18 15:33:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28614 to 9044. [2019-12-18 15:33:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-12-18 15:33:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 41462 transitions. [2019-12-18 15:33:40,873 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 41462 transitions. Word has length 25 [2019-12-18 15:33:40,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:40,873 INFO L462 AbstractCegarLoop]: Abstraction has 9044 states and 41462 transitions. [2019-12-18 15:33:40,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:33:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 41462 transitions. [2019-12-18 15:33:40,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:33:40,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:40,876 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:41,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:41,077 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:41,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:41,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1077942095, now seen corresponding path program 3 times [2019-12-18 15:33:41,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:41,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512416069] [2019-12-18 15:33:41,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:33:41,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512416069] [2019-12-18 15:33:41,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708949630] [2019-12-18 15:33:41,157 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:41,247 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 15:33:41,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:33:41,248 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:33:41,249 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:33:41,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:41,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:33:41,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169019172] [2019-12-18 15:33:41,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:33:41,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:41,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:33:41,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:33:41,360 INFO L87 Difference]: Start difference. First operand 9044 states and 41462 transitions. Second operand 16 states. [2019-12-18 15:33:42,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:42,304 INFO L93 Difference]: Finished difference Result 28739 states and 110779 transitions. [2019-12-18 15:33:42,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:42,304 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-18 15:33:42,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:42,366 INFO L225 Difference]: With dead ends: 28739 [2019-12-18 15:33:42,366 INFO L226 Difference]: Without dead ends: 28729 [2019-12-18 15:33:42,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:33:42,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28729 states. [2019-12-18 15:33:42,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28729 to 8878. [2019-12-18 15:33:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8878 states. [2019-12-18 15:33:42,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 40685 transitions. [2019-12-18 15:33:42,682 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 40685 transitions. Word has length 25 [2019-12-18 15:33:42,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:42,682 INFO L462 AbstractCegarLoop]: Abstraction has 8878 states and 40685 transitions. [2019-12-18 15:33:42,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:33:42,682 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 40685 transitions. [2019-12-18 15:33:42,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:33:42,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:42,685 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:42,886 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:42,886 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:42,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:42,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1085836710, now seen corresponding path program 1 times [2019-12-18 15:33:42,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:42,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868238787] [2019-12-18 15:33:42,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:33:42,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868238787] [2019-12-18 15:33:42,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222223791] [2019-12-18 15:33:42,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:43,057 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:33:43,058 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:43,147 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:33:43,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:43,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:33:43,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162627082] [2019-12-18 15:33:43,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:33:43,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:43,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:33:43,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:33:43,149 INFO L87 Difference]: Start difference. First operand 8878 states and 40685 transitions. Second operand 16 states. [2019-12-18 15:33:44,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:44,214 INFO L93 Difference]: Finished difference Result 29134 states and 112632 transitions. [2019-12-18 15:33:44,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:44,215 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-18 15:33:44,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:44,281 INFO L225 Difference]: With dead ends: 29134 [2019-12-18 15:33:44,281 INFO L226 Difference]: Without dead ends: 29124 [2019-12-18 15:33:44,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:33:44,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29124 states. [2019-12-18 15:33:44,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29124 to 8860. [2019-12-18 15:33:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8860 states. [2019-12-18 15:33:44,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8860 states to 8860 states and 40559 transitions. [2019-12-18 15:33:44,734 INFO L78 Accepts]: Start accepts. Automaton has 8860 states and 40559 transitions. Word has length 25 [2019-12-18 15:33:44,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:44,735 INFO L462 AbstractCegarLoop]: Abstraction has 8860 states and 40559 transitions. [2019-12-18 15:33:44,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:33:44,735 INFO L276 IsEmpty]: Start isEmpty. Operand 8860 states and 40559 transitions. [2019-12-18 15:33:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:33:44,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:44,738 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:44,938 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:44,939 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:44,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:44,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1072019855, now seen corresponding path program 4 times [2019-12-18 15:33:44,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:44,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555847514] [2019-12-18 15:33:44,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:33:44,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555847514] [2019-12-18 15:33:44,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257278875] [2019-12-18 15:33:44,999 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:45,086 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:33:45,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:33:45,087 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:33:45,088 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:45,185 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:33:45,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:45,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:33:45,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701817098] [2019-12-18 15:33:45,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:33:45,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:45,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:33:45,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:33:45,186 INFO L87 Difference]: Start difference. First operand 8860 states and 40559 transitions. Second operand 16 states. [2019-12-18 15:33:46,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:46,178 INFO L93 Difference]: Finished difference Result 28595 states and 110187 transitions. [2019-12-18 15:33:46,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:46,178 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-18 15:33:46,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:46,243 INFO L225 Difference]: With dead ends: 28595 [2019-12-18 15:33:46,243 INFO L226 Difference]: Without dead ends: 28584 [2019-12-18 15:33:46,244 INFO L631 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 [2019-12-18 15:33:46,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28584 states. [2019-12-18 15:33:46,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28584 to 8857. [2019-12-18 15:33:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8857 states. [2019-12-18 15:33:46,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8857 states to 8857 states and 40508 transitions. [2019-12-18 15:33:46,553 INFO L78 Accepts]: Start accepts. Automaton has 8857 states and 40508 transitions. Word has length 25 [2019-12-18 15:33:46,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:46,553 INFO L462 AbstractCegarLoop]: Abstraction has 8857 states and 40508 transitions. [2019-12-18 15:33:46,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:33:46,553 INFO L276 IsEmpty]: Start isEmpty. Operand 8857 states and 40508 transitions. [2019-12-18 15:33:46,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:33:46,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:46,557 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:46,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:46,758 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:46,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:46,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1072028070, now seen corresponding path program 2 times [2019-12-18 15:33:46,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:46,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942430004] [2019-12-18 15:33:46,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:33:46,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942430004] [2019-12-18 15:33:46,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243716813] [2019-12-18 15:33:46,837 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:46,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:33:46,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:33:46,927 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:33:46,928 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:33:47,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:47,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:33:47,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510555009] [2019-12-18 15:33:47,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:33:47,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:47,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:33:47,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:33:47,004 INFO L87 Difference]: Start difference. First operand 8857 states and 40508 transitions. Second operand 16 states. [2019-12-18 15:33:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:48,034 INFO L93 Difference]: Finished difference Result 28468 states and 109859 transitions. [2019-12-18 15:33:48,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:48,035 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-18 15:33:48,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:48,100 INFO L225 Difference]: With dead ends: 28468 [2019-12-18 15:33:48,101 INFO L226 Difference]: Without dead ends: 28454 [2019-12-18 15:33:48,101 INFO L631 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 [2019-12-18 15:33:48,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28454 states. [2019-12-18 15:33:48,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28454 to 8722. [2019-12-18 15:33:48,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8722 states. [2019-12-18 15:33:48,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8722 states to 8722 states and 39857 transitions. [2019-12-18 15:33:48,401 INFO L78 Accepts]: Start accepts. Automaton has 8722 states and 39857 transitions. Word has length 25 [2019-12-18 15:33:48,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:48,402 INFO L462 AbstractCegarLoop]: Abstraction has 8722 states and 39857 transitions. [2019-12-18 15:33:48,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:33:48,402 INFO L276 IsEmpty]: Start isEmpty. Operand 8722 states and 39857 transitions. [2019-12-18 15:33:48,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:33:48,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:48,405 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:48,606 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:48,606 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:48,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:48,607 INFO L82 PathProgramCache]: Analyzing trace with hash 2071430200, now seen corresponding path program 1 times [2019-12-18 15:33:48,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:48,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920113927] [2019-12-18 15:33:48,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:48,641 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-18 15:33:48,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920113927] [2019-12-18 15:33:48,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:48,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:33:48,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194898786] [2019-12-18 15:33:48,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:33:48,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:48,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:33:48,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:33:48,642 INFO L87 Difference]: Start difference. First operand 8722 states and 39857 transitions. Second operand 5 states. [2019-12-18 15:33:48,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:48,811 INFO L93 Difference]: Finished difference Result 14188 states and 62117 transitions. [2019-12-18 15:33:48,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:33:48,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 15:33:48,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:48,843 INFO L225 Difference]: With dead ends: 14188 [2019-12-18 15:33:48,843 INFO L226 Difference]: Without dead ends: 14156 [2019-12-18 15:33:48,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:33:48,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14156 states. [2019-12-18 15:33:49,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14156 to 10325. [2019-12-18 15:33:49,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10325 states. [2019-12-18 15:33:49,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10325 states to 10325 states and 46869 transitions. [2019-12-18 15:33:49,098 INFO L78 Accepts]: Start accepts. Automaton has 10325 states and 46869 transitions. Word has length 25 [2019-12-18 15:33:49,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:49,098 INFO L462 AbstractCegarLoop]: Abstraction has 10325 states and 46869 transitions. [2019-12-18 15:33:49,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:33:49,098 INFO L276 IsEmpty]: Start isEmpty. Operand 10325 states and 46869 transitions. [2019-12-18 15:33:49,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:33:49,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:49,101 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:49,101 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:49,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:49,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1740193032, now seen corresponding path program 3 times [2019-12-18 15:33:49,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:49,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585801195] [2019-12-18 15:33:49,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:49,289 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:33:49,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585801195] [2019-12-18 15:33:49,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:49,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:33:49,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772663693] [2019-12-18 15:33:49,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:33:49,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:49,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:33:49,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:33:49,291 INFO L87 Difference]: Start difference. First operand 10325 states and 46869 transitions. Second operand 9 states. [2019-12-18 15:33:50,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:50,149 INFO L93 Difference]: Finished difference Result 31989 states and 124702 transitions. [2019-12-18 15:33:50,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:50,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 15:33:50,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:50,220 INFO L225 Difference]: With dead ends: 31989 [2019-12-18 15:33:50,220 INFO L226 Difference]: Without dead ends: 31973 [2019-12-18 15:33:50,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:33:50,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31973 states. [2019-12-18 15:33:50,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31973 to 10175. [2019-12-18 15:33:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10175 states. [2019-12-18 15:33:50,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10175 states to 10175 states and 46142 transitions. [2019-12-18 15:33:50,580 INFO L78 Accepts]: Start accepts. Automaton has 10175 states and 46142 transitions. Word has length 25 [2019-12-18 15:33:50,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:50,580 INFO L462 AbstractCegarLoop]: Abstraction has 10175 states and 46142 transitions. [2019-12-18 15:33:50,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:33:50,580 INFO L276 IsEmpty]: Start isEmpty. Operand 10175 states and 46142 transitions. [2019-12-18 15:33:50,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:33:50,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:50,584 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:50,584 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:50,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:50,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1737482051, now seen corresponding path program 3 times [2019-12-18 15:33:50,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:50,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322088922] [2019-12-18 15:33:50,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:33:50,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322088922] [2019-12-18 15:33:50,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:50,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:33:50,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71988725] [2019-12-18 15:33:50,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:33:50,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:50,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:33:50,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:33:50,652 INFO L87 Difference]: Start difference. First operand 10175 states and 46142 transitions. Second operand 9 states. [2019-12-18 15:33:51,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:51,546 INFO L93 Difference]: Finished difference Result 31605 states and 123025 transitions. [2019-12-18 15:33:51,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:51,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 15:33:51,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:51,613 INFO L225 Difference]: With dead ends: 31605 [2019-12-18 15:33:51,613 INFO L226 Difference]: Without dead ends: 31589 [2019-12-18 15:33:51,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:33:51,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31589 states. [2019-12-18 15:33:51,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31589 to 10057. [2019-12-18 15:33:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10057 states. [2019-12-18 15:33:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10057 states to 10057 states and 45612 transitions. [2019-12-18 15:33:51,947 INFO L78 Accepts]: Start accepts. Automaton has 10057 states and 45612 transitions. Word has length 25 [2019-12-18 15:33:51,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:51,947 INFO L462 AbstractCegarLoop]: Abstraction has 10057 states and 45612 transitions. [2019-12-18 15:33:51,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:33:51,947 INFO L276 IsEmpty]: Start isEmpty. Operand 10057 states and 45612 transitions. [2019-12-18 15:33:51,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:33:51,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:51,950 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:51,951 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:51,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:51,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1743407112, now seen corresponding path program 4 times [2019-12-18 15:33:51,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:51,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924910343] [2019-12-18 15:33:51,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:33:52,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924910343] [2019-12-18 15:33:52,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:52,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:33:52,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918594460] [2019-12-18 15:33:52,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:33:52,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:52,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:33:52,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:33:52,019 INFO L87 Difference]: Start difference. First operand 10057 states and 45612 transitions. Second operand 9 states. [2019-12-18 15:33:52,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:52,949 INFO L93 Difference]: Finished difference Result 31999 states and 124705 transitions. [2019-12-18 15:33:52,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:52,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 15:33:52,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:53,028 INFO L225 Difference]: With dead ends: 31999 [2019-12-18 15:33:53,028 INFO L226 Difference]: Without dead ends: 31979 [2019-12-18 15:33:53,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:33:53,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31979 states. [2019-12-18 15:33:53,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31979 to 10010. [2019-12-18 15:33:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10010 states. [2019-12-18 15:33:53,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10010 states to 10010 states and 45376 transitions. [2019-12-18 15:33:53,396 INFO L78 Accepts]: Start accepts. Automaton has 10010 states and 45376 transitions. Word has length 25 [2019-12-18 15:33:53,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:53,396 INFO L462 AbstractCegarLoop]: Abstraction has 10010 states and 45376 transitions. [2019-12-18 15:33:53,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:33:53,396 INFO L276 IsEmpty]: Start isEmpty. Operand 10010 states and 45376 transitions. [2019-12-18 15:33:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:33:53,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:53,399 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:53,400 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:53,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1743404291, now seen corresponding path program 4 times [2019-12-18 15:33:53,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:53,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602502177] [2019-12-18 15:33:53,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:53,577 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-12-18 15:33:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:33:53,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602502177] [2019-12-18 15:33:53,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:53,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:33:53,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031999762] [2019-12-18 15:33:53,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:33:53,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:53,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:33:53,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:33:53,617 INFO L87 Difference]: Start difference. First operand 10010 states and 45376 transitions. Second operand 9 states. [2019-12-18 15:33:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:54,496 INFO L93 Difference]: Finished difference Result 31576 states and 122968 transitions. [2019-12-18 15:33:54,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:54,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 15:33:54,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:54,569 INFO L225 Difference]: With dead ends: 31576 [2019-12-18 15:33:54,569 INFO L226 Difference]: Without dead ends: 31556 [2019-12-18 15:33:54,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:33:54,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31556 states. [2019-12-18 15:33:54,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31556 to 9827. [2019-12-18 15:33:54,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9827 states. [2019-12-18 15:33:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9827 states to 9827 states and 44489 transitions. [2019-12-18 15:33:54,913 INFO L78 Accepts]: Start accepts. Automaton has 9827 states and 44489 transitions. Word has length 25 [2019-12-18 15:33:54,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:54,913 INFO L462 AbstractCegarLoop]: Abstraction has 9827 states and 44489 transitions. [2019-12-18 15:33:54,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:33:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand 9827 states and 44489 transitions. [2019-12-18 15:33:54,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:33:54,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:54,917 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:54,917 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:54,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:54,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2139211039, now seen corresponding path program 5 times [2019-12-18 15:33:54,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:54,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966672279] [2019-12-18 15:33:54,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:54,993 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:33:54,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966672279] [2019-12-18 15:33:54,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:54,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:33:54,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468760606] [2019-12-18 15:33:54,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:33:54,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:54,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:33:54,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:33:54,995 INFO L87 Difference]: Start difference. First operand 9827 states and 44489 transitions. Second operand 9 states. [2019-12-18 15:33:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:55,863 INFO L93 Difference]: Finished difference Result 31623 states and 123094 transitions. [2019-12-18 15:33:55,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:55,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 15:33:55,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:55,939 INFO L225 Difference]: With dead ends: 31623 [2019-12-18 15:33:55,939 INFO L226 Difference]: Without dead ends: 31607 [2019-12-18 15:33:55,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:33:55,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31607 states. [2019-12-18 15:33:56,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31607 to 9671. [2019-12-18 15:33:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9671 states. [2019-12-18 15:33:56,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9671 states to 9671 states and 43725 transitions. [2019-12-18 15:33:56,275 INFO L78 Accepts]: Start accepts. Automaton has 9671 states and 43725 transitions. Word has length 25 [2019-12-18 15:33:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:56,276 INFO L462 AbstractCegarLoop]: Abstraction has 9671 states and 43725 transitions. [2019-12-18 15:33:56,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:33:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand 9671 states and 43725 transitions. [2019-12-18 15:33:56,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:33:56,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:56,279 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:56,279 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:56,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:56,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2139202824, now seen corresponding path program 5 times [2019-12-18 15:33:56,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:56,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962604165] [2019-12-18 15:33:56,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:33:56,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962604165] [2019-12-18 15:33:56,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:56,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:33:56,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924639402] [2019-12-18 15:33:56,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:33:56,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:56,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:33:56,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:33:56,346 INFO L87 Difference]: Start difference. First operand 9671 states and 43725 transitions. Second operand 9 states. [2019-12-18 15:33:57,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:57,207 INFO L93 Difference]: Finished difference Result 31103 states and 120876 transitions. [2019-12-18 15:33:57,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:57,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 15:33:57,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:57,276 INFO L225 Difference]: With dead ends: 31103 [2019-12-18 15:33:57,276 INFO L226 Difference]: Without dead ends: 31087 [2019-12-18 15:33:57,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:33:57,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31087 states. [2019-12-18 15:33:57,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31087 to 9503. [2019-12-18 15:33:57,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9503 states. [2019-12-18 15:33:57,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9503 states to 9503 states and 42917 transitions. [2019-12-18 15:33:57,605 INFO L78 Accepts]: Start accepts. Automaton has 9503 states and 42917 transitions. Word has length 25 [2019-12-18 15:33:57,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:57,605 INFO L462 AbstractCegarLoop]: Abstraction has 9503 states and 42917 transitions. [2019-12-18 15:33:57,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:33:57,606 INFO L276 IsEmpty]: Start isEmpty. Operand 9503 states and 42917 transitions. [2019-12-18 15:33:57,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:33:57,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:57,609 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:57,609 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:57,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:57,609 INFO L82 PathProgramCache]: Analyzing trace with hash -2136502879, now seen corresponding path program 6 times [2019-12-18 15:33:57,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:57,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627585429] [2019-12-18 15:33:57,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:57,672 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:33:57,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627585429] [2019-12-18 15:33:57,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:57,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:33:57,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096162654] [2019-12-18 15:33:57,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:33:57,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:57,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:33:57,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:33:57,674 INFO L87 Difference]: Start difference. First operand 9503 states and 42917 transitions. Second operand 9 states. [2019-12-18 15:33:58,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:58,523 INFO L93 Difference]: Finished difference Result 30789 states and 119448 transitions. [2019-12-18 15:33:58,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:58,523 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 15:33:58,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:58,593 INFO L225 Difference]: With dead ends: 30789 [2019-12-18 15:33:58,593 INFO L226 Difference]: Without dead ends: 30769 [2019-12-18 15:33:58,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:33:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30769 states. [2019-12-18 15:33:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30769 to 9172. [2019-12-18 15:33:59,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9172 states. [2019-12-18 15:33:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9172 states to 9172 states and 41398 transitions. [2019-12-18 15:33:59,049 INFO L78 Accepts]: Start accepts. Automaton has 9172 states and 41398 transitions. Word has length 25 [2019-12-18 15:33:59,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:59,050 INFO L462 AbstractCegarLoop]: Abstraction has 9172 states and 41398 transitions. [2019-12-18 15:33:59,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:33:59,050 INFO L276 IsEmpty]: Start isEmpty. Operand 9172 states and 41398 transitions. [2019-12-18 15:33:59,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:33:59,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:59,053 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:59,053 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:33:59,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:59,053 INFO L82 PathProgramCache]: Analyzing trace with hash -2136491843, now seen corresponding path program 5 times [2019-12-18 15:33:59,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:59,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820576039] [2019-12-18 15:33:59,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:33:59,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820576039] [2019-12-18 15:33:59,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:33:59,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:33:59,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540067698] [2019-12-18 15:33:59,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:33:59,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:59,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:33:59,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:33:59,116 INFO L87 Difference]: Start difference. First operand 9172 states and 41398 transitions. Second operand 9 states. [2019-12-18 15:33:59,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:59,987 INFO L93 Difference]: Finished difference Result 30398 states and 117772 transitions. [2019-12-18 15:33:59,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:33:59,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 15:33:59,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:00,056 INFO L225 Difference]: With dead ends: 30398 [2019-12-18 15:34:00,057 INFO L226 Difference]: Without dead ends: 30382 [2019-12-18 15:34:00,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:34:00,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30382 states. [2019-12-18 15:34:00,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30382 to 9066. [2019-12-18 15:34:00,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9066 states. [2019-12-18 15:34:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9066 states to 9066 states and 40900 transitions. [2019-12-18 15:34:00,385 INFO L78 Accepts]: Start accepts. Automaton has 9066 states and 40900 transitions. Word has length 25 [2019-12-18 15:34:00,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:34:00,385 INFO L462 AbstractCegarLoop]: Abstraction has 9066 states and 40900 transitions. [2019-12-18 15:34:00,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:34:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 9066 states and 40900 transitions. [2019-12-18 15:34:00,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:34:00,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:00,388 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:34:00,388 INFO L410 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:00,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:00,389 INFO L82 PathProgramCache]: Analyzing trace with hash -2128608264, now seen corresponding path program 6 times [2019-12-18 15:34:00,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:00,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794016481] [2019-12-18 15:34:00,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:00,472 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:34:00,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794016481] [2019-12-18 15:34:00,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:34:00,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:34:00,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956622591] [2019-12-18 15:34:00,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:34:00,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:00,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:34:00,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:34:00,474 INFO L87 Difference]: Start difference. First operand 9066 states and 40900 transitions. Second operand 9 states. [2019-12-18 15:34:01,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:34:01,448 INFO L93 Difference]: Finished difference Result 30130 states and 116617 transitions. [2019-12-18 15:34:01,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:34:01,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 15:34:01,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:01,521 INFO L225 Difference]: With dead ends: 30130 [2019-12-18 15:34:01,522 INFO L226 Difference]: Without dead ends: 30110 [2019-12-18 15:34:01,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:34:01,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30110 states. [2019-12-18 15:34:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30110 to 8819. [2019-12-18 15:34:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8819 states. [2019-12-18 15:34:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8819 states to 8819 states and 39792 transitions. [2019-12-18 15:34:01,856 INFO L78 Accepts]: Start accepts. Automaton has 8819 states and 39792 transitions. Word has length 25 [2019-12-18 15:34:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:34:01,856 INFO L462 AbstractCegarLoop]: Abstraction has 8819 states and 39792 transitions. [2019-12-18 15:34:01,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:34:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 8819 states and 39792 transitions. [2019-12-18 15:34:01,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:34:01,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:01,859 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:34:01,859 INFO L410 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:01,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:01,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2128605443, now seen corresponding path program 6 times [2019-12-18 15:34:01,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:01,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311889294] [2019-12-18 15:34:01,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:34:01,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311889294] [2019-12-18 15:34:01,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:34:01,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:34:01,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679094747] [2019-12-18 15:34:01,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:34:01,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:01,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:34:01,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:34:01,911 INFO L87 Difference]: Start difference. First operand 8819 states and 39792 transitions. Second operand 9 states. [2019-12-18 15:34:02,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:34:02,857 INFO L93 Difference]: Finished difference Result 29741 states and 115009 transitions. [2019-12-18 15:34:02,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:34:02,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 15:34:02,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:02,921 INFO L225 Difference]: With dead ends: 29741 [2019-12-18 15:34:02,922 INFO L226 Difference]: Without dead ends: 29721 [2019-12-18 15:34:02,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:34:02,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29721 states. [2019-12-18 15:34:03,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29721 to 8516. [2019-12-18 15:34:03,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8516 states. [2019-12-18 15:34:03,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8516 states to 8516 states and 38438 transitions. [2019-12-18 15:34:03,228 INFO L78 Accepts]: Start accepts. Automaton has 8516 states and 38438 transitions. Word has length 25 [2019-12-18 15:34:03,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:34:03,228 INFO L462 AbstractCegarLoop]: Abstraction has 8516 states and 38438 transitions. [2019-12-18 15:34:03,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:34:03,229 INFO L276 IsEmpty]: Start isEmpty. Operand 8516 states and 38438 transitions. [2019-12-18 15:34:03,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 15:34:03,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:03,233 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:34:03,234 INFO L410 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:03,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:03,234 INFO L82 PathProgramCache]: Analyzing trace with hash -214879977, now seen corresponding path program 1 times [2019-12-18 15:34:03,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:03,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747952500] [2019-12-18 15:34:03,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:34:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:34:03,255 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:34:03,256 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:34:03,256 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 15:34:03,256 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-18 15:34:03,276 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,276 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,276 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,276 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,276 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,276 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,277 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,277 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,277 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,277 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,277 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,277 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,277 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,277 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,278 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,278 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,278 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,278 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,278 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,278 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,278 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,279 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,279 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,279 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,279 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,279 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,279 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,279 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,280 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,280 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,280 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,280 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,280 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,280 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,280 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,281 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,281 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,281 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,281 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,281 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,281 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,281 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,282 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,282 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,282 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,282 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,282 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,282 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,282 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,283 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,283 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,283 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,283 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,283 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,283 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,283 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,284 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,284 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,284 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,284 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,284 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,284 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,284 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,285 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,285 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,285 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,285 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,285 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,285 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,285 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,286 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,286 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,286 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,286 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,286 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,286 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,286 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,287 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,287 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,287 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,287 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,287 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,287 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,288 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,288 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,288 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,288 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,288 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,288 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,288 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,288 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,289 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,289 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,289 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,289 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,289 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,289 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,290 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,290 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,290 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,290 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,290 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,291 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,291 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,291 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,291 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,291 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,292 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,293 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,293 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,293 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,293 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,294 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,294 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,294 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,294 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,294 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,295 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,296 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,296 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,296 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,296 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,297 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,297 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,297 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,297 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,297 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,298 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,299 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,299 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,299 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,299 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,300 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,300 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,300 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,300 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,300 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,301 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,301 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,302 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,302 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,302 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,302 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,302 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,303 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,303 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,303 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,303 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,304 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,304 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,305 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,305 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,305 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,305 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,305 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,305 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,306 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,306 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,307 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,307 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,307 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,307 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,308 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,308 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,308 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,308 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,309 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,309 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:34:03,310 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-12-18 15:34:03,310 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:34:03,310 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:34:03,310 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:34:03,310 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:34:03,310 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:34:03,310 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:34:03,310 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:34:03,311 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:34:03,312 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 133 transitions [2019-12-18 15:34:03,312 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 152 places, 133 transitions [2019-12-18 15:34:03,333 INFO L126 PetriNetUnfolder]: 8/168 cut-off events. [2019-12-18 15:34:03,333 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:34:03,336 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 168 events. 8/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 260 event pairs. 108/260 useless extension candidates. Maximal degree in co-relation 203. Up to 14 conditions per place. [2019-12-18 15:34:03,344 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 152 places, 133 transitions [2019-12-18 15:34:03,363 INFO L126 PetriNetUnfolder]: 8/168 cut-off events. [2019-12-18 15:34:03,363 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:34:03,366 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 168 events. 8/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 260 event pairs. 108/260 useless extension candidates. Maximal degree in co-relation 203. Up to 14 conditions per place. [2019-12-18 15:34:03,373 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2832 [2019-12-18 15:34:03,373 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:34:05,353 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-12-18 15:34:05,570 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-18 15:34:05,770 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-12-18 15:34:05,865 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3471 [2019-12-18 15:34:05,865 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 15:34:05,865 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 45 transitions [2019-12-18 15:34:07,106 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2019-12-18 15:34:07,107 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2019-12-18 15:34:07,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 15:34:07,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:07,107 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 15:34:07,107 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:07,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:07,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1229452, now seen corresponding path program 1 times [2019-12-18 15:34:07,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:07,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234618276] [2019-12-18 15:34:07,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:34:07,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234618276] [2019-12-18 15:34:07,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:34:07,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:34:07,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920167022] [2019-12-18 15:34:07,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:34:07,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:07,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:34:07,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:34:07,125 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2019-12-18 15:34:07,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:34:07,253 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2019-12-18 15:34:07,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:34:07,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 15:34:07,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:07,304 INFO L225 Difference]: With dead ends: 17885 [2019-12-18 15:34:07,305 INFO L226 Difference]: Without dead ends: 16791 [2019-12-18 15:34:07,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:34:07,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2019-12-18 15:34:07,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16189. [2019-12-18 15:34:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16189 states. [2019-12-18 15:34:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16189 states to 16189 states and 84585 transitions. [2019-12-18 15:34:07,719 INFO L78 Accepts]: Start accepts. Automaton has 16189 states and 84585 transitions. Word has length 3 [2019-12-18 15:34:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:34:07,719 INFO L462 AbstractCegarLoop]: Abstraction has 16189 states and 84585 transitions. [2019-12-18 15:34:07,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:34:07,719 INFO L276 IsEmpty]: Start isEmpty. Operand 16189 states and 84585 transitions. [2019-12-18 15:34:07,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 15:34:07,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:07,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:34:07,719 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:07,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:07,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2087713608, now seen corresponding path program 1 times [2019-12-18 15:34:07,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:07,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763254881] [2019-12-18 15:34:07,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:34:07,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763254881] [2019-12-18 15:34:07,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:34:07,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:34:07,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101000764] [2019-12-18 15:34:07,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:34:07,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:07,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:34:07,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:34:07,747 INFO L87 Difference]: Start difference. First operand 16189 states and 84585 transitions. Second operand 5 states. [2019-12-18 15:34:08,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:34:08,000 INFO L93 Difference]: Finished difference Result 29874 states and 147254 transitions. [2019-12-18 15:34:08,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:34:08,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 15:34:08,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:08,086 INFO L225 Difference]: With dead ends: 29874 [2019-12-18 15:34:08,086 INFO L226 Difference]: Without dead ends: 29871 [2019-12-18 15:34:08,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:34:08,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29871 states. [2019-12-18 15:34:08,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29871 to 19122. [2019-12-18 15:34:08,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-12-18 15:34:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 100971 transitions. [2019-12-18 15:34:08,651 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 100971 transitions. Word has length 9 [2019-12-18 15:34:08,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:34:08,652 INFO L462 AbstractCegarLoop]: Abstraction has 19122 states and 100971 transitions. [2019-12-18 15:34:08,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:34:08,652 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 100971 transitions. [2019-12-18 15:34:08,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:34:08,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:08,652 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:34:08,653 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:08,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:08,653 INFO L82 PathProgramCache]: Analyzing trace with hash -973722539, now seen corresponding path program 1 times [2019-12-18 15:34:08,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:08,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226058544] [2019-12-18 15:34:08,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:08,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 15:34:08,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226058544] [2019-12-18 15:34:08,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:34:08,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:34:08,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918345652] [2019-12-18 15:34:08,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:34:08,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:08,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:34:08,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:34:08,681 INFO L87 Difference]: Start difference. First operand 19122 states and 100971 transitions. Second operand 5 states. [2019-12-18 15:34:10,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:34:10,281 INFO L93 Difference]: Finished difference Result 34948 states and 174870 transitions. [2019-12-18 15:34:10,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:34:10,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 15:34:10,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:10,388 INFO L225 Difference]: With dead ends: 34948 [2019-12-18 15:34:10,388 INFO L226 Difference]: Without dead ends: 34944 [2019-12-18 15:34:10,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:34:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34944 states. [2019-12-18 15:34:10,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34944 to 22883. [2019-12-18 15:34:10,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22883 states. [2019-12-18 15:34:11,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22883 states to 22883 states and 122526 transitions. [2019-12-18 15:34:11,040 INFO L78 Accepts]: Start accepts. Automaton has 22883 states and 122526 transitions. Word has length 13 [2019-12-18 15:34:11,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:34:11,040 INFO L462 AbstractCegarLoop]: Abstraction has 22883 states and 122526 transitions. [2019-12-18 15:34:11,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:34:11,040 INFO L276 IsEmpty]: Start isEmpty. Operand 22883 states and 122526 transitions. [2019-12-18 15:34:11,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:34:11,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:11,040 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:34:11,041 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:11,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:11,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1543295844, now seen corresponding path program 1 times [2019-12-18 15:34:11,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:11,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553873087] [2019-12-18 15:34:11,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:34:11,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553873087] [2019-12-18 15:34:11,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70097636] [2019-12-18 15:34:11,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:34:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:11,170 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-18 15:34:11,171 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:34:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:34:11,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:34:11,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-18 15:34:11,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640780233] [2019-12-18 15:34:11,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:34:11,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:11,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:34:11,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:34:11,236 INFO L87 Difference]: Start difference. First operand 22883 states and 122526 transitions. Second operand 12 states. [2019-12-18 15:34:11,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:34:11,854 INFO L93 Difference]: Finished difference Result 54752 states and 257250 transitions. [2019-12-18 15:34:11,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:34:11,854 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-18 15:34:11,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:12,015 INFO L225 Difference]: With dead ends: 54752 [2019-12-18 15:34:12,015 INFO L226 Difference]: Without dead ends: 54748 [2019-12-18 15:34:12,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:34:12,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54748 states. [2019-12-18 15:34:12,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54748 to 22725. [2019-12-18 15:34:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-12-18 15:34:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 121545 transitions. [2019-12-18 15:34:12,865 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 121545 transitions. Word has length 15 [2019-12-18 15:34:12,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:34:12,865 INFO L462 AbstractCegarLoop]: Abstraction has 22725 states and 121545 transitions. [2019-12-18 15:34:12,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:34:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 121545 transitions. [2019-12-18 15:34:12,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:34:12,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:12,866 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:34:13,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:34:13,067 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:13,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:13,067 INFO L82 PathProgramCache]: Analyzing trace with hash 555508526, now seen corresponding path program 2 times [2019-12-18 15:34:13,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:13,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703686232] [2019-12-18 15:34:13,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:13,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 15:34:13,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703686232] [2019-12-18 15:34:13,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:34:13,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:34:13,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078469281] [2019-12-18 15:34:13,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:34:13,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:13,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:34:13,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:34:13,109 INFO L87 Difference]: Start difference. First operand 22725 states and 121545 transitions. Second operand 7 states. [2019-12-18 15:34:13,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:34:13,654 INFO L93 Difference]: Finished difference Result 56062 states and 263636 transitions. [2019-12-18 15:34:13,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:34:13,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 15:34:13,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:15,670 INFO L225 Difference]: With dead ends: 56062 [2019-12-18 15:34:15,670 INFO L226 Difference]: Without dead ends: 56057 [2019-12-18 15:34:15,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:34:15,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56057 states. [2019-12-18 15:34:16,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56057 to 22254. [2019-12-18 15:34:16,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22254 states. [2019-12-18 15:34:16,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22254 states to 22254 states and 118917 transitions. [2019-12-18 15:34:16,514 INFO L78 Accepts]: Start accepts. Automaton has 22254 states and 118917 transitions. Word has length 15 [2019-12-18 15:34:16,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:34:16,514 INFO L462 AbstractCegarLoop]: Abstraction has 22254 states and 118917 transitions. [2019-12-18 15:34:16,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:34:16,514 INFO L276 IsEmpty]: Start isEmpty. Operand 22254 states and 118917 transitions. [2019-12-18 15:34:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:34:16,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:16,515 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:34:16,515 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:16,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:16,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1552042877, now seen corresponding path program 1 times [2019-12-18 15:34:16,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:16,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179278213] [2019-12-18 15:34:16,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:34:16,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179278213] [2019-12-18 15:34:16,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:34:16,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:34:16,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758494625] [2019-12-18 15:34:16,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:34:16,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:16,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:34:16,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:34:16,547 INFO L87 Difference]: Start difference. First operand 22254 states and 118917 transitions. Second operand 5 states. [2019-12-18 15:34:16,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:34:16,841 INFO L93 Difference]: Finished difference Result 40360 states and 205156 transitions. [2019-12-18 15:34:16,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:34:16,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 15:34:16,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:16,964 INFO L225 Difference]: With dead ends: 40360 [2019-12-18 15:34:16,964 INFO L226 Difference]: Without dead ends: 40352 [2019-12-18 15:34:16,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:34:17,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40352 states. [2019-12-18 15:34:17,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40352 to 27169. [2019-12-18 15:34:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27169 states. [2019-12-18 15:34:17,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27169 states to 27169 states and 146914 transitions. [2019-12-18 15:34:17,720 INFO L78 Accepts]: Start accepts. Automaton has 27169 states and 146914 transitions. Word has length 17 [2019-12-18 15:34:17,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:34:17,721 INFO L462 AbstractCegarLoop]: Abstraction has 27169 states and 146914 transitions. [2019-12-18 15:34:17,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:34:17,721 INFO L276 IsEmpty]: Start isEmpty. Operand 27169 states and 146914 transitions. [2019-12-18 15:34:17,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:34:17,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:17,722 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:34:17,722 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:17,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:17,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1878511684, now seen corresponding path program 1 times [2019-12-18 15:34:17,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:17,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367734940] [2019-12-18 15:34:17,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 15:34:17,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367734940] [2019-12-18 15:34:17,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006018684] [2019-12-18 15:34:17,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:34:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:17,870 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-18 15:34:17,871 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:34:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 15:34:17,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:34:17,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-18 15:34:17,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397461174] [2019-12-18 15:34:17,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:34:17,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:17,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:34:17,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:34:17,937 INFO L87 Difference]: Start difference. First operand 27169 states and 146914 transitions. Second operand 12 states. [2019-12-18 15:34:18,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:34:18,612 INFO L93 Difference]: Finished difference Result 64531 states and 308602 transitions. [2019-12-18 15:34:18,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:34:18,612 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-18 15:34:18,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:18,815 INFO L225 Difference]: With dead ends: 64531 [2019-12-18 15:34:18,815 INFO L226 Difference]: Without dead ends: 64525 [2019-12-18 15:34:18,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:34:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64525 states. [2019-12-18 15:34:20,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64525 to 27590. [2019-12-18 15:34:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-18 15:34:20,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 148998 transitions. [2019-12-18 15:34:20,500 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 148998 transitions. Word has length 19 [2019-12-18 15:34:20,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:34:20,500 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 148998 transitions. [2019-12-18 15:34:20,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:34:20,500 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 148998 transitions. [2019-12-18 15:34:20,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:34:20,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:20,501 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:34:20,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:34:20,702 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:20,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:20,702 INFO L82 PathProgramCache]: Analyzing trace with hash -90006000, now seen corresponding path program 1 times [2019-12-18 15:34:20,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:20,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915569429] [2019-12-18 15:34:20,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 15:34:20,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915569429] [2019-12-18 15:34:20,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019309224] [2019-12-18 15:34:20,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:34:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:20,836 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-18 15:34:20,836 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:34:20,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 15:34:20,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:34:20,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-18 15:34:20,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564592355] [2019-12-18 15:34:20,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:34:20,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:20,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:34:20,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:34:20,898 INFO L87 Difference]: Start difference. First operand 27590 states and 148998 transitions. Second operand 12 states. [2019-12-18 15:34:21,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:34:21,578 INFO L93 Difference]: Finished difference Result 67092 states and 321768 transitions. [2019-12-18 15:34:21,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:34:21,578 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-18 15:34:21,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:21,778 INFO L225 Difference]: With dead ends: 67092 [2019-12-18 15:34:21,778 INFO L226 Difference]: Without dead ends: 67083 [2019-12-18 15:34:21,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:34:21,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67083 states. [2019-12-18 15:34:22,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67083 to 27791. [2019-12-18 15:34:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27791 states. [2019-12-18 15:34:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27791 states to 27791 states and 150081 transitions. [2019-12-18 15:34:22,825 INFO L78 Accepts]: Start accepts. Automaton has 27791 states and 150081 transitions. Word has length 19 [2019-12-18 15:34:22,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:34:22,826 INFO L462 AbstractCegarLoop]: Abstraction has 27791 states and 150081 transitions. [2019-12-18 15:34:22,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:34:22,826 INFO L276 IsEmpty]: Start isEmpty. Operand 27791 states and 150081 transitions. [2019-12-18 15:34:22,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:34:22,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:22,827 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:34:23,027 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:34:23,027 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:23,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:23,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1159551062, now seen corresponding path program 2 times [2019-12-18 15:34:23,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:23,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299411146] [2019-12-18 15:34:23,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:23,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:34:23,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299411146] [2019-12-18 15:34:23,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:34:23,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:34:23,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730299726] [2019-12-18 15:34:23,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:34:23,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:23,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:34:23,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:34:23,069 INFO L87 Difference]: Start difference. First operand 27791 states and 150081 transitions. Second operand 7 states. [2019-12-18 15:34:23,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:34:23,706 INFO L93 Difference]: Finished difference Result 68100 states and 326949 transitions. [2019-12-18 15:34:23,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:34:23,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 15:34:23,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:24,533 INFO L225 Difference]: With dead ends: 68100 [2019-12-18 15:34:24,534 INFO L226 Difference]: Without dead ends: 68091 [2019-12-18 15:34:24,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:34:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68091 states. [2019-12-18 15:34:25,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68091 to 27884. [2019-12-18 15:34:25,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27884 states. [2019-12-18 15:34:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27884 states to 27884 states and 150616 transitions. [2019-12-18 15:34:25,519 INFO L78 Accepts]: Start accepts. Automaton has 27884 states and 150616 transitions. Word has length 19 [2019-12-18 15:34:25,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:34:25,520 INFO L462 AbstractCegarLoop]: Abstraction has 27884 states and 150616 transitions. [2019-12-18 15:34:25,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:34:25,520 INFO L276 IsEmpty]: Start isEmpty. Operand 27884 states and 150616 transitions. [2019-12-18 15:34:25,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:34:25,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:25,521 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:34:25,521 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:25,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:25,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1159551992, now seen corresponding path program 2 times [2019-12-18 15:34:25,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:25,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028166168] [2019-12-18 15:34:25,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:34:25,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028166168] [2019-12-18 15:34:25,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:34:25,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:34:25,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107674705] [2019-12-18 15:34:25,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:34:25,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:25,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:34:25,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:34:25,561 INFO L87 Difference]: Start difference. First operand 27884 states and 150616 transitions. Second operand 7 states. [2019-12-18 15:34:26,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:34:26,154 INFO L93 Difference]: Finished difference Result 67749 states and 324931 transitions. [2019-12-18 15:34:26,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:34:26,155 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 15:34:26,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:26,352 INFO L225 Difference]: With dead ends: 67749 [2019-12-18 15:34:26,352 INFO L226 Difference]: Without dead ends: 67740 [2019-12-18 15:34:26,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:34:26,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67740 states. [2019-12-18 15:34:27,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67740 to 28053. [2019-12-18 15:34:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28053 states. [2019-12-18 15:34:27,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28053 states to 28053 states and 151628 transitions. [2019-12-18 15:34:27,417 INFO L78 Accepts]: Start accepts. Automaton has 28053 states and 151628 transitions. Word has length 19 [2019-12-18 15:34:27,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:34:27,417 INFO L462 AbstractCegarLoop]: Abstraction has 28053 states and 151628 transitions. [2019-12-18 15:34:27,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:34:27,417 INFO L276 IsEmpty]: Start isEmpty. Operand 28053 states and 151628 transitions. [2019-12-18 15:34:27,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:34:27,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:27,418 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:34:27,418 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:27,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:27,419 INFO L82 PathProgramCache]: Analyzing trace with hash 113904919, now seen corresponding path program 1 times [2019-12-18 15:34:27,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:27,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378462354] [2019-12-18 15:34:27,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:27,482 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:34:27,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378462354] [2019-12-18 15:34:27,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812915497] [2019-12-18 15:34:27,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:34:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:27,573 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:34:27,574 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:34:27,673 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:34:27,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:34:27,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:34:27,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614760980] [2019-12-18 15:34:27,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:34:27,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:27,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:34:27,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:34:27,675 INFO L87 Difference]: Start difference. First operand 28053 states and 151628 transitions. Second operand 16 states. [2019-12-18 15:34:28,401 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-12-18 15:34:29,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:34:29,314 INFO L93 Difference]: Finished difference Result 97639 states and 440644 transitions. [2019-12-18 15:34:29,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:34:29,314 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-18 15:34:29,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:29,582 INFO L225 Difference]: With dead ends: 97639 [2019-12-18 15:34:29,583 INFO L226 Difference]: Without dead ends: 97635 [2019-12-18 15:34:29,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:34:29,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97635 states. [2019-12-18 15:34:30,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97635 to 27697. [2019-12-18 15:34:30,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27697 states. [2019-12-18 15:34:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27697 states to 27697 states and 149567 transitions. [2019-12-18 15:34:30,985 INFO L78 Accepts]: Start accepts. Automaton has 27697 states and 149567 transitions. Word has length 21 [2019-12-18 15:34:30,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:34:30,986 INFO L462 AbstractCegarLoop]: Abstraction has 27697 states and 149567 transitions. [2019-12-18 15:34:30,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:34:30,986 INFO L276 IsEmpty]: Start isEmpty. Operand 27697 states and 149567 transitions. [2019-12-18 15:34:30,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:34:30,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:30,987 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:34:31,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:34:31,188 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:31,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:31,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1363462911, now seen corresponding path program 2 times [2019-12-18 15:34:31,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:31,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883622611] [2019-12-18 15:34:31,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 15:34:31,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883622611] [2019-12-18 15:34:31,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578249511] [2019-12-18 15:34:31,242 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:34:31,329 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:34:31,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:34:31,329 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:34:31,330 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:34:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 15:34:31,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:34:31,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:34:31,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2944314] [2019-12-18 15:34:31,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:34:31,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:31,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:34:31,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:34:31,411 INFO L87 Difference]: Start difference. First operand 27697 states and 149567 transitions. Second operand 16 states. [2019-12-18 15:34:33,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:34:33,275 INFO L93 Difference]: Finished difference Result 96837 states and 436529 transitions. [2019-12-18 15:34:33,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:34:33,275 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-18 15:34:33,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:33,562 INFO L225 Difference]: With dead ends: 96837 [2019-12-18 15:34:33,562 INFO L226 Difference]: Without dead ends: 96831 [2019-12-18 15:34:33,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:34:33,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96831 states. [2019-12-18 15:34:34,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96831 to 27343. [2019-12-18 15:34:34,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27343 states. [2019-12-18 15:34:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27343 states to 27343 states and 147510 transitions. [2019-12-18 15:34:34,885 INFO L78 Accepts]: Start accepts. Automaton has 27343 states and 147510 transitions. Word has length 21 [2019-12-18 15:34:34,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:34:34,885 INFO L462 AbstractCegarLoop]: Abstraction has 27343 states and 147510 transitions. [2019-12-18 15:34:34,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:34:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 27343 states and 147510 transitions. [2019-12-18 15:34:34,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:34:34,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:34,887 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:34:35,087 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:34:35,087 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:35,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:35,088 INFO L82 PathProgramCache]: Analyzing trace with hash -596422103, now seen corresponding path program 3 times [2019-12-18 15:34:35,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:35,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131025789] [2019-12-18 15:34:35,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 15:34:35,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131025789] [2019-12-18 15:34:35,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103271164] [2019-12-18 15:34:35,147 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:34:35,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 15:34:35,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:34:35,246 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:34:35,247 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:34:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 15:34:35,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:34:35,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:34:35,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100622277] [2019-12-18 15:34:35,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:34:35,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:35,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:34:35,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:34:35,336 INFO L87 Difference]: Start difference. First operand 27343 states and 147510 transitions. Second operand 16 states. [2019-12-18 15:34:36,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:34:36,784 INFO L93 Difference]: Finished difference Result 97329 states and 439144 transitions. [2019-12-18 15:34:36,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:34:36,785 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-18 15:34:36,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:37,062 INFO L225 Difference]: With dead ends: 97329 [2019-12-18 15:34:37,062 INFO L226 Difference]: Without dead ends: 97325 [2019-12-18 15:34:37,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:34:37,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97325 states. [2019-12-18 15:34:38,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97325 to 26991. [2019-12-18 15:34:38,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26991 states. [2019-12-18 15:34:38,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26991 states to 26991 states and 145461 transitions. [2019-12-18 15:34:38,901 INFO L78 Accepts]: Start accepts. Automaton has 26991 states and 145461 transitions. Word has length 21 [2019-12-18 15:34:38,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:34:38,901 INFO L462 AbstractCegarLoop]: Abstraction has 26991 states and 145461 transitions. [2019-12-18 15:34:38,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:34:38,901 INFO L276 IsEmpty]: Start isEmpty. Operand 26991 states and 145461 transitions. [2019-12-18 15:34:38,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:34:38,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:38,902 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:34:39,102 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:34:39,103 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:39,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:39,103 INFO L82 PathProgramCache]: Analyzing trace with hash -607849943, now seen corresponding path program 4 times [2019-12-18 15:34:39,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:39,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851867896] [2019-12-18 15:34:39,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 15:34:39,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851867896] [2019-12-18 15:34:39,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743274103] [2019-12-18 15:34:39,165 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:34:39,255 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:34:39,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:34:39,257 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:34:39,258 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:34:39,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 15:34:39,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:34:39,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:34:39,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575208917] [2019-12-18 15:34:39,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:34:39,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:39,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:34:39,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:34:39,347 INFO L87 Difference]: Start difference. First operand 26991 states and 145461 transitions. Second operand 16 states. [2019-12-18 15:34:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:34:40,791 INFO L93 Difference]: Finished difference Result 96246 states and 433386 transitions. [2019-12-18 15:34:40,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:34:40,791 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-18 15:34:40,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:41,078 INFO L225 Difference]: With dead ends: 96246 [2019-12-18 15:34:41,078 INFO L226 Difference]: Without dead ends: 96240 [2019-12-18 15:34:41,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:34:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96240 states. [2019-12-18 15:34:42,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96240 to 26339. [2019-12-18 15:34:42,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26339 states. [2019-12-18 15:34:42,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26339 states to 26339 states and 142000 transitions. [2019-12-18 15:34:42,995 INFO L78 Accepts]: Start accepts. Automaton has 26339 states and 142000 transitions. Word has length 21 [2019-12-18 15:34:42,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:34:42,996 INFO L462 AbstractCegarLoop]: Abstraction has 26339 states and 142000 transitions. [2019-12-18 15:34:42,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:34:42,996 INFO L276 IsEmpty]: Start isEmpty. Operand 26339 states and 142000 transitions. [2019-12-18 15:34:42,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:34:42,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:42,997 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:34:43,197 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:34:43,198 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:43,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:43,198 INFO L82 PathProgramCache]: Analyzing trace with hash 671564070, now seen corresponding path program 1 times [2019-12-18 15:34:43,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:43,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768796617] [2019-12-18 15:34:43,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:34:43,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768796617] [2019-12-18 15:34:43,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:34:43,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:34:43,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908023008] [2019-12-18 15:34:43,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:34:43,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:43,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:34:43,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:34:43,226 INFO L87 Difference]: Start difference. First operand 26339 states and 142000 transitions. Second operand 5 states. [2019-12-18 15:34:43,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:34:43,588 INFO L93 Difference]: Finished difference Result 47340 states and 243927 transitions. [2019-12-18 15:34:43,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:34:43,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 15:34:43,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:43,734 INFO L225 Difference]: With dead ends: 47340 [2019-12-18 15:34:43,734 INFO L226 Difference]: Without dead ends: 47324 [2019-12-18 15:34:43,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:34:43,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47324 states. [2019-12-18 15:34:44,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47324 to 32794. [2019-12-18 15:34:44,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32794 states. [2019-12-18 15:34:44,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32794 states to 32794 states and 178171 transitions. [2019-12-18 15:34:44,632 INFO L78 Accepts]: Start accepts. Automaton has 32794 states and 178171 transitions. Word has length 21 [2019-12-18 15:34:44,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:34:44,633 INFO L462 AbstractCegarLoop]: Abstraction has 32794 states and 178171 transitions. [2019-12-18 15:34:44,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:34:44,633 INFO L276 IsEmpty]: Start isEmpty. Operand 32794 states and 178171 transitions. [2019-12-18 15:34:44,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:34:44,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:44,634 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:34:44,634 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:44,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:44,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1932039825, now seen corresponding path program 5 times [2019-12-18 15:34:44,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:44,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808718872] [2019-12-18 15:34:44,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:44,694 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:34:44,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808718872] [2019-12-18 15:34:44,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:34:44,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:34:44,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362038364] [2019-12-18 15:34:44,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:34:44,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:44,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:34:44,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:34:44,695 INFO L87 Difference]: Start difference. First operand 32794 states and 178171 transitions. Second operand 9 states. [2019-12-18 15:34:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:34:46,579 INFO L93 Difference]: Finished difference Result 112140 states and 515003 transitions. [2019-12-18 15:34:46,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:34:46,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 15:34:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:46,935 INFO L225 Difference]: With dead ends: 112140 [2019-12-18 15:34:46,935 INFO L226 Difference]: Without dead ends: 112133 [2019-12-18 15:34:46,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:34:47,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112133 states. [2019-12-18 15:34:48,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112133 to 31942. [2019-12-18 15:34:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31942 states. [2019-12-18 15:34:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31942 states to 31942 states and 173493 transitions. [2019-12-18 15:34:48,510 INFO L78 Accepts]: Start accepts. Automaton has 31942 states and 173493 transitions. Word has length 21 [2019-12-18 15:34:48,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:34:48,510 INFO L462 AbstractCegarLoop]: Abstraction has 31942 states and 173493 transitions. [2019-12-18 15:34:48,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:34:48,510 INFO L276 IsEmpty]: Start isEmpty. Operand 31942 states and 173493 transitions. [2019-12-18 15:34:48,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:34:48,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:48,511 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:34:48,511 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:48,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:48,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1932932625, now seen corresponding path program 6 times [2019-12-18 15:34:48,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:48,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504436315] [2019-12-18 15:34:48,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:48,578 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 15:34:48,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504436315] [2019-12-18 15:34:48,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:34:48,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:34:48,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160723723] [2019-12-18 15:34:48,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:34:48,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:48,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:34:48,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:34:48,580 INFO L87 Difference]: Start difference. First operand 31942 states and 173493 transitions. Second operand 9 states. [2019-12-18 15:34:49,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:34:49,916 INFO L93 Difference]: Finished difference Result 111030 states and 509192 transitions. [2019-12-18 15:34:49,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:34:49,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 15:34:49,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:50,866 INFO L225 Difference]: With dead ends: 111030 [2019-12-18 15:34:50,866 INFO L226 Difference]: Without dead ends: 111020 [2019-12-18 15:34:50,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:34:51,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111020 states. [2019-12-18 15:34:52,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111020 to 30899. [2019-12-18 15:34:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30899 states. [2019-12-18 15:34:52,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30899 states to 30899 states and 167948 transitions. [2019-12-18 15:34:52,402 INFO L78 Accepts]: Start accepts. Automaton has 30899 states and 167948 transitions. Word has length 21 [2019-12-18 15:34:52,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:34:52,402 INFO L462 AbstractCegarLoop]: Abstraction has 30899 states and 167948 transitions. [2019-12-18 15:34:52,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:34:52,402 INFO L276 IsEmpty]: Start isEmpty. Operand 30899 states and 167948 transitions. [2019-12-18 15:34:52,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:34:52,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:52,403 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:34:52,404 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:52,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:52,404 INFO L82 PathProgramCache]: Analyzing trace with hash -938538387, now seen corresponding path program 1 times [2019-12-18 15:34:52,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:52,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471144360] [2019-12-18 15:34:52,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 15:34:52,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471144360] [2019-12-18 15:34:52,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112031999] [2019-12-18 15:34:52,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:34:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:52,540 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-18 15:34:52,540 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:34:52,613 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 15:34:52,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:34:52,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-18 15:34:52,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40349540] [2019-12-18 15:34:52,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:34:52,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:52,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:34:52,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:34:52,614 INFO L87 Difference]: Start difference. First operand 30899 states and 167948 transitions. Second operand 12 states. [2019-12-18 15:34:53,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:34:53,315 INFO L93 Difference]: Finished difference Result 73073 states and 355163 transitions. [2019-12-18 15:34:53,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:34:53,315 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-18 15:34:53,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:54,103 INFO L225 Difference]: With dead ends: 73073 [2019-12-18 15:34:54,103 INFO L226 Difference]: Without dead ends: 73061 [2019-12-18 15:34:54,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:34:54,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73061 states. [2019-12-18 15:34:55,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73061 to 31876. [2019-12-18 15:34:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31876 states. [2019-12-18 15:34:55,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31876 states to 31876 states and 173008 transitions. [2019-12-18 15:34:55,210 INFO L78 Accepts]: Start accepts. Automaton has 31876 states and 173008 transitions. Word has length 23 [2019-12-18 15:34:55,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:34:55,210 INFO L462 AbstractCegarLoop]: Abstraction has 31876 states and 173008 transitions. [2019-12-18 15:34:55,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:34:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 31876 states and 173008 transitions. [2019-12-18 15:34:55,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:34:55,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:55,212 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:34:55,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:34:55,413 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:55,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:55,414 INFO L82 PathProgramCache]: Analyzing trace with hash -912298617, now seen corresponding path program 1 times [2019-12-18 15:34:55,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:55,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725676991] [2019-12-18 15:34:55,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 15:34:55,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725676991] [2019-12-18 15:34:55,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499938463] [2019-12-18 15:34:55,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:34:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:55,546 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-18 15:34:55,547 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:34:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 15:34:55,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:34:55,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-18 15:34:55,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492334068] [2019-12-18 15:34:55,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:34:55,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:55,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:34:55,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:34:55,610 INFO L87 Difference]: Start difference. First operand 31876 states and 173008 transitions. Second operand 12 states. [2019-12-18 15:34:56,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:34:56,311 INFO L93 Difference]: Finished difference Result 77049 states and 375250 transitions. [2019-12-18 15:34:56,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:34:56,312 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-18 15:34:56,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:56,541 INFO L225 Difference]: With dead ends: 77049 [2019-12-18 15:34:56,541 INFO L226 Difference]: Without dead ends: 77035 [2019-12-18 15:34:56,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:34:56,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77035 states. [2019-12-18 15:34:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77035 to 32848. [2019-12-18 15:34:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32848 states. [2019-12-18 15:34:58,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32848 states to 32848 states and 178265 transitions. [2019-12-18 15:34:58,321 INFO L78 Accepts]: Start accepts. Automaton has 32848 states and 178265 transitions. Word has length 23 [2019-12-18 15:34:58,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:34:58,321 INFO L462 AbstractCegarLoop]: Abstraction has 32848 states and 178265 transitions. [2019-12-18 15:34:58,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:34:58,321 INFO L276 IsEmpty]: Start isEmpty. Operand 32848 states and 178265 transitions. [2019-12-18 15:34:58,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:34:58,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:34:58,323 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:34:58,523 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:34:58,524 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:34:58,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:34:58,524 INFO L82 PathProgramCache]: Analyzing trace with hash 475670957, now seen corresponding path program 1 times [2019-12-18 15:34:58,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:34:58,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021497845] [2019-12-18 15:34:58,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:34:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 15:34:58,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021497845] [2019-12-18 15:34:58,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175229231] [2019-12-18 15:34:58,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:34:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:34:58,663 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-18 15:34:58,667 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:34:58,732 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 15:34:58,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:34:58,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-18 15:34:58,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102838540] [2019-12-18 15:34:58,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:34:58,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:58,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:34:58,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:34:58,734 INFO L87 Difference]: Start difference. First operand 32848 states and 178265 transitions. Second operand 12 states. [2019-12-18 15:34:59,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:34:59,461 INFO L93 Difference]: Finished difference Result 80192 states and 391837 transitions. [2019-12-18 15:34:59,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:34:59,461 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-18 15:34:59,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:34:59,726 INFO L225 Difference]: With dead ends: 80192 [2019-12-18 15:34:59,726 INFO L226 Difference]: Without dead ends: 80173 [2019-12-18 15:34:59,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:34:59,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80173 states. [2019-12-18 15:35:01,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80173 to 33665. [2019-12-18 15:35:01,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33665 states. [2019-12-18 15:35:01,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33665 states to 33665 states and 182914 transitions. [2019-12-18 15:35:01,607 INFO L78 Accepts]: Start accepts. Automaton has 33665 states and 182914 transitions. Word has length 23 [2019-12-18 15:35:01,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:35:01,607 INFO L462 AbstractCegarLoop]: Abstraction has 33665 states and 182914 transitions. [2019-12-18 15:35:01,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:35:01,607 INFO L276 IsEmpty]: Start isEmpty. Operand 33665 states and 182914 transitions. [2019-12-18 15:35:01,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:35:01,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:35:01,609 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:35:01,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:35:01,810 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:35:01,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:35:01,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1127986751, now seen corresponding path program 2 times [2019-12-18 15:35:01,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:35:01,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264820995] [2019-12-18 15:35:01,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:35:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:35:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:35:01,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264820995] [2019-12-18 15:35:01,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:35:01,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:35:01,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585645318] [2019-12-18 15:35:01,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:35:01,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:35:01,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:35:01,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:35:01,856 INFO L87 Difference]: Start difference. First operand 33665 states and 182914 transitions. Second operand 7 states. [2019-12-18 15:35:02,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:35:02,549 INFO L93 Difference]: Finished difference Result 80956 states and 395965 transitions. [2019-12-18 15:35:02,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:35:02,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 15:35:02,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:35:02,807 INFO L225 Difference]: With dead ends: 80956 [2019-12-18 15:35:02,807 INFO L226 Difference]: Without dead ends: 80937 [2019-12-18 15:35:02,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:35:03,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80937 states. [2019-12-18 15:35:03,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80937 to 34532. [2019-12-18 15:35:03,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34532 states. [2019-12-18 15:35:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34532 states to 34532 states and 187636 transitions. [2019-12-18 15:35:04,120 INFO L78 Accepts]: Start accepts. Automaton has 34532 states and 187636 transitions. Word has length 23 [2019-12-18 15:35:04,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:35:04,120 INFO L462 AbstractCegarLoop]: Abstraction has 34532 states and 187636 transitions. [2019-12-18 15:35:04,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:35:04,120 INFO L276 IsEmpty]: Start isEmpty. Operand 34532 states and 187636 transitions. [2019-12-18 15:35:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:35:04,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:35:04,122 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:35:04,122 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:35:04,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:35:04,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1127974847, now seen corresponding path program 2 times [2019-12-18 15:35:04,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:35:04,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063198352] [2019-12-18 15:35:04,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:35:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:35:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:35:04,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063198352] [2019-12-18 15:35:04,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:35:04,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:35:04,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846005120] [2019-12-18 15:35:04,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:35:04,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:35:04,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:35:04,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:35:04,192 INFO L87 Difference]: Start difference. First operand 34532 states and 187636 transitions. Second operand 7 states. [2019-12-18 15:35:05,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:35:05,605 INFO L93 Difference]: Finished difference Result 81082 states and 396008 transitions. [2019-12-18 15:35:05,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:35:05,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 15:35:05,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:35:05,849 INFO L225 Difference]: With dead ends: 81082 [2019-12-18 15:35:05,849 INFO L226 Difference]: Without dead ends: 81063 [2019-12-18 15:35:05,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:35:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81063 states. [2019-12-18 15:35:07,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81063 to 35153. [2019-12-18 15:35:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35153 states. [2019-12-18 15:35:07,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35153 states to 35153 states and 191087 transitions. [2019-12-18 15:35:07,159 INFO L78 Accepts]: Start accepts. Automaton has 35153 states and 191087 transitions. Word has length 23 [2019-12-18 15:35:07,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:35:07,159 INFO L462 AbstractCegarLoop]: Abstraction has 35153 states and 191087 transitions. [2019-12-18 15:35:07,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:35:07,159 INFO L276 IsEmpty]: Start isEmpty. Operand 35153 states and 191087 transitions. [2019-12-18 15:35:07,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:35:07,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:35:07,162 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:35:07,162 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:35:07,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:35:07,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1127975777, now seen corresponding path program 2 times [2019-12-18 15:35:07,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:35:07,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572906016] [2019-12-18 15:35:07,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:35:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:35:07,204 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:35:07,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572906016] [2019-12-18 15:35:07,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:35:07,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:35:07,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856489672] [2019-12-18 15:35:07,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:35:07,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:35:07,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:35:07,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:35:07,206 INFO L87 Difference]: Start difference. First operand 35153 states and 191087 transitions. Second operand 7 states. [2019-12-18 15:35:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:35:08,345 INFO L93 Difference]: Finished difference Result 81506 states and 397808 transitions. [2019-12-18 15:35:08,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:35:08,345 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 15:35:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:35:08,618 INFO L225 Difference]: With dead ends: 81506 [2019-12-18 15:35:08,619 INFO L226 Difference]: Without dead ends: 81487 [2019-12-18 15:35:08,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:35:08,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81487 states. [2019-12-18 15:35:09,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81487 to 35912. [2019-12-18 15:35:09,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35912 states. [2019-12-18 15:35:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35912 states to 35912 states and 195109 transitions. [2019-12-18 15:35:09,968 INFO L78 Accepts]: Start accepts. Automaton has 35912 states and 195109 transitions. Word has length 23 [2019-12-18 15:35:09,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:35:09,968 INFO L462 AbstractCegarLoop]: Abstraction has 35912 states and 195109 transitions. [2019-12-18 15:35:09,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:35:09,968 INFO L276 IsEmpty]: Start isEmpty. Operand 35912 states and 195109 transitions. [2019-12-18 15:35:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:35:09,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:35:09,971 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:35:09,971 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:35:09,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:35:09,971 INFO L82 PathProgramCache]: Analyzing trace with hash -2032533234, now seen corresponding path program 1 times [2019-12-18 15:35:09,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:35:09,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832577444] [2019-12-18 15:35:09,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:35:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:35:10,024 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 15:35:10,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832577444] [2019-12-18 15:35:10,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022542738] [2019-12-18 15:35:10,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:35:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:35:10,111 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:35:10,112 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:35:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 15:35:10,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:35:10,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:35:10,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090565403] [2019-12-18 15:35:10,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:35:10,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:35:10,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:35:10,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:35:10,208 INFO L87 Difference]: Start difference. First operand 35912 states and 195109 transitions. Second operand 16 states. [2019-12-18 15:35:12,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:35:12,226 INFO L93 Difference]: Finished difference Result 119601 states and 553012 transitions. [2019-12-18 15:35:12,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:35:12,227 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-18 15:35:12,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:35:12,582 INFO L225 Difference]: With dead ends: 119601 [2019-12-18 15:35:12,582 INFO L226 Difference]: Without dead ends: 119591 [2019-12-18 15:35:12,583 INFO L631 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 [2019-12-18 15:35:12,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119591 states. [2019-12-18 15:35:14,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119591 to 35590. [2019-12-18 15:35:14,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35590 states. [2019-12-18 15:35:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35590 states to 35590 states and 193098 transitions. [2019-12-18 15:35:14,366 INFO L78 Accepts]: Start accepts. Automaton has 35590 states and 193098 transitions. Word has length 25 [2019-12-18 15:35:14,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:35:14,367 INFO L462 AbstractCegarLoop]: Abstraction has 35590 states and 193098 transitions. [2019-12-18 15:35:14,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:35:14,367 INFO L276 IsEmpty]: Start isEmpty. Operand 35590 states and 193098 transitions. [2019-12-18 15:35:14,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:35:14,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:35:14,370 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:35:14,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:35:14,571 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:35:14,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:35:14,572 INFO L82 PathProgramCache]: Analyzing trace with hash -644563660, now seen corresponding path program 1 times [2019-12-18 15:35:14,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:35:14,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010555347] [2019-12-18 15:35:14,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:35:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:35:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-18 15:35:14,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010555347] [2019-12-18 15:35:14,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389359063] [2019-12-18 15:35:14,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:35:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:35:14,711 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:35:14,712 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:35:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-18 15:35:14,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:35:14,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:35:14,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346072585] [2019-12-18 15:35:14,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:35:14,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:35:14,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:35:14,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:35:14,792 INFO L87 Difference]: Start difference. First operand 35590 states and 193098 transitions. Second operand 16 states. [2019-12-18 15:35:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:35:16,423 INFO L93 Difference]: Finished difference Result 118371 states and 546721 transitions. [2019-12-18 15:35:16,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:35:16,424 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-18 15:35:16,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:35:16,812 INFO L225 Difference]: With dead ends: 118371 [2019-12-18 15:35:16,812 INFO L226 Difference]: Without dead ends: 118361 [2019-12-18 15:35:16,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:35:17,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118361 states. [2019-12-18 15:35:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118361 to 35384. [2019-12-18 15:35:22,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35384 states. [2019-12-18 15:35:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35384 states to 35384 states and 191757 transitions. [2019-12-18 15:35:22,579 INFO L78 Accepts]: Start accepts. Automaton has 35384 states and 191757 transitions. Word has length 25 [2019-12-18 15:35:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:35:22,579 INFO L462 AbstractCegarLoop]: Abstraction has 35384 states and 191757 transitions. [2019-12-18 15:35:22,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:35:22,579 INFO L276 IsEmpty]: Start isEmpty. Operand 35384 states and 191757 transitions. [2019-12-18 15:35:22,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:35:22,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:35:22,583 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:35:22,783 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:35:22,784 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:35:22,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:35:22,785 INFO L82 PathProgramCache]: Analyzing trace with hash 7752134, now seen corresponding path program 2 times [2019-12-18 15:35:22,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:35:22,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092410737] [2019-12-18 15:35:22,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:35:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:35:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 15:35:22,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092410737] [2019-12-18 15:35:22,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435239680] [2019-12-18 15:35:22,842 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:35:22,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:35:22,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:35:22,936 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:35:22,937 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:35:23,017 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 15:35:23,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:35:23,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:35:23,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463579391] [2019-12-18 15:35:23,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:35:23,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:35:23,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:35:23,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:35:23,019 INFO L87 Difference]: Start difference. First operand 35384 states and 191757 transitions. Second operand 16 states. [2019-12-18 15:35:24,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:35:24,613 INFO L93 Difference]: Finished difference Result 117247 states and 540902 transitions. [2019-12-18 15:35:24,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:35:24,613 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-18 15:35:24,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:35:24,958 INFO L225 Difference]: With dead ends: 117247 [2019-12-18 15:35:24,958 INFO L226 Difference]: Without dead ends: 117236 [2019-12-18 15:35:24,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:35:25,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117236 states. [2019-12-18 15:35:27,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117236 to 35317. [2019-12-18 15:35:27,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35317 states. [2019-12-18 15:35:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35317 states to 35317 states and 191252 transitions. [2019-12-18 15:35:27,528 INFO L78 Accepts]: Start accepts. Automaton has 35317 states and 191252 transitions. Word has length 25 [2019-12-18 15:35:27,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:35:27,528 INFO L462 AbstractCegarLoop]: Abstraction has 35317 states and 191252 transitions. [2019-12-18 15:35:27,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:35:27,528 INFO L276 IsEmpty]: Start isEmpty. Operand 35317 states and 191252 transitions. [2019-12-18 15:35:27,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:35:27,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:35:27,531 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:35:27,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:35:27,732 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:35:27,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:35:27,733 INFO L82 PathProgramCache]: Analyzing trace with hash 7741160, now seen corresponding path program 2 times [2019-12-18 15:35:27,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:35:27,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963559535] [2019-12-18 15:35:27,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:35:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:35:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 15:35:27,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963559535] [2019-12-18 15:35:27,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581258526] [2019-12-18 15:35:27,807 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:35:27,913 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:35:27,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:35:27,914 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:35:27,915 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:35:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 15:35:28,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:35:28,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:35:28,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401814509] [2019-12-18 15:35:28,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:35:28,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:35:28,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:35:28,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:35:28,020 INFO L87 Difference]: Start difference. First operand 35317 states and 191252 transitions. Second operand 16 states. [2019-12-18 15:35:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:35:29,353 INFO L93 Difference]: Finished difference Result 116261 states and 536103 transitions. [2019-12-18 15:35:29,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:35:29,353 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-18 15:35:29,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:35:29,683 INFO L225 Difference]: With dead ends: 116261 [2019-12-18 15:35:29,683 INFO L226 Difference]: Without dead ends: 116250 [2019-12-18 15:35:29,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:35:29,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116250 states. [2019-12-18 15:35:34,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116250 to 34934. [2019-12-18 15:35:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34934 states. [2019-12-18 15:35:34,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34934 states to 34934 states and 189032 transitions. [2019-12-18 15:35:34,331 INFO L78 Accepts]: Start accepts. Automaton has 34934 states and 189032 transitions. Word has length 25 [2019-12-18 15:35:34,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:35:34,331 INFO L462 AbstractCegarLoop]: Abstraction has 34934 states and 189032 transitions. [2019-12-18 15:35:34,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:35:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 34934 states and 189032 transitions. [2019-12-18 15:35:34,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:35:34,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:35:34,333 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:35:34,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:35:34,534 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:35:34,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:35:34,535 INFO L82 PathProgramCache]: Analyzing trace with hash -545632672, now seen corresponding path program 1 times [2019-12-18 15:35:34,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:35:34,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869340887] [2019-12-18 15:35:34,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:35:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:35:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 15:35:34,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869340887] [2019-12-18 15:35:34,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656310617] [2019-12-18 15:35:34,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:35:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:35:34,679 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:35:34,680 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:35:34,759 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 15:35:34,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:35:34,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:35:34,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076198588] [2019-12-18 15:35:34,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:35:34,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:35:34,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:35:34,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:35:34,760 INFO L87 Difference]: Start difference. First operand 34934 states and 189032 transitions. Second operand 16 states. [2019-12-18 15:35:36,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:35:36,330 INFO L93 Difference]: Finished difference Result 118938 states and 550128 transitions. [2019-12-18 15:35:36,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:35:36,330 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-18 15:35:36,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:35:36,705 INFO L225 Difference]: With dead ends: 118938 [2019-12-18 15:35:36,705 INFO L226 Difference]: Without dead ends: 118928 [2019-12-18 15:35:36,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:35:37,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118928 states. [2019-12-18 15:35:38,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118928 to 35058. [2019-12-18 15:35:38,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35058 states. [2019-12-18 15:35:39,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35058 states to 35058 states and 189558 transitions. [2019-12-18 15:35:39,017 INFO L78 Accepts]: Start accepts. Automaton has 35058 states and 189558 transitions. Word has length 25 [2019-12-18 15:35:39,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:35:39,017 INFO L462 AbstractCegarLoop]: Abstraction has 35058 states and 189558 transitions. [2019-12-18 15:35:39,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:35:39,017 INFO L276 IsEmpty]: Start isEmpty. Operand 35058 states and 189558 transitions. [2019-12-18 15:35:39,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:35:39,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:35:39,020 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:35:39,220 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:35:39,221 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:35:39,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:35:39,221 INFO L82 PathProgramCache]: Analyzing trace with hash -545644576, now seen corresponding path program 3 times [2019-12-18 15:35:39,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:35:39,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888882651] [2019-12-18 15:35:39,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:35:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:35:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 15:35:39,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888882651] [2019-12-18 15:35:39,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156982741] [2019-12-18 15:35:39,281 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:35:39,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 15:35:39,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:35:39,368 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:35:39,369 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:35:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 15:35:39,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:35:39,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:35:39,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140033026] [2019-12-18 15:35:39,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:35:39,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:35:39,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:35:39,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:35:39,446 INFO L87 Difference]: Start difference. First operand 35058 states and 189558 transitions. Second operand 16 states. [2019-12-18 15:35:43,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:35:43,391 INFO L93 Difference]: Finished difference Result 117535 states and 542555 transitions. [2019-12-18 15:35:43,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:35:43,391 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-18 15:35:43,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:35:43,744 INFO L225 Difference]: With dead ends: 117535 [2019-12-18 15:35:43,744 INFO L226 Difference]: Without dead ends: 117525 [2019-12-18 15:35:43,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:35:43,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117525 states. [2019-12-18 15:35:45,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117525 to 34750. [2019-12-18 15:35:45,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34750 states. [2019-12-18 15:35:45,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34750 states to 34750 states and 187700 transitions. [2019-12-18 15:35:45,382 INFO L78 Accepts]: Start accepts. Automaton has 34750 states and 187700 transitions. Word has length 25 [2019-12-18 15:35:45,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:35:45,383 INFO L462 AbstractCegarLoop]: Abstraction has 34750 states and 187700 transitions. [2019-12-18 15:35:45,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:35:45,383 INFO L276 IsEmpty]: Start isEmpty. Operand 34750 states and 187700 transitions. [2019-12-18 15:35:45,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:35:45,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:35:45,386 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:35:45,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:35:45,587 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:35:45,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:35:45,588 INFO L82 PathProgramCache]: Analyzing trace with hash -530395552, now seen corresponding path program 2 times [2019-12-18 15:35:45,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:35:45,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17280550] [2019-12-18 15:35:45,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:35:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:35:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 15:35:45,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17280550] [2019-12-18 15:35:45,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660687380] [2019-12-18 15:35:45,648 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:35:45,742 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:35:45,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:35:45,743 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:35:45,744 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:35:45,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 15:35:45,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:35:45,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:35:45,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878219237] [2019-12-18 15:35:45,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:35:45,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:35:45,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:35:45,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:35:45,823 INFO L87 Difference]: Start difference. First operand 34750 states and 187700 transitions. Second operand 16 states. [2019-12-18 15:35:47,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:35:47,779 INFO L93 Difference]: Finished difference Result 117014 states and 540604 transitions. [2019-12-18 15:35:47,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:35:47,780 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-18 15:35:47,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:35:48,129 INFO L225 Difference]: With dead ends: 117014 [2019-12-18 15:35:48,129 INFO L226 Difference]: Without dead ends: 117000 [2019-12-18 15:35:48,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:35:48,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117000 states. [2019-12-18 15:35:49,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117000 to 34277. [2019-12-18 15:35:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34277 states. [2019-12-18 15:35:53,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34277 states to 34277 states and 184965 transitions. [2019-12-18 15:35:53,486 INFO L78 Accepts]: Start accepts. Automaton has 34277 states and 184965 transitions. Word has length 25 [2019-12-18 15:35:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:35:53,486 INFO L462 AbstractCegarLoop]: Abstraction has 34277 states and 184965 transitions. [2019-12-18 15:35:53,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:35:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 34277 states and 184965 transitions. [2019-12-18 15:35:53,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:35:53,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:35:53,489 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:35:53,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:35:53,690 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:35:53,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:35:53,690 INFO L82 PathProgramCache]: Analyzing trace with hash -541835296, now seen corresponding path program 4 times [2019-12-18 15:35:53,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:35:53,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688297315] [2019-12-18 15:35:53,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:35:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:35:53,750 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 15:35:53,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688297315] [2019-12-18 15:35:53,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888125273] [2019-12-18 15:35:53,751 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:35:53,841 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:35:53,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:35:53,842 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:35:53,842 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:35:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 15:35:53,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:35:53,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:35:53,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353819415] [2019-12-18 15:35:53,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:35:53,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:35:53,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:35:53,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:35:53,923 INFO L87 Difference]: Start difference. First operand 34277 states and 184965 transitions. Second operand 16 states. [2019-12-18 15:35:55,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:35:55,556 INFO L93 Difference]: Finished difference Result 113272 states and 520858 transitions. [2019-12-18 15:35:55,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:35:55,557 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-18 15:35:55,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:35:55,882 INFO L225 Difference]: With dead ends: 113272 [2019-12-18 15:35:55,882 INFO L226 Difference]: Without dead ends: 113261 [2019-12-18 15:35:55,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:35:56,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113261 states. [2019-12-18 15:35:57,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113261 to 33768. [2019-12-18 15:35:57,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33768 states. [2019-12-18 15:35:58,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33768 states to 33768 states and 182281 transitions. [2019-12-18 15:35:58,072 INFO L78 Accepts]: Start accepts. Automaton has 33768 states and 182281 transitions. Word has length 25 [2019-12-18 15:35:58,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:35:58,072 INFO L462 AbstractCegarLoop]: Abstraction has 33768 states and 182281 transitions. [2019-12-18 15:35:58,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:35:58,072 INFO L276 IsEmpty]: Start isEmpty. Operand 33768 states and 182281 transitions. [2019-12-18 15:35:58,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:35:58,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:35:58,075 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:35:58,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:35:58,278 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:35:58,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:35:58,279 INFO L82 PathProgramCache]: Analyzing trace with hash -298046732, now seen corresponding path program 3 times [2019-12-18 15:35:58,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:35:58,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617869289] [2019-12-18 15:35:58,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:35:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:35:58,334 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 15:35:58,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617869289] [2019-12-18 15:35:58,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194290994] [2019-12-18 15:35:58,334 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:35:58,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 15:35:58,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:35:58,420 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:35:58,421 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:35:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 15:35:58,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:35:58,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:35:58,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642638901] [2019-12-18 15:35:58,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:35:58,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:35:58,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:35:58,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:35:58,502 INFO L87 Difference]: Start difference. First operand 33768 states and 182281 transitions. Second operand 16 states. [2019-12-18 15:36:00,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:36:00,031 INFO L93 Difference]: Finished difference Result 115987 states and 535173 transitions. [2019-12-18 15:36:00,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:36:00,032 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-18 15:36:00,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:36:00,379 INFO L225 Difference]: With dead ends: 115987 [2019-12-18 15:36:00,380 INFO L226 Difference]: Without dead ends: 115977 [2019-12-18 15:36:00,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:36:00,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115977 states. [2019-12-18 15:36:02,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115977 to 33338. [2019-12-18 15:36:02,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33338 states. [2019-12-18 15:36:02,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33338 states to 33338 states and 179968 transitions. [2019-12-18 15:36:02,797 INFO L78 Accepts]: Start accepts. Automaton has 33338 states and 179968 transitions. Word has length 25 [2019-12-18 15:36:02,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:36:02,798 INFO L462 AbstractCegarLoop]: Abstraction has 33338 states and 179968 transitions. [2019-12-18 15:36:02,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:36:02,798 INFO L276 IsEmpty]: Start isEmpty. Operand 33338 states and 179968 transitions. [2019-12-18 15:36:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:36:02,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:36:02,800 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:36:03,001 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:36:03,001 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:36:03,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:36:03,002 INFO L82 PathProgramCache]: Analyzing trace with hash 591228706, now seen corresponding path program 3 times [2019-12-18 15:36:03,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:36:03,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095773591] [2019-12-18 15:36:03,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:36:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:36:03,055 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 15:36:03,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095773591] [2019-12-18 15:36:03,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132080100] [2019-12-18 15:36:03,055 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:36:03,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 15:36:03,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:36:03,146 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:36:03,147 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:36:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 15:36:03,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:36:03,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:36:03,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258022950] [2019-12-18 15:36:03,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:36:03,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:36:03,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:36:03,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:36:03,227 INFO L87 Difference]: Start difference. First operand 33338 states and 179968 transitions. Second operand 16 states. [2019-12-18 15:36:04,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:36:04,800 INFO L93 Difference]: Finished difference Result 115083 states and 530519 transitions. [2019-12-18 15:36:04,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:36:04,801 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-18 15:36:04,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:36:05,801 INFO L225 Difference]: With dead ends: 115083 [2019-12-18 15:36:05,801 INFO L226 Difference]: Without dead ends: 115073 [2019-12-18 15:36:05,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:36:06,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115073 states. [2019-12-18 15:36:07,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115073 to 33016. [2019-12-18 15:36:07,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33016 states. [2019-12-18 15:36:07,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33016 states to 33016 states and 178303 transitions. [2019-12-18 15:36:07,282 INFO L78 Accepts]: Start accepts. Automaton has 33016 states and 178303 transitions. Word has length 25 [2019-12-18 15:36:07,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:36:07,282 INFO L462 AbstractCegarLoop]: Abstraction has 33016 states and 178303 transitions. [2019-12-18 15:36:07,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:36:07,282 INFO L276 IsEmpty]: Start isEmpty. Operand 33016 states and 178303 transitions. [2019-12-18 15:36:07,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:36:07,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:36:07,284 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:36:07,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:36:07,486 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:36:07,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:36:07,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1853254278, now seen corresponding path program 4 times [2019-12-18 15:36:07,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:36:07,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766129476] [2019-12-18 15:36:07,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:36:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:36:07,545 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 15:36:07,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766129476] [2019-12-18 15:36:07,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170676009] [2019-12-18 15:36:07,546 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:36:07,636 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:36:07,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:36:07,638 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:36:07,638 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:36:07,716 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 15:36:07,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:36:07,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:36:07,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467465535] [2019-12-18 15:36:07,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:36:07,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:36:07,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:36:07,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:36:07,718 INFO L87 Difference]: Start difference. First operand 33016 states and 178303 transitions. Second operand 16 states. [2019-12-18 15:36:09,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:36:09,747 INFO L93 Difference]: Finished difference Result 116129 states and 535807 transitions. [2019-12-18 15:36:09,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:36:09,748 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-18 15:36:09,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:36:10,097 INFO L225 Difference]: With dead ends: 116129 [2019-12-18 15:36:10,098 INFO L226 Difference]: Without dead ends: 116115 [2019-12-18 15:36:10,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:36:10,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116115 states. [2019-12-18 15:36:11,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116115 to 32873. [2019-12-18 15:36:11,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32873 states. [2019-12-18 15:36:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32873 states to 32873 states and 177431 transitions. [2019-12-18 15:36:11,740 INFO L78 Accepts]: Start accepts. Automaton has 32873 states and 177431 transitions. Word has length 25 [2019-12-18 15:36:11,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:36:11,740 INFO L462 AbstractCegarLoop]: Abstraction has 32873 states and 177431 transitions. [2019-12-18 15:36:11,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:36:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 32873 states and 177431 transitions. [2019-12-18 15:36:11,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:36:11,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:36:11,743 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:36:11,943 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:36:11,944 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:36:11,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:36:11,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1853255208, now seen corresponding path program 4 times [2019-12-18 15:36:11,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:36:11,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850136104] [2019-12-18 15:36:11,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:36:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:36:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 15:36:12,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850136104] [2019-12-18 15:36:12,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576657161] [2019-12-18 15:36:12,006 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:36:12,095 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:36:12,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:36:12,096 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:36:12,097 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:36:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 15:36:12,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:36:12,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-18 15:36:12,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958063558] [2019-12-18 15:36:12,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:36:12,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:36:12,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:36:12,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:36:12,189 INFO L87 Difference]: Start difference. First operand 32873 states and 177431 transitions. Second operand 16 states. [2019-12-18 15:36:14,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:36:14,106 INFO L93 Difference]: Finished difference Result 115140 states and 530994 transitions. [2019-12-18 15:36:14,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:36:14,106 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-18 15:36:14,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:36:14,442 INFO L225 Difference]: With dead ends: 115140 [2019-12-18 15:36:14,442 INFO L226 Difference]: Without dead ends: 115126 [2019-12-18 15:36:14,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:36:14,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115126 states. [2019-12-18 15:36:15,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115126 to 32414. [2019-12-18 15:36:15,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32414 states. [2019-12-18 15:36:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32414 states to 32414 states and 174844 transitions. [2019-12-18 15:36:16,088 INFO L78 Accepts]: Start accepts. Automaton has 32414 states and 174844 transitions. Word has length 25 [2019-12-18 15:36:16,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:36:16,088 INFO L462 AbstractCegarLoop]: Abstraction has 32414 states and 174844 transitions. [2019-12-18 15:36:16,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:36:16,088 INFO L276 IsEmpty]: Start isEmpty. Operand 32414 states and 174844 transitions. [2019-12-18 15:36:16,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:36:16,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:36:16,091 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:36:16,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:36:16,292 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:36:16,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:36:16,293 INFO L82 PathProgramCache]: Analyzing trace with hash -2130118454, now seen corresponding path program 1 times [2019-12-18 15:36:16,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:36:16,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891598181] [2019-12-18 15:36:16,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:36:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:36:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-18 15:36:16,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891598181] [2019-12-18 15:36:16,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:36:16,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:36:16,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165922072] [2019-12-18 15:36:16,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:36:16,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:36:16,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:36:16,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:36:16,329 INFO L87 Difference]: Start difference. First operand 32414 states and 174844 transitions. Second operand 5 states. [2019-12-18 15:36:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:36:16,971 INFO L93 Difference]: Finished difference Result 57346 states and 297742 transitions. [2019-12-18 15:36:16,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:36:16,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 15:36:16,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:36:17,152 INFO L225 Difference]: With dead ends: 57346 [2019-12-18 15:36:17,152 INFO L226 Difference]: Without dead ends: 57314 [2019-12-18 15:36:17,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:36:17,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57314 states. [2019-12-18 15:36:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57314 to 40877. [2019-12-18 15:36:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40877 states. [2019-12-18 15:36:18,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40877 states to 40877 states and 221122 transitions. [2019-12-18 15:36:18,323 INFO L78 Accepts]: Start accepts. Automaton has 40877 states and 221122 transitions. Word has length 25 [2019-12-18 15:36:18,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:36:18,323 INFO L462 AbstractCegarLoop]: Abstraction has 40877 states and 221122 transitions. [2019-12-18 15:36:18,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:36:18,323 INFO L276 IsEmpty]: Start isEmpty. Operand 40877 states and 221122 transitions. [2019-12-18 15:36:18,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:36:18,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:36:18,326 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:36:18,326 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:36:18,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:36:18,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1663507096, now seen corresponding path program 5 times [2019-12-18 15:36:18,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:36:18,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427621929] [2019-12-18 15:36:18,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:36:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:36:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:36:18,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427621929] [2019-12-18 15:36:18,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:36:18,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:36:18,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770933234] [2019-12-18 15:36:18,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:36:18,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:36:18,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:36:18,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:36:18,391 INFO L87 Difference]: Start difference. First operand 40877 states and 221122 transitions. Second operand 9 states. [2019-12-18 15:36:20,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:36:20,457 INFO L93 Difference]: Finished difference Result 137111 states and 643211 transitions. [2019-12-18 15:36:20,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:36:20,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 15:36:20,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:36:20,864 INFO L225 Difference]: With dead ends: 137111 [2019-12-18 15:36:20,864 INFO L226 Difference]: Without dead ends: 137095 [2019-12-18 15:36:20,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:36:21,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137095 states. [2019-12-18 15:36:22,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137095 to 40351. [2019-12-18 15:36:22,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40351 states. [2019-12-18 15:36:22,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40351 states to 40351 states and 218114 transitions. [2019-12-18 15:36:22,640 INFO L78 Accepts]: Start accepts. Automaton has 40351 states and 218114 transitions. Word has length 25 [2019-12-18 15:36:22,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:36:22,640 INFO L462 AbstractCegarLoop]: Abstraction has 40351 states and 218114 transitions. [2019-12-18 15:36:22,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:36:22,640 INFO L276 IsEmpty]: Start isEmpty. Operand 40351 states and 218114 transitions. [2019-12-18 15:36:22,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:36:22,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:36:22,642 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:36:22,643 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:36:22,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:36:22,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1663508026, now seen corresponding path program 5 times [2019-12-18 15:36:22,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:36:22,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840184830] [2019-12-18 15:36:22,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:36:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:36:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:36:22,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840184830] [2019-12-18 15:36:22,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:36:22,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:36:22,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742968857] [2019-12-18 15:36:22,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:36:22,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:36:22,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:36:22,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:36:22,699 INFO L87 Difference]: Start difference. First operand 40351 states and 218114 transitions. Second operand 9 states. [2019-12-18 15:36:23,122 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-12-18 15:36:24,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:36:24,419 INFO L93 Difference]: Finished difference Result 135413 states and 634564 transitions. [2019-12-18 15:36:24,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:36:24,419 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 15:36:24,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:36:24,807 INFO L225 Difference]: With dead ends: 135413 [2019-12-18 15:36:24,807 INFO L226 Difference]: Without dead ends: 135397 [2019-12-18 15:36:24,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:36:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135397 states. [2019-12-18 15:36:27,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135397 to 39763. [2019-12-18 15:36:27,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39763 states. [2019-12-18 15:36:27,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39763 states to 39763 states and 214832 transitions. [2019-12-18 15:36:27,269 INFO L78 Accepts]: Start accepts. Automaton has 39763 states and 214832 transitions. Word has length 25 [2019-12-18 15:36:27,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:36:27,269 INFO L462 AbstractCegarLoop]: Abstraction has 39763 states and 214832 transitions. [2019-12-18 15:36:27,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:36:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 39763 states and 214832 transitions. [2019-12-18 15:36:27,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:36:27,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:36:27,272 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:36:27,272 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:36:27,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:36:27,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1652079256, now seen corresponding path program 6 times [2019-12-18 15:36:27,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:36:27,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678969421] [2019-12-18 15:36:27,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:36:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:36:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:36:27,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678969421] [2019-12-18 15:36:27,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:36:27,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:36:27,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850836388] [2019-12-18 15:36:27,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:36:27,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:36:27,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:36:27,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:36:27,338 INFO L87 Difference]: Start difference. First operand 39763 states and 214832 transitions. Second operand 9 states. [2019-12-18 15:36:28,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:36:28,709 INFO L93 Difference]: Finished difference Result 134367 states and 628945 transitions. [2019-12-18 15:36:28,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:36:28,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 15:36:28,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:36:29,086 INFO L225 Difference]: With dead ends: 134367 [2019-12-18 15:36:29,087 INFO L226 Difference]: Without dead ends: 134347 [2019-12-18 15:36:29,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:36:29,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134347 states. [2019-12-18 15:36:31,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134347 to 38738. [2019-12-18 15:36:31,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38738 states. [2019-12-18 15:36:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38738 states to 38738 states and 209215 transitions. [2019-12-18 15:36:31,521 INFO L78 Accepts]: Start accepts. Automaton has 38738 states and 209215 transitions. Word has length 25 [2019-12-18 15:36:31,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:36:31,521 INFO L462 AbstractCegarLoop]: Abstraction has 38738 states and 209215 transitions. [2019-12-18 15:36:31,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:36:31,522 INFO L276 IsEmpty]: Start isEmpty. Operand 38738 states and 209215 transitions. [2019-12-18 15:36:31,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:36:31,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:36:31,524 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:36:31,524 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:36:31,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:36:31,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1652068282, now seen corresponding path program 5 times [2019-12-18 15:36:31,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:36:31,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439177732] [2019-12-18 15:36:31,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:36:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:36:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:36:31,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439177732] [2019-12-18 15:36:31,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:36:31,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:36:31,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777792478] [2019-12-18 15:36:31,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:36:31,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:36:31,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:36:31,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:36:31,582 INFO L87 Difference]: Start difference. First operand 38738 states and 209215 transitions. Second operand 9 states. [2019-12-18 15:36:33,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:36:33,584 INFO L93 Difference]: Finished difference Result 133134 states and 622505 transitions. [2019-12-18 15:36:33,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:36:33,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 15:36:33,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:36:33,960 INFO L225 Difference]: With dead ends: 133134 [2019-12-18 15:36:33,961 INFO L226 Difference]: Without dead ends: 133118 [2019-12-18 15:36:33,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:36:34,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133118 states. [2019-12-18 15:36:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133118 to 38374. [2019-12-18 15:36:35,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38374 states. [2019-12-18 15:36:35,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38374 states to 38374 states and 207228 transitions. [2019-12-18 15:36:35,621 INFO L78 Accepts]: Start accepts. Automaton has 38374 states and 207228 transitions. Word has length 25 [2019-12-18 15:36:35,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:36:35,622 INFO L462 AbstractCegarLoop]: Abstraction has 38374 states and 207228 transitions. [2019-12-18 15:36:35,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:36:35,622 INFO L276 IsEmpty]: Start isEmpty. Operand 38374 states and 207228 transitions. [2019-12-18 15:36:35,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:36:35,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:36:35,624 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:36:35,624 INFO L410 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:36:35,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:36:35,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1652972986, now seen corresponding path program 6 times [2019-12-18 15:36:35,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:36:35,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879524611] [2019-12-18 15:36:35,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:36:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:36:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 15:36:35,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879524611] [2019-12-18 15:36:35,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:36:35,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:36:35,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939189362] [2019-12-18 15:36:35,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:36:35,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:36:35,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:36:35,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:36:35,690 INFO L87 Difference]: Start difference. First operand 38374 states and 207228 transitions. Second operand 9 states. Received shutdown request... [2019-12-18 15:36:36,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 15:36:36,323 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 15:36:36,326 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 15:36:36,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:36:36 BasicIcfg [2019-12-18 15:36:36,327 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:36:36,328 INFO L168 Benchmark]: Toolchain (without parser) took 233178.13 ms. Allocated memory was 137.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 101.4 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-18 15:36:36,328 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 15:36:36,328 INFO L168 Benchmark]: CACSL2BoogieTranslator took 703.61 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 101.2 MB in the beginning and 161.9 MB in the end (delta: -60.7 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2019-12-18 15:36:36,328 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.34 ms. Allocated memory is still 201.3 MB. Free memory was 161.9 MB in the beginning and 159.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-18 15:36:36,329 INFO L168 Benchmark]: Boogie Preprocessor took 27.28 ms. Allocated memory is still 201.3 MB. Free memory was 159.7 MB in the beginning and 158.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-18 15:36:36,329 INFO L168 Benchmark]: RCFGBuilder took 384.57 ms. Allocated memory is still 201.3 MB. Free memory was 158.4 MB in the beginning and 138.9 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2019-12-18 15:36:36,329 INFO L168 Benchmark]: TraceAbstraction took 232007.37 ms. Allocated memory was 201.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 138.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-18 15:36:36,331 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 703.61 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 101.2 MB in the beginning and 161.9 MB in the end (delta: -60.7 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 49.34 ms. Allocated memory is still 201.3 MB. Free memory was 161.9 MB in the beginning and 159.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.28 ms. Allocated memory is still 201.3 MB. Free memory was 159.7 MB in the beginning and 158.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 384.57 ms. Allocated memory is still 201.3 MB. Free memory was 158.4 MB in the beginning and 138.9 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 232007.37 ms. Allocated memory was 201.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 138.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.6s, 57 ProgramPointsBefore, 15 ProgramPointsAfterwards, 53 TransitionsBefore, 12 TransitionsAfterwards, 592 CoEnabledTransitionPairs, 6 FixpointIterations, 17 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 326 VarBasedMoverChecksPositive, 3 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 3 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 489 CheckedPairsTotal, 46 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.5s, 76 ProgramPointsBefore, 26 ProgramPointsAfterwards, 69 TransitionsBefore, 21 TransitionsAfterwards, 920 CoEnabledTransitionPairs, 6 FixpointIterations, 28 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 516 VarBasedMoverChecksPositive, 12 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 15 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1034 CheckedPairsTotal, 57 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.7s, 95 ProgramPointsBefore, 34 ProgramPointsAfterwards, 85 TransitionsBefore, 27 TransitionsAfterwards, 1308 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 2 ConcurrentYvCompositions, 4 ChoiceCompositions, 625 VarBasedMoverChecksPositive, 16 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 19 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1615 CheckedPairsTotal, 69 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.9s, 114 ProgramPointsBefore, 42 ProgramPointsAfterwards, 101 TransitionsBefore, 33 TransitionsAfterwards, 1756 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 4 ConcurrentYvCompositions, 5 ChoiceCompositions, 851 VarBasedMoverChecksPositive, 17 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 19 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2111 CheckedPairsTotal, 84 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.8s, 133 ProgramPointsBefore, 50 ProgramPointsAfterwards, 117 TransitionsBefore, 39 TransitionsAfterwards, 2264 CoEnabledTransitionPairs, 6 FixpointIterations, 52 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 3 ConcurrentYvCompositions, 6 ChoiceCompositions, 1089 VarBasedMoverChecksPositive, 20 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 21 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2604 CheckedPairsTotal, 97 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.5s, 152 ProgramPointsBefore, 58 ProgramPointsAfterwards, 133 TransitionsBefore, 45 TransitionsAfterwards, 2832 CoEnabledTransitionPairs, 6 FixpointIterations, 62 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 4 ConcurrentYvCompositions, 7 ChoiceCompositions, 1357 VarBasedMoverChecksPositive, 25 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 27 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 3471 CheckedPairsTotal, 112 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (38374states) and FLOYD_HOARE automaton (currently 24 states, 9 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 51 locations, 1 error locations. Result: TIMEOUT, OverallTime: 153.0s, OverallIterations: 41, TraceHistogramMax: 5, AutomataDifference: 67.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2517 SDtfs, 12254 SDslu, 10046 SDs, 0 SdLazy, 18220 SolverSat, 997 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1352 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 1009 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7258 ImplicationChecksByTransitivity, 11.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40877occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 71.0s AutomataMinimizationTime, 40 MinimizatonAttempts, 2371707 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1389 NumberOfCodeBlocks, 1365 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 1326 ConstructedInterpolants, 0 QuantifiedInterpolants, 192220 SizeOfPredicates, 120 NumberOfNonLiveVariables, 2460 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 63 InterpolantComputations, 19 PerfectInterpolantSequences, 502/878 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown