/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/concurrent/pthreads/forkFork.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 03:04:13,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 03:04:13,167 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 03:04:13,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 03:04:13,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 03:04:13,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 03:04:13,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 03:04:13,214 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 03:04:13,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 03:04:13,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 03:04:13,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 03:04:13,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 03:04:13,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 03:04:13,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 03:04:13,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 03:04:13,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 03:04:13,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 03:04:13,229 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 03:04:13,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 03:04:13,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 03:04:13,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 03:04:13,239 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 03:04:13,240 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 03:04:13,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 03:04:13,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 03:04:13,248 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 03:04:13,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 03:04:13,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 03:04:13,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 03:04:13,251 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 03:04:13,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 03:04:13,252 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 03:04:13,253 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 03:04:13,254 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 03:04:13,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 03:04:13,255 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 03:04:13,255 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 03:04:13,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 03:04:13,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 03:04:13,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 03:04:13,257 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 03:04:13,260 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-06-05 03:04:13,295 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 03:04:13,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 03:04:13,296 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 03:04:13,296 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 03:04:13,298 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 03:04:13,298 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 03:04:13,298 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 03:04:13,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 03:04:13,299 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 03:04:13,299 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 03:04:13,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 03:04:13,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 03:04:13,300 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 03:04:13,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 03:04:13,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 03:04:13,301 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 03:04:13,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 03:04:13,301 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 03:04:13,301 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 03:04:13,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 03:04:13,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 03:04:13,302 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 03:04:13,302 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 03:04:13,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 03:04:13,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 03:04:13,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 03:04:13,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 03:04:13,302 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 03:04:13,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 03:04:13,303 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 03:04:13,303 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 03:04:13,303 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 03:04:13,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 03:04:13,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 03:04:13,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 03:04:13,642 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 03:04:13,644 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 03:04:13,644 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/pthreads/forkFork.c [2021-06-05 03:04:13,702 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2295ce040/7dd4b560fd7a4592843ca46220a44bf9/FLAGe39bad6eb [2021-06-05 03:04:14,146 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 03:04:14,147 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/concurrent/pthreads/forkFork.c [2021-06-05 03:04:14,147 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2021-06-05 03:04:14,147 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2021-06-05 03:04:14,186 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2295ce040/7dd4b560fd7a4592843ca46220a44bf9/FLAGe39bad6eb [2021-06-05 03:04:14,552 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2295ce040/7dd4b560fd7a4592843ca46220a44bf9 [2021-06-05 03:04:14,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 03:04:14,555 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 03:04:14,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 03:04:14,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 03:04:14,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 03:04:14,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 03:04:14" (1/1) ... [2021-06-05 03:04:14,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fe2a1bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 03:04:14, skipping insertion in model container [2021-06-05 03:04:14,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 03:04:14" (1/1) ... [2021-06-05 03:04:14,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 03:04:14,580 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 03:04:14,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 03:04:14,745 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 03:04:14,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 03:04:14,832 INFO L208 MainTranslator]: Completed translation [2021-06-05 03:04:14,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 03:04:14 WrapperNode [2021-06-05 03:04:14,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 03:04:14,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 03:04:14,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 03:04:14,836 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 03:04:14,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 03:04:14" (1/1) ... [2021-06-05 03:04:14,849 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 03:04:14" (1/1) ... [2021-06-05 03:04:14,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 03:04:14,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 03:04:14,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 03:04:14,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 03:04:14,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 03:04:14" (1/1) ... [2021-06-05 03:04:14,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 03:04:14" (1/1) ... [2021-06-05 03:04:14,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 03:04:14" (1/1) ... [2021-06-05 03:04:14,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 03:04:14" (1/1) ... [2021-06-05 03:04:14,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 03:04:14" (1/1) ... [2021-06-05 03:04:14,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 03:04:14" (1/1) ... [2021-06-05 03:04:14,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 03:04:14" (1/1) ... [2021-06-05 03:04:14,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 03:04:14,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 03:04:14,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 03:04:14,898 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 03:04:14,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 03:04:14" (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 [2021-06-05 03:04:14,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-06-05 03:04:14,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 03:04:14,972 INFO L130 BoogieDeclarations]: Found specification of procedure bar [2021-06-05 03:04:14,972 INFO L138 BoogieDeclarations]: Found implementation of procedure bar [2021-06-05 03:04:14,973 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2021-06-05 03:04:14,973 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2021-06-05 03:04:14,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 03:04:14,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 03:04:14,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 03:04:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 03:04:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-06-05 03:04:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 03:04:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 03:04:14,975 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 03:04:15,323 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 03:04:15,323 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-06-05 03:04:15,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 03:04:15 BoogieIcfgContainer [2021-06-05 03:04:15,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 03:04:15,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 03:04:15,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 03:04:15,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 03:04:15,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 03:04:14" (1/3) ... [2021-06-05 03:04:15,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c88822a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 03:04:15, skipping insertion in model container [2021-06-05 03:04:15,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 03:04:14" (2/3) ... [2021-06-05 03:04:15,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c88822a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 03:04:15, skipping insertion in model container [2021-06-05 03:04:15,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 03:04:15" (3/3) ... [2021-06-05 03:04:15,331 INFO L111 eAbstractionObserver]: Analyzing ICFG forkFork.c [2021-06-05 03:04:15,336 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 03:04:15,336 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 03:04:15,336 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 03:04:15,337 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 03:04:15,362 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#in~b.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,363 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#in~b.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,363 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,363 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,363 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#in~b.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,363 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#in~b.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,363 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,364 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,364 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,364 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,364 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,364 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,364 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,365 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,365 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,365 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,365 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,365 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,365 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,365 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,366 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,366 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,366 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,366 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,366 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,366 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,367 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,367 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,367 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,367 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,367 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,368 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,368 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,368 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,368 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,368 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,368 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,369 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,369 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,369 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,369 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,369 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,369 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,370 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,370 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,370 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,370 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,370 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,370 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,371 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,371 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,371 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,371 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,371 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,372 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#in~a.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,372 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#in~a.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,372 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,372 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,372 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#in~a.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,373 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#in~a.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,373 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,373 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,373 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,373 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,374 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,374 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,374 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,374 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,374 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~param~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,374 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~param~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,375 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,375 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,375 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~param~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,375 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~param~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,375 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,375 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,375 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,376 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,376 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,376 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,376 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,376 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,377 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,377 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,377 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,377 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,377 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,378 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,378 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,378 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,378 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,378 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,378 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,379 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,379 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,379 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,379 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,380 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,380 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,380 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,380 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,380 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,381 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,381 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,381 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,381 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,381 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,381 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,382 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,382 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,382 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,382 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,382 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,382 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,382 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,383 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,383 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,383 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,383 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,383 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,383 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,383 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,383 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,384 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,384 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,384 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,384 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,384 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,384 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,384 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,385 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,385 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,385 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,385 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,385 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,385 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,385 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,386 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,386 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,386 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,386 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,386 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,388 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,388 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,388 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,388 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,389 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,389 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,389 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,389 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,389 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,393 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,394 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,394 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,394 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~param~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,394 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,394 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~param~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,394 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,394 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,395 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,395 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,395 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,395 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,395 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,395 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,395 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,396 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,396 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,398 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,398 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,398 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,399 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,399 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,399 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,399 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,399 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,399 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 03:04:15,418 INFO L149 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2021-06-05 03:04:15,437 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-05 03:04:15,453 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 03:04:15,453 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 03:04:15,454 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 03:04:15,454 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 03:04:15,454 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 03:04:15,454 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 03:04:15,454 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 03:04:15,454 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 03:04:15,465 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 89 transitions, 206 flow [2021-06-05 03:04:15,494 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 477 states, 472 states have (on average 2.1440677966101696) internal successors, (1012), 476 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:15,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 477 states, 472 states have (on average 2.1440677966101696) internal successors, (1012), 476 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:15,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-06-05 03:04:15,506 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:15,506 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:15,507 INFO L430 AbstractCegarLoop]: === Iteration 1 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:15,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:15,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1964643420, now seen corresponding path program 1 times [2021-06-05 03:04:15,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:15,518 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120611223] [2021-06-05 03:04:15,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:16,031 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:16,032 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120611223] [2021-06-05 03:04:16,033 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120611223] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:16,033 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:16,033 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 03:04:16,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11199837] [2021-06-05 03:04:16,038 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 03:04:16,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:16,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 03:04:16,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-06-05 03:04:16,057 INFO L87 Difference]: Start difference. First operand has 477 states, 472 states have (on average 2.1440677966101696) internal successors, (1012), 476 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 17 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:16,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:16,881 INFO L93 Difference]: Finished difference Result 457 states and 961 transitions. [2021-06-05 03:04:16,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 03:04:16,883 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-06-05 03:04:16,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:16,893 INFO L225 Difference]: With dead ends: 457 [2021-06-05 03:04:16,894 INFO L226 Difference]: Without dead ends: 407 [2021-06-05 03:04:16,895 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 625.4ms TimeCoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992 [2021-06-05 03:04:16,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-06-05 03:04:16,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2021-06-05 03:04:16,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 405 states have (on average 2.1753086419753087) internal successors, (881), 406 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 881 transitions. [2021-06-05 03:04:16,948 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 881 transitions. Word has length 26 [2021-06-05 03:04:16,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:16,954 INFO L482 AbstractCegarLoop]: Abstraction has 407 states and 881 transitions. [2021-06-05 03:04:16,954 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:16,954 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 881 transitions. [2021-06-05 03:04:16,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-06-05 03:04:16,958 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:16,958 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:16,958 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 03:04:16,958 INFO L430 AbstractCegarLoop]: === Iteration 2 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:16,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:16,959 INFO L82 PathProgramCache]: Analyzing trace with hash 982709772, now seen corresponding path program 1 times [2021-06-05 03:04:16,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:16,959 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273846479] [2021-06-05 03:04:16,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:17,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:17,345 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:17,345 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273846479] [2021-06-05 03:04:17,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273846479] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:17,346 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:17,346 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 03:04:17,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094635864] [2021-06-05 03:04:17,347 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 03:04:17,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:17,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 03:04:17,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-06-05 03:04:17,350 INFO L87 Difference]: Start difference. First operand 407 states and 881 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:17,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:17,576 INFO L93 Difference]: Finished difference Result 473 states and 981 transitions. [2021-06-05 03:04:17,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 03:04:17,576 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-06-05 03:04:17,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:17,579 INFO L225 Difference]: With dead ends: 473 [2021-06-05 03:04:17,579 INFO L226 Difference]: Without dead ends: 473 [2021-06-05 03:04:17,580 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 259.2ms TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 03:04:17,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-06-05 03:04:17,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 458. [2021-06-05 03:04:17,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 456 states have (on average 2.1184210526315788) internal successors, (966), 457 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:17,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 966 transitions. [2021-06-05 03:04:17,600 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 966 transitions. Word has length 46 [2021-06-05 03:04:17,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:17,600 INFO L482 AbstractCegarLoop]: Abstraction has 458 states and 966 transitions. [2021-06-05 03:04:17,600 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:17,600 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 966 transitions. [2021-06-05 03:04:17,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-06-05 03:04:17,603 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:17,603 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:17,603 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 03:04:17,604 INFO L430 AbstractCegarLoop]: === Iteration 3 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:17,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:17,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1370098458, now seen corresponding path program 2 times [2021-06-05 03:04:17,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:17,604 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339867156] [2021-06-05 03:04:17,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:17,869 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:17,869 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339867156] [2021-06-05 03:04:17,869 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339867156] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:17,869 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:17,870 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 03:04:17,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403084345] [2021-06-05 03:04:17,870 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 03:04:17,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:17,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 03:04:17,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-06-05 03:04:17,874 INFO L87 Difference]: Start difference. First operand 458 states and 966 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:18,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:18,128 INFO L93 Difference]: Finished difference Result 522 states and 1064 transitions. [2021-06-05 03:04:18,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 03:04:18,129 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-06-05 03:04:18,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:18,133 INFO L225 Difference]: With dead ends: 522 [2021-06-05 03:04:18,133 INFO L226 Difference]: Without dead ends: 522 [2021-06-05 03:04:18,134 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 235.4ms TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-06-05 03:04:18,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-06-05 03:04:18,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2021-06-05 03:04:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 454 states have (on average 2.1233480176211454) internal successors, (964), 455 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:18,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 964 transitions. [2021-06-05 03:04:18,148 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 964 transitions. Word has length 46 [2021-06-05 03:04:18,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:18,148 INFO L482 AbstractCegarLoop]: Abstraction has 456 states and 964 transitions. [2021-06-05 03:04:18,149 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:18,149 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 964 transitions. [2021-06-05 03:04:18,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-06-05 03:04:18,151 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:18,151 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:18,151 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 03:04:18,152 INFO L430 AbstractCegarLoop]: === Iteration 4 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:18,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:18,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1272071898, now seen corresponding path program 3 times [2021-06-05 03:04:18,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:18,152 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122167068] [2021-06-05 03:04:18,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:18,631 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:18,631 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122167068] [2021-06-05 03:04:18,632 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122167068] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:18,632 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:18,632 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 03:04:18,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55434659] [2021-06-05 03:04:18,632 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 03:04:18,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:18,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 03:04:18,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-06-05 03:04:18,633 INFO L87 Difference]: Start difference. First operand 456 states and 964 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:19,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:19,278 INFO L93 Difference]: Finished difference Result 584 states and 1176 transitions. [2021-06-05 03:04:19,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 03:04:19,278 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-06-05 03:04:19,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:19,281 INFO L225 Difference]: With dead ends: 584 [2021-06-05 03:04:19,281 INFO L226 Difference]: Without dead ends: 584 [2021-06-05 03:04:19,282 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 621.2ms TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2021-06-05 03:04:19,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2021-06-05 03:04:19,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 455. [2021-06-05 03:04:19,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 453 states have (on average 2.1258278145695364) internal successors, (963), 454 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 963 transitions. [2021-06-05 03:04:19,294 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 963 transitions. Word has length 46 [2021-06-05 03:04:19,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:19,294 INFO L482 AbstractCegarLoop]: Abstraction has 455 states and 963 transitions. [2021-06-05 03:04:19,294 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 963 transitions. [2021-06-05 03:04:19,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-06-05 03:04:19,296 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:19,296 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:19,296 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 03:04:19,296 INFO L430 AbstractCegarLoop]: === Iteration 5 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:19,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:19,297 INFO L82 PathProgramCache]: Analyzing trace with hash 240206360, now seen corresponding path program 4 times [2021-06-05 03:04:19,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:19,297 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632623368] [2021-06-05 03:04:19,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:19,664 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:19,664 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632623368] [2021-06-05 03:04:19,665 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632623368] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:19,665 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:19,665 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 03:04:19,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559028201] [2021-06-05 03:04:19,665 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 03:04:19,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:19,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 03:04:19,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-06-05 03:04:19,668 INFO L87 Difference]: Start difference. First operand 455 states and 963 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:20,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:20,212 INFO L93 Difference]: Finished difference Result 486 states and 1004 transitions. [2021-06-05 03:04:20,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 03:04:20,213 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-06-05 03:04:20,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:20,216 INFO L225 Difference]: With dead ends: 486 [2021-06-05 03:04:20,216 INFO L226 Difference]: Without dead ends: 486 [2021-06-05 03:04:20,216 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 471.4ms TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2021-06-05 03:04:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2021-06-05 03:04:20,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 423. [2021-06-05 03:04:20,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 421 states have (on average 2.1543942992874108) internal successors, (907), 422 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 907 transitions. [2021-06-05 03:04:20,226 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 907 transitions. Word has length 46 [2021-06-05 03:04:20,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:20,227 INFO L482 AbstractCegarLoop]: Abstraction has 423 states and 907 transitions. [2021-06-05 03:04:20,227 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:20,227 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 907 transitions. [2021-06-05 03:04:20,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-06-05 03:04:20,228 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:20,228 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:20,228 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 03:04:20,228 INFO L430 AbstractCegarLoop]: === Iteration 6 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:20,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:20,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1884213040, now seen corresponding path program 5 times [2021-06-05 03:04:20,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:20,229 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913174770] [2021-06-05 03:04:20,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:20,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:20,628 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:20,628 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913174770] [2021-06-05 03:04:20,629 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913174770] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:20,629 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:20,629 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-06-05 03:04:20,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395635702] [2021-06-05 03:04:20,629 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 03:04:20,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:20,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 03:04:20,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-06-05 03:04:20,630 INFO L87 Difference]: Start difference. First operand 423 states and 907 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:21,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:21,881 INFO L93 Difference]: Finished difference Result 442 states and 923 transitions. [2021-06-05 03:04:21,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-06-05 03:04:21,882 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-06-05 03:04:21,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:21,884 INFO L225 Difference]: With dead ends: 442 [2021-06-05 03:04:21,884 INFO L226 Difference]: Without dead ends: 442 [2021-06-05 03:04:21,885 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 978.4ms TimeCoverageRelationStatistics Valid=331, Invalid=1391, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 03:04:21,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2021-06-05 03:04:21,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 363. [2021-06-05 03:04:21,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 362 states have (on average 2.2099447513812156) internal successors, (800), 362 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 800 transitions. [2021-06-05 03:04:21,893 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 800 transitions. Word has length 46 [2021-06-05 03:04:21,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:21,893 INFO L482 AbstractCegarLoop]: Abstraction has 363 states and 800 transitions. [2021-06-05 03:04:21,893 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:21,894 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 800 transitions. [2021-06-05 03:04:21,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 03:04:21,894 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:21,895 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:21,895 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 03:04:21,895 INFO L430 AbstractCegarLoop]: === Iteration 7 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:21,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:21,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1424997685, now seen corresponding path program 1 times [2021-06-05 03:04:21,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:21,896 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405071459] [2021-06-05 03:04:21,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:22,367 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:22,367 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405071459] [2021-06-05 03:04:22,367 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405071459] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:22,367 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:22,367 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 03:04:22,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133491838] [2021-06-05 03:04:22,368 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 03:04:22,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:22,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 03:04:22,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2021-06-05 03:04:22,369 INFO L87 Difference]: Start difference. First operand 363 states and 800 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:24,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:24,055 INFO L93 Difference]: Finished difference Result 507 states and 1077 transitions. [2021-06-05 03:04:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 03:04:24,055 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 03:04:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:24,059 INFO L225 Difference]: With dead ends: 507 [2021-06-05 03:04:24,059 INFO L226 Difference]: Without dead ends: 361 [2021-06-05 03:04:24,060 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1459.5ms TimeCoverageRelationStatistics Valid=549, Invalid=2873, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 03:04:24,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-06-05 03:04:24,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2021-06-05 03:04:24,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 2.2111111111111112) internal successors, (796), 360 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:24,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 796 transitions. [2021-06-05 03:04:24,068 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 796 transitions. Word has length 61 [2021-06-05 03:04:24,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:24,068 INFO L482 AbstractCegarLoop]: Abstraction has 361 states and 796 transitions. [2021-06-05 03:04:24,068 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:24,068 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 796 transitions. [2021-06-05 03:04:24,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 03:04:24,069 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:24,070 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:24,070 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 03:04:24,070 INFO L430 AbstractCegarLoop]: === Iteration 8 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:24,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:24,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1323525531, now seen corresponding path program 2 times [2021-06-05 03:04:24,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:24,072 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026115562] [2021-06-05 03:04:24,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:24,572 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:24,573 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026115562] [2021-06-05 03:04:24,573 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026115562] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:24,573 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:24,573 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 03:04:24,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941188024] [2021-06-05 03:04:24,573 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 03:04:24,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:24,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 03:04:24,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2021-06-05 03:04:24,574 INFO L87 Difference]: Start difference. First operand 361 states and 796 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:26,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:26,245 INFO L93 Difference]: Finished difference Result 501 states and 1067 transitions. [2021-06-05 03:04:26,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 03:04:26,246 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 03:04:26,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:26,247 INFO L225 Difference]: With dead ends: 501 [2021-06-05 03:04:26,247 INFO L226 Difference]: Without dead ends: 357 [2021-06-05 03:04:26,248 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1401.5ms TimeCoverageRelationStatistics Valid=549, Invalid=2873, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 03:04:26,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-06-05 03:04:26,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-06-05 03:04:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.2134831460674156) internal successors, (788), 356 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 788 transitions. [2021-06-05 03:04:26,256 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 788 transitions. Word has length 61 [2021-06-05 03:04:26,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:26,256 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 788 transitions. [2021-06-05 03:04:26,256 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:26,257 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 788 transitions. [2021-06-05 03:04:26,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 03:04:26,257 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:26,257 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:26,258 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 03:04:26,258 INFO L430 AbstractCegarLoop]: === Iteration 9 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:26,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:26,258 INFO L82 PathProgramCache]: Analyzing trace with hash -823634075, now seen corresponding path program 3 times [2021-06-05 03:04:26,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:26,258 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052909935] [2021-06-05 03:04:26,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:26,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:26,658 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:26,659 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052909935] [2021-06-05 03:04:26,659 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052909935] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:26,659 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:26,659 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 03:04:26,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163323434] [2021-06-05 03:04:26,659 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 03:04:26,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:26,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 03:04:26,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2021-06-05 03:04:26,660 INFO L87 Difference]: Start difference. First operand 357 states and 788 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:28,634 INFO L93 Difference]: Finished difference Result 611 states and 1298 transitions. [2021-06-05 03:04:28,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-06-05 03:04:28,634 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 03:04:28,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:28,636 INFO L225 Difference]: With dead ends: 611 [2021-06-05 03:04:28,636 INFO L226 Difference]: Without dead ends: 473 [2021-06-05 03:04:28,637 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1723.1ms TimeCoverageRelationStatistics Valid=548, Invalid=2874, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 03:04:28,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-06-05 03:04:28,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 357. [2021-06-05 03:04:28,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.202247191011236) internal successors, (784), 356 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 784 transitions. [2021-06-05 03:04:28,645 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 784 transitions. Word has length 61 [2021-06-05 03:04:28,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:28,645 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 784 transitions. [2021-06-05 03:04:28,645 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:28,645 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 784 transitions. [2021-06-05 03:04:28,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 03:04:28,646 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:28,646 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:28,646 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 03:04:28,646 INFO L430 AbstractCegarLoop]: === Iteration 10 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:28,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:28,647 INFO L82 PathProgramCache]: Analyzing trace with hash -2085424731, now seen corresponding path program 4 times [2021-06-05 03:04:28,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:28,647 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39210430] [2021-06-05 03:04:28,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:29,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:29,082 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:29,082 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39210430] [2021-06-05 03:04:29,082 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39210430] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:29,082 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:29,082 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-05 03:04:29,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860796052] [2021-06-05 03:04:29,082 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 03:04:29,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:29,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 03:04:29,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2021-06-05 03:04:29,083 INFO L87 Difference]: Start difference. First operand 357 states and 784 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:30,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:30,610 INFO L93 Difference]: Finished difference Result 471 states and 1004 transitions. [2021-06-05 03:04:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-06-05 03:04:30,610 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 03:04:30,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:30,611 INFO L225 Difference]: With dead ends: 471 [2021-06-05 03:04:30,611 INFO L226 Difference]: Without dead ends: 373 [2021-06-05 03:04:30,612 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1288.8ms TimeCoverageRelationStatistics Valid=569, Invalid=3091, Unknown=0, NotChecked=0, Total=3660 [2021-06-05 03:04:30,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-06-05 03:04:30,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 357. [2021-06-05 03:04:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.1797752808988764) internal successors, (776), 356 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:30,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 776 transitions. [2021-06-05 03:04:30,625 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 776 transitions. Word has length 61 [2021-06-05 03:04:30,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:30,625 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 776 transitions. [2021-06-05 03:04:30,625 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:30,626 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 776 transitions. [2021-06-05 03:04:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 03:04:30,626 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:30,626 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:30,626 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 03:04:30,627 INFO L430 AbstractCegarLoop]: === Iteration 11 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:30,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:30,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1071374389, now seen corresponding path program 5 times [2021-06-05 03:04:30,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:30,627 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859401012] [2021-06-05 03:04:30,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:31,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:31,047 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:31,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859401012] [2021-06-05 03:04:31,047 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859401012] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:31,047 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:31,047 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 03:04:31,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230624605] [2021-06-05 03:04:31,048 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 03:04:31,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:31,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 03:04:31,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2021-06-05 03:04:31,049 INFO L87 Difference]: Start difference. First operand 357 states and 776 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:32,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:32,503 INFO L93 Difference]: Finished difference Result 447 states and 942 transitions. [2021-06-05 03:04:32,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 03:04:32,504 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 03:04:32,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:32,505 INFO L225 Difference]: With dead ends: 447 [2021-06-05 03:04:32,505 INFO L226 Difference]: Without dead ends: 365 [2021-06-05 03:04:32,506 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1255.8ms TimeCoverageRelationStatistics Valid=521, Invalid=2901, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 03:04:32,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-06-05 03:04:32,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 357. [2021-06-05 03:04:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.168539325842697) internal successors, (772), 356 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 772 transitions. [2021-06-05 03:04:32,513 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 772 transitions. Word has length 61 [2021-06-05 03:04:32,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:32,514 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 772 transitions. [2021-06-05 03:04:32,514 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:32,514 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 772 transitions. [2021-06-05 03:04:32,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 03:04:32,515 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:32,515 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:32,515 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 03:04:32,515 INFO L430 AbstractCegarLoop]: === Iteration 12 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:32,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:32,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1809708235, now seen corresponding path program 6 times [2021-06-05 03:04:32,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:32,516 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235760888] [2021-06-05 03:04:32,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:32,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:32,904 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:32,904 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235760888] [2021-06-05 03:04:32,904 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235760888] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:32,904 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:32,904 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 03:04:32,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910230545] [2021-06-05 03:04:32,905 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 03:04:32,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:32,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 03:04:32,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2021-06-05 03:04:32,906 INFO L87 Difference]: Start difference. First operand 357 states and 772 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:34,443 INFO L93 Difference]: Finished difference Result 439 states and 920 transitions. [2021-06-05 03:04:34,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 03:04:34,444 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 03:04:34,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:34,445 INFO L225 Difference]: With dead ends: 439 [2021-06-05 03:04:34,445 INFO L226 Difference]: Without dead ends: 365 [2021-06-05 03:04:34,446 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 1321.0ms TimeCoverageRelationStatistics Valid=566, Invalid=3094, Unknown=0, NotChecked=0, Total=3660 [2021-06-05 03:04:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-06-05 03:04:34,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 357. [2021-06-05 03:04:34,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.157303370786517) internal successors, (768), 356 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:34,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 768 transitions. [2021-06-05 03:04:34,453 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 768 transitions. Word has length 61 [2021-06-05 03:04:34,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:34,453 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 768 transitions. [2021-06-05 03:04:34,453 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:34,453 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 768 transitions. [2021-06-05 03:04:34,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 03:04:34,454 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:34,454 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:34,454 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 03:04:34,455 INFO L430 AbstractCegarLoop]: === Iteration 13 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:34,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:34,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1648857061, now seen corresponding path program 7 times [2021-06-05 03:04:34,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:34,455 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158176118] [2021-06-05 03:04:34,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:34,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:34,812 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:34,812 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158176118] [2021-06-05 03:04:34,812 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158176118] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:34,812 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:34,812 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-05 03:04:34,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883714346] [2021-06-05 03:04:34,812 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 03:04:34,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:34,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 03:04:34,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2021-06-05 03:04:34,813 INFO L87 Difference]: Start difference. First operand 357 states and 768 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:36,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:36,270 INFO L93 Difference]: Finished difference Result 459 states and 942 transitions. [2021-06-05 03:04:36,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 03:04:36,271 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 03:04:36,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:36,272 INFO L225 Difference]: With dead ends: 459 [2021-06-05 03:04:36,272 INFO L226 Difference]: Without dead ends: 393 [2021-06-05 03:04:36,273 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1236.7ms TimeCoverageRelationStatistics Valid=581, Invalid=3079, Unknown=0, NotChecked=0, Total=3660 [2021-06-05 03:04:36,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2021-06-05 03:04:36,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 357. [2021-06-05 03:04:36,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.134831460674157) internal successors, (760), 356 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:36,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 760 transitions. [2021-06-05 03:04:36,280 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 760 transitions. Word has length 61 [2021-06-05 03:04:36,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:36,280 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 760 transitions. [2021-06-05 03:04:36,280 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:36,280 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 760 transitions. [2021-06-05 03:04:36,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 03:04:36,281 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:36,281 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:36,281 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 03:04:36,281 INFO L430 AbstractCegarLoop]: === Iteration 14 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:36,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:36,282 INFO L82 PathProgramCache]: Analyzing trace with hash 146013925, now seen corresponding path program 8 times [2021-06-05 03:04:36,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:36,282 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007001607] [2021-06-05 03:04:36,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:36,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:36,658 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:36,658 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007001607] [2021-06-05 03:04:36,658 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007001607] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:36,658 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:36,658 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-05 03:04:36,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418305616] [2021-06-05 03:04:36,658 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 03:04:36,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:36,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 03:04:36,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2021-06-05 03:04:36,659 INFO L87 Difference]: Start difference. First operand 357 states and 760 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:38,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:38,062 INFO L93 Difference]: Finished difference Result 427 states and 866 transitions. [2021-06-05 03:04:38,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-06-05 03:04:38,063 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 03:04:38,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:38,064 INFO L225 Difference]: With dead ends: 427 [2021-06-05 03:04:38,064 INFO L226 Difference]: Without dead ends: 377 [2021-06-05 03:04:38,065 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1171.1ms TimeCoverageRelationStatistics Valid=556, Invalid=2984, Unknown=0, NotChecked=0, Total=3540 [2021-06-05 03:04:38,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-06-05 03:04:38,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 357. [2021-06-05 03:04:38,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.1123595505617976) internal successors, (752), 356 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 752 transitions. [2021-06-05 03:04:38,071 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 752 transitions. Word has length 61 [2021-06-05 03:04:38,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:38,072 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 752 transitions. [2021-06-05 03:04:38,072 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 752 transitions. [2021-06-05 03:04:38,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 03:04:38,073 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:38,073 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:38,073 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 03:04:38,073 INFO L430 AbstractCegarLoop]: === Iteration 15 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:38,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:38,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1525657893, now seen corresponding path program 9 times [2021-06-05 03:04:38,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:38,073 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841646781] [2021-06-05 03:04:38,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:38,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:38,433 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:38,433 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841646781] [2021-06-05 03:04:38,433 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841646781] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:38,433 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:38,433 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-05 03:04:38,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435783075] [2021-06-05 03:04:38,433 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 03:04:38,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:38,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 03:04:38,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2021-06-05 03:04:38,434 INFO L87 Difference]: Start difference. First operand 357 states and 752 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:39,816 INFO L93 Difference]: Finished difference Result 395 states and 802 transitions. [2021-06-05 03:04:39,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 03:04:39,816 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 03:04:39,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:39,817 INFO L225 Difference]: With dead ends: 395 [2021-06-05 03:04:39,817 INFO L226 Difference]: Without dead ends: 361 [2021-06-05 03:04:39,818 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1190.9ms TimeCoverageRelationStatistics Valid=547, Invalid=2993, Unknown=0, NotChecked=0, Total=3540 [2021-06-05 03:04:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-06-05 03:04:39,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 357. [2021-06-05 03:04:39,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.109550561797753) internal successors, (751), 356 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 751 transitions. [2021-06-05 03:04:39,825 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 751 transitions. Word has length 61 [2021-06-05 03:04:39,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:39,825 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 751 transitions. [2021-06-05 03:04:39,825 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 751 transitions. [2021-06-05 03:04:39,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 03:04:39,826 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:39,826 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:39,826 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 03:04:39,826 INFO L430 AbstractCegarLoop]: === Iteration 16 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:39,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:39,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1243524661, now seen corresponding path program 10 times [2021-06-05 03:04:39,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:39,827 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375015349] [2021-06-05 03:04:39,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:40,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:40,207 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:40,207 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375015349] [2021-06-05 03:04:40,207 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375015349] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:40,207 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:40,207 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-05 03:04:40,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899651340] [2021-06-05 03:04:40,207 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 03:04:40,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:40,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 03:04:40,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2021-06-05 03:04:40,208 INFO L87 Difference]: Start difference. First operand 357 states and 751 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:41,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:41,633 INFO L93 Difference]: Finished difference Result 401 states and 810 transitions. [2021-06-05 03:04:41,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 03:04:41,634 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 03:04:41,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:41,635 INFO L225 Difference]: With dead ends: 401 [2021-06-05 03:04:41,635 INFO L226 Difference]: Without dead ends: 369 [2021-06-05 03:04:41,636 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1269.4ms TimeCoverageRelationStatistics Valid=580, Invalid=3080, Unknown=0, NotChecked=0, Total=3660 [2021-06-05 03:04:41,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-06-05 03:04:41,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 357. [2021-06-05 03:04:41,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.101123595505618) internal successors, (748), 356 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:41,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 748 transitions. [2021-06-05 03:04:41,642 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 748 transitions. Word has length 61 [2021-06-05 03:04:41,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:41,643 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 748 transitions. [2021-06-05 03:04:41,643 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:41,643 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 748 transitions. [2021-06-05 03:04:41,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 03:04:41,643 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:41,644 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:41,644 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 03:04:41,644 INFO L430 AbstractCegarLoop]: === Iteration 17 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:41,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:41,644 INFO L82 PathProgramCache]: Analyzing trace with hash -666611931, now seen corresponding path program 11 times [2021-06-05 03:04:41,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:41,644 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116383708] [2021-06-05 03:04:41,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:42,035 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:42,035 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116383708] [2021-06-05 03:04:42,035 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116383708] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:42,035 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:42,035 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-05 03:04:42,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985952408] [2021-06-05 03:04:42,035 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 03:04:42,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:42,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 03:04:42,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2021-06-05 03:04:42,036 INFO L87 Difference]: Start difference. First operand 357 states and 748 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:43,367 INFO L93 Difference]: Finished difference Result 385 states and 783 transitions. [2021-06-05 03:04:43,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-06-05 03:04:43,367 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 03:04:43,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:43,368 INFO L225 Difference]: With dead ends: 385 [2021-06-05 03:04:43,368 INFO L226 Difference]: Without dead ends: 359 [2021-06-05 03:04:43,369 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1166.6ms TimeCoverageRelationStatistics Valid=543, Invalid=2879, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 03:04:43,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-06-05 03:04:43,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2021-06-05 03:04:43,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.098314606741573) internal successors, (747), 356 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 747 transitions. [2021-06-05 03:04:43,375 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 747 transitions. Word has length 61 [2021-06-05 03:04:43,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:43,376 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 747 transitions. [2021-06-05 03:04:43,376 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:43,376 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 747 transitions. [2021-06-05 03:04:43,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 03:04:43,377 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:43,377 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:43,377 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 03:04:43,377 INFO L430 AbstractCegarLoop]: === Iteration 18 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:43,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:43,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1258030027, now seen corresponding path program 12 times [2021-06-05 03:04:43,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:43,377 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417671615] [2021-06-05 03:04:43,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:43,741 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:43,741 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417671615] [2021-06-05 03:04:43,741 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417671615] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:43,742 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:43,742 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-05 03:04:43,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059378086] [2021-06-05 03:04:43,742 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 03:04:43,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:43,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 03:04:43,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2021-06-05 03:04:43,743 INFO L87 Difference]: Start difference. First operand 357 states and 747 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:45,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:45,154 INFO L93 Difference]: Finished difference Result 381 states and 776 transitions. [2021-06-05 03:04:45,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 03:04:45,155 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 03:04:45,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:45,156 INFO L225 Difference]: With dead ends: 381 [2021-06-05 03:04:45,156 INFO L226 Difference]: Without dead ends: 357 [2021-06-05 03:04:45,157 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1215.7ms TimeCoverageRelationStatistics Valid=572, Invalid=2968, Unknown=0, NotChecked=0, Total=3540 [2021-06-05 03:04:45,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-06-05 03:04:45,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-06-05 03:04:45,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.092696629213483) internal successors, (745), 356 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:45,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 745 transitions. [2021-06-05 03:04:45,164 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 745 transitions. Word has length 61 [2021-06-05 03:04:45,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:45,164 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 745 transitions. [2021-06-05 03:04:45,164 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:45,164 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 745 transitions. [2021-06-05 03:04:45,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 03:04:45,165 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:45,165 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:45,165 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 03:04:45,165 INFO L430 AbstractCegarLoop]: === Iteration 19 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:45,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:45,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1564219701, now seen corresponding path program 13 times [2021-06-05 03:04:45,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:45,166 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477688098] [2021-06-05 03:04:45,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:45,593 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:45,593 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477688098] [2021-06-05 03:04:45,593 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477688098] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:45,593 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:45,593 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-06-05 03:04:45,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977130701] [2021-06-05 03:04:45,593 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 03:04:45,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:45,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 03:04:45,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=804, Unknown=0, NotChecked=0, Total=870 [2021-06-05 03:04:45,594 INFO L87 Difference]: Start difference. First operand 357 states and 745 transitions. Second operand has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 30 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:47,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:47,840 INFO L93 Difference]: Finished difference Result 377 states and 768 transitions. [2021-06-05 03:04:47,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-05 03:04:47,841 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 30 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 03:04:47,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:47,842 INFO L225 Difference]: With dead ends: 377 [2021-06-05 03:04:47,842 INFO L226 Difference]: Without dead ends: 225 [2021-06-05 03:04:47,843 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 2033.5ms TimeCoverageRelationStatistics Valid=633, Invalid=3789, Unknown=0, NotChecked=0, Total=4422 [2021-06-05 03:04:47,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-06-05 03:04:47,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2021-06-05 03:04:47,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.9866071428571428) internal successors, (445), 224 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:47,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 445 transitions. [2021-06-05 03:04:47,847 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 445 transitions. Word has length 61 [2021-06-05 03:04:47,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:47,847 INFO L482 AbstractCegarLoop]: Abstraction has 225 states and 445 transitions. [2021-06-05 03:04:47,847 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 30 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:47,847 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 445 transitions. [2021-06-05 03:04:47,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 03:04:47,848 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:47,848 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:47,848 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 03:04:47,848 INFO L430 AbstractCegarLoop]: === Iteration 20 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:47,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:47,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1000025979, now seen corresponding path program 14 times [2021-06-05 03:04:47,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:47,849 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559891528] [2021-06-05 03:04:47,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:48,241 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:48,241 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559891528] [2021-06-05 03:04:48,241 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559891528] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:48,241 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:48,241 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 03:04:48,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390144278] [2021-06-05 03:04:48,242 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 03:04:48,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:48,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 03:04:48,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2021-06-05 03:04:48,243 INFO L87 Difference]: Start difference. First operand 225 states and 445 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:50,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:50,275 INFO L93 Difference]: Finished difference Result 331 states and 647 transitions. [2021-06-05 03:04:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 03:04:50,276 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 03:04:50,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:50,276 INFO L225 Difference]: With dead ends: 331 [2021-06-05 03:04:50,276 INFO L226 Difference]: Without dead ends: 213 [2021-06-05 03:04:50,277 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 1774.8ms TimeCoverageRelationStatistics Valid=516, Invalid=2906, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 03:04:50,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-06-05 03:04:50,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2021-06-05 03:04:50,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.9433962264150944) internal successors, (412), 212 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:50,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 412 transitions. [2021-06-05 03:04:50,281 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 412 transitions. Word has length 61 [2021-06-05 03:04:50,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:50,281 INFO L482 AbstractCegarLoop]: Abstraction has 213 states and 412 transitions. [2021-06-05 03:04:50,281 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:50,281 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 412 transitions. [2021-06-05 03:04:50,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 03:04:50,282 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:50,282 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:50,282 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 03:04:50,282 INFO L430 AbstractCegarLoop]: === Iteration 21 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:50,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:50,283 INFO L82 PathProgramCache]: Analyzing trace with hash -445291639, now seen corresponding path program 15 times [2021-06-05 03:04:50,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:50,283 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530101885] [2021-06-05 03:04:50,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:50,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:50,693 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:50,693 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530101885] [2021-06-05 03:04:50,693 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530101885] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:50,693 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:50,693 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 03:04:50,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463071477] [2021-06-05 03:04:50,694 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 03:04:50,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:50,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 03:04:50,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2021-06-05 03:04:50,694 INFO L87 Difference]: Start difference. First operand 213 states and 412 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:52,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:52,428 INFO L93 Difference]: Finished difference Result 327 states and 632 transitions. [2021-06-05 03:04:52,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 03:04:52,429 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 03:04:52,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:52,429 INFO L225 Difference]: With dead ends: 327 [2021-06-05 03:04:52,429 INFO L226 Difference]: Without dead ends: 201 [2021-06-05 03:04:52,430 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1643.0ms TimeCoverageRelationStatistics Valid=545, Invalid=2877, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 03:04:52,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-06-05 03:04:52,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2021-06-05 03:04:52,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.895) internal successors, (379), 200 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 379 transitions. [2021-06-05 03:04:52,433 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 379 transitions. Word has length 61 [2021-06-05 03:04:52,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:52,433 INFO L482 AbstractCegarLoop]: Abstraction has 201 states and 379 transitions. [2021-06-05 03:04:52,433 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:52,433 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 379 transitions. [2021-06-05 03:04:52,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 03:04:52,434 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:52,434 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:52,434 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 03:04:52,434 INFO L430 AbstractCegarLoop]: === Iteration 22 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:52,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:52,435 INFO L82 PathProgramCache]: Analyzing trace with hash 2088814595, now seen corresponding path program 16 times [2021-06-05 03:04:52,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:52,435 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792373595] [2021-06-05 03:04:52,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:52,835 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:52,835 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792373595] [2021-06-05 03:04:52,835 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792373595] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:52,835 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:52,835 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 03:04:52,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867589183] [2021-06-05 03:04:52,835 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 03:04:52,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:52,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 03:04:52,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2021-06-05 03:04:52,836 INFO L87 Difference]: Start difference. First operand 201 states and 379 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:54,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:54,575 INFO L93 Difference]: Finished difference Result 323 states and 617 transitions. [2021-06-05 03:04:54,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 03:04:54,575 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 03:04:54,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:54,576 INFO L225 Difference]: With dead ends: 323 [2021-06-05 03:04:54,576 INFO L226 Difference]: Without dead ends: 189 [2021-06-05 03:04:54,576 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1564.6ms TimeCoverageRelationStatistics Valid=546, Invalid=2876, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 03:04:54,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-06-05 03:04:54,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-06-05 03:04:54,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.8404255319148937) internal successors, (346), 188 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 346 transitions. [2021-06-05 03:04:54,579 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 346 transitions. Word has length 61 [2021-06-05 03:04:54,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:54,579 INFO L482 AbstractCegarLoop]: Abstraction has 189 states and 346 transitions. [2021-06-05 03:04:54,580 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:54,580 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 346 transitions. [2021-06-05 03:04:54,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 03:04:54,580 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:54,580 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:54,580 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 03:04:54,581 INFO L430 AbstractCegarLoop]: === Iteration 23 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:54,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:54,581 INFO L82 PathProgramCache]: Analyzing trace with hash 463712683, now seen corresponding path program 17 times [2021-06-05 03:04:54,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:54,581 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099816208] [2021-06-05 03:04:54,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:54,961 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:54,961 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099816208] [2021-06-05 03:04:54,961 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099816208] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:54,961 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:54,961 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 03:04:54,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343818280] [2021-06-05 03:04:54,961 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 03:04:54,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:54,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 03:04:54,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2021-06-05 03:04:54,962 INFO L87 Difference]: Start difference. First operand 189 states and 346 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:56,637 INFO L93 Difference]: Finished difference Result 319 states and 602 transitions. [2021-06-05 03:04:56,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 03:04:56,637 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 03:04:56,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:56,638 INFO L225 Difference]: With dead ends: 319 [2021-06-05 03:04:56,638 INFO L226 Difference]: Without dead ends: 165 [2021-06-05 03:04:56,638 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1567.3ms TimeCoverageRelationStatistics Valid=547, Invalid=2875, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 03:04:56,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-06-05 03:04:56,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2021-06-05 03:04:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.8414634146341464) internal successors, (302), 164 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 302 transitions. [2021-06-05 03:04:56,641 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 302 transitions. Word has length 61 [2021-06-05 03:04:56,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:56,641 INFO L482 AbstractCegarLoop]: Abstraction has 165 states and 302 transitions. [2021-06-05 03:04:56,641 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 302 transitions. [2021-06-05 03:04:56,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 03:04:56,642 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 03:04:56,642 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 03:04:56,642 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 03:04:56,642 INFO L430 AbstractCegarLoop]: === Iteration 24 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 03:04:56,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 03:04:56,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1536955807, now seen corresponding path program 18 times [2021-06-05 03:04:56,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 03:04:56,643 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600996157] [2021-06-05 03:04:56,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 03:04:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 03:04:56,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 03:04:56,989 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 03:04:56,989 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600996157] [2021-06-05 03:04:56,989 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600996157] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 03:04:56,990 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 03:04:56,990 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 03:04:56,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012312482] [2021-06-05 03:04:56,990 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 03:04:56,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 03:04:56,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 03:04:56,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2021-06-05 03:04:56,991 INFO L87 Difference]: Start difference. First operand 165 states and 302 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:58,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 03:04:58,608 INFO L93 Difference]: Finished difference Result 164 states and 301 transitions. [2021-06-05 03:04:58,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 03:04:58,609 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 03:04:58,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 03:04:58,609 INFO L225 Difference]: With dead ends: 164 [2021-06-05 03:04:58,609 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 03:04:58,609 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1532.4ms TimeCoverageRelationStatistics Valid=548, Invalid=2874, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 03:04:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 03:04:58,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 03:04:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:58,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 03:04:58,609 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2021-06-05 03:04:58,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 03:04:58,610 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 03:04:58,610 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 03:04:58,610 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 03:04:58,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 03:04:58,610 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 03:04:58,611 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 03:04:58,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 03:04:58 BasicIcfg [2021-06-05 03:04:58,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 03:04:58,614 INFO L168 Benchmark]: Toolchain (without parser) took 44058.94 ms. Allocated memory was 350.2 MB in the beginning and 633.3 MB in the end (delta: 283.1 MB). Free memory was 311.8 MB in the beginning and 438.8 MB in the end (delta: -127.0 MB). Peak memory consumption was 157.2 MB. Max. memory is 16.0 GB. [2021-06-05 03:04:58,614 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 350.2 MB. Free memory was 330.4 MB in the beginning and 330.3 MB in the end (delta: 65.6 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 03:04:58,614 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.69 ms. Allocated memory is still 350.2 MB. Free memory was 311.6 MB in the beginning and 333.9 MB in the end (delta: -22.3 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-06-05 03:04:58,614 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.84 ms. Allocated memory is still 350.2 MB. Free memory was 333.9 MB in the beginning and 331.8 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 03:04:58,614 INFO L168 Benchmark]: Boogie Preprocessor took 30.43 ms. Allocated memory is still 350.2 MB. Free memory was 331.8 MB in the beginning and 330.8 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 03:04:58,615 INFO L168 Benchmark]: RCFGBuilder took 426.41 ms. Allocated memory is still 350.2 MB. Free memory was 330.8 MB in the beginning and 307.7 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.0 GB. [2021-06-05 03:04:58,615 INFO L168 Benchmark]: TraceAbstraction took 43287.85 ms. Allocated memory was 350.2 MB in the beginning and 633.3 MB in the end (delta: 283.1 MB). Free memory was 306.7 MB in the beginning and 438.8 MB in the end (delta: -132.1 MB). Peak memory consumption was 152.0 MB. Max. memory is 16.0 GB. [2021-06-05 03:04:58,615 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 350.2 MB. Free memory was 330.4 MB in the beginning and 330.3 MB in the end (delta: 65.6 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 277.69 ms. Allocated memory is still 350.2 MB. Free memory was 311.6 MB in the beginning and 333.9 MB in the end (delta: -22.3 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 30.84 ms. Allocated memory is still 350.2 MB. Free memory was 333.9 MB in the beginning and 331.8 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 30.43 ms. Allocated memory is still 350.2 MB. Free memory was 331.8 MB in the beginning and 330.8 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 426.41 ms. Allocated memory is still 350.2 MB. Free memory was 330.8 MB in the beginning and 307.7 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 43287.85 ms. Allocated memory was 350.2 MB in the beginning and 633.3 MB in the end (delta: 283.1 MB). Free memory was 306.7 MB in the beginning and 438.8 MB in the end (delta: -132.1 MB). Peak memory consumption was 152.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 45]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 115 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 43159.3ms, OverallIterations: 24, TraceHistogramMax: 1, EmptinessCheckTime: 35.0ms, AutomataDifference: 33152.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 40.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1970 SDtfs, 7564 SDslu, 25177 SDs, 0 SdLazy, 21579 SolverSat, 1019 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8611.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1242 GetRequests, 50 SyntacticMatches, 10 SemanticMatches, 1182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9560 ImplicationChecksByTransitivity, 29008.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=477occurred in iteration=0, InterpolantAutomatonStates: 777, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 210.9ms AutomataMinimizationTime, 24 MinimizatonAttempts, 574 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 48.6ms SsaConstructionTime, 288.8ms SatisfiabilityAnalysisTime, 9152.2ms InterpolantComputationTime, 1354 NumberOfCodeBlocks, 1354 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1330 ConstructedInterpolants, 0 QuantifiedInterpolants, 16146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...