/usr/bin/java -Xmx8000000000 -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 --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_07-tricky_address2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.abstract-por-f0ea240 [2022-02-10 23:42:53,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-10 23:42:53,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-10 23:42:53,742 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-10 23:42:53,743 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-10 23:42:53,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-10 23:42:53,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-10 23:42:53,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-10 23:42:53,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-10 23:42:53,753 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-10 23:42:53,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-10 23:42:53,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-10 23:42:53,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-10 23:42:53,756 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-10 23:42:53,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-10 23:42:53,758 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-10 23:42:53,759 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-10 23:42:53,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-10 23:42:53,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-10 23:42:53,771 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-10 23:42:53,772 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-10 23:42:53,773 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-10 23:42:53,774 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-10 23:42:53,775 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-10 23:42:53,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-10 23:42:53,777 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-10 23:42:53,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-10 23:42:53,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-10 23:42:53,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-10 23:42:53,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-10 23:42:53,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-10 23:42:53,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-10 23:42:53,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-10 23:42:53,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-10 23:42:53,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-10 23:42:53,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-10 23:42:53,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-10 23:42:53,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-10 23:42:53,784 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-10 23:42:53,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-10 23:42:53,785 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-10 23:42:53,789 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 [2022-02-10 23:42:53,828 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-10 23:42:53,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-10 23:42:53,828 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-10 23:42:53,829 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-10 23:42:53,829 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-10 23:42:53,830 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-10 23:42:53,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-10 23:42:53,830 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-10 23:42:53,830 INFO L138 SettingsManager]: * Use SBE=true [2022-02-10 23:42:53,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-10 23:42:53,831 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-10 23:42:53,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-10 23:42:53,832 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-10 23:42:53,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-10 23:42:53,832 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-10 23:42:53,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-10 23:42:53,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-10 23:42:53,832 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-10 23:42:53,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-10 23:42:53,832 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-10 23:42:53,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-10 23:42:53,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-10 23:42:53,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-10 23:42:53,833 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-10 23:42:53,834 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-10 23:42:53,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 23:42:53,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-10 23:42:53,834 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-10 23:42:53,834 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-10 23:42:53,835 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-10 23:42:53,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-10 23:42:53,835 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-10 23:42:53,835 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-10 23:42:53,835 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-02-10 23:42:54,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-10 23:42:54,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-10 23:42:54,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-10 23:42:54,131 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-10 23:42:54,132 INFO L275 PluginConnector]: CDTParser initialized [2022-02-10 23:42:54,133 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_07-tricky_address2.i [2022-02-10 23:42:54,188 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af673eaae/d9aaafb835fd4044b5fc845b87bb2894/FLAGc7be275d7 [2022-02-10 23:42:54,705 INFO L306 CDTParser]: Found 1 translation units. [2022-02-10 23:42:54,706 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_07-tricky_address2.i [2022-02-10 23:42:54,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af673eaae/d9aaafb835fd4044b5fc845b87bb2894/FLAGc7be275d7 [2022-02-10 23:42:55,003 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af673eaae/d9aaafb835fd4044b5fc845b87bb2894 [2022-02-10 23:42:55,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-10 23:42:55,006 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-10 23:42:55,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-10 23:42:55,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-10 23:42:55,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-10 23:42:55,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 11:42:55" (1/1) ... [2022-02-10 23:42:55,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b30a0be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:55, skipping insertion in model container [2022-02-10 23:42:55,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 11:42:55" (1/1) ... [2022-02-10 23:42:55,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-10 23:42:55,066 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-10 23:42:55,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 23:42:55,573 INFO L203 MainTranslator]: Completed pre-run [2022-02-10 23:42:55,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 23:42:55,694 INFO L208 MainTranslator]: Completed translation [2022-02-10 23:42:55,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:55 WrapperNode [2022-02-10 23:42:55,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-10 23:42:55,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-10 23:42:55,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-10 23:42:55,698 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-10 23:42:55,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:55" (1/1) ... [2022-02-10 23:42:55,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:55" (1/1) ... [2022-02-10 23:42:55,770 INFO L137 Inliner]: procedures = 264, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2022-02-10 23:42:55,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-10 23:42:55,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-10 23:42:55,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-10 23:42:55,772 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-10 23:42:55,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:55" (1/1) ... [2022-02-10 23:42:55,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:55" (1/1) ... [2022-02-10 23:42:55,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:55" (1/1) ... [2022-02-10 23:42:55,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:55" (1/1) ... [2022-02-10 23:42:55,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:55" (1/1) ... [2022-02-10 23:42:55,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:55" (1/1) ... [2022-02-10 23:42:55,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:55" (1/1) ... [2022-02-10 23:42:55,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-10 23:42:55,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-10 23:42:55,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-10 23:42:55,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-10 23:42:55,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:55" (1/1) ... [2022-02-10 23:42:55,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 23:42:55,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:42:55,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-10 23:42:55,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-10 23:42:55,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-10 23:42:55,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-10 23:42:55,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-10 23:42:55,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-10 23:42:55,908 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-10 23:42:55,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-10 23:42:55,908 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-10 23:42:55,908 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-10 23:42:55,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-10 23:42:55,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-10 23:42:55,910 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-10 23:42:56,042 INFO L234 CfgBuilder]: Building ICFG [2022-02-10 23:42:56,043 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-10 23:42:56,247 INFO L275 CfgBuilder]: Performing block encoding [2022-02-10 23:42:56,254 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-10 23:42:56,254 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-10 23:42:56,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 11:42:56 BoogieIcfgContainer [2022-02-10 23:42:56,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-10 23:42:56,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-10 23:42:56,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-10 23:42:56,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-10 23:42:56,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.02 11:42:55" (1/3) ... [2022-02-10 23:42:56,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4462422f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 11:42:56, skipping insertion in model container [2022-02-10 23:42:56,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:42:55" (2/3) ... [2022-02-10 23:42:56,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4462422f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 11:42:56, skipping insertion in model container [2022-02-10 23:42:56,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 11:42:56" (3/3) ... [2022-02-10 23:42:56,264 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_07-tricky_address2.i [2022-02-10 23:42:56,271 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-10 23:42:56,271 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-10 23:42:56,271 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-10 23:42:56,272 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-10 23:42:56,322 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,322 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,323 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,323 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,323 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,323 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,323 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,323 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,324 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,324 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,325 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,325 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,325 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,325 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,325 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,326 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,326 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,326 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,326 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,326 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,327 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,327 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,327 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,327 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,327 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,328 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,328 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,328 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,328 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,328 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,329 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,329 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,329 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,329 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,329 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,330 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,330 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,330 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,330 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,331 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,331 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,331 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,331 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,331 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,331 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,332 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,332 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,332 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,332 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,333 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,333 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,333 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,333 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,334 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,334 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,334 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,334 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,335 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,335 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,336 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,336 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,336 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,337 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,337 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,337 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,337 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,337 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,338 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,338 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,338 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,338 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,338 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,339 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,339 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,339 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,339 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,339 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,339 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,340 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,340 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,340 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,340 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,341 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,341 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,341 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,341 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,341 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,341 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,342 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,342 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,343 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,343 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,343 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,343 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,344 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,344 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,344 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,344 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,344 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,344 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,344 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,345 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,345 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,345 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,345 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,345 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,345 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,346 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,348 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,349 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,349 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,349 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,349 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,349 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,349 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,350 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,350 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,350 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,350 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,350 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,350 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,350 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:42:56,352 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-10 23:42:56,385 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 23:42:56,391 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-10 23:42:56,391 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-10 23:42:56,400 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 103 transitions, 211 flow [2022-02-10 23:42:56,486 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1102 states, 1094 states have (on average 1.9542961608775138) internal successors, (2138), 1101 states have internal predecessors, (2138), 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) [2022-02-10 23:42:56,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 1102 states, 1094 states have (on average 1.9542961608775138) internal successors, (2138), 1101 states have internal predecessors, (2138), 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) [2022-02-10 23:42:56,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-10 23:42:56,500 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:56,500 INFO L515 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] [2022-02-10 23:42:56,501 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:42:56,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:56,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1298122157, now seen corresponding path program 1 times [2022-02-10 23:42:56,517 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:56,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579482114] [2022-02-10 23:42:56,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:56,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:56,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:56,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579482114] [2022-02-10 23:42:56,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579482114] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:42:56,735 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:42:56,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 23:42:56,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541718285] [2022-02-10 23:42:56,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:42:56,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-10 23:42:56,746 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:56,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-10 23:42:56,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-10 23:42:56,778 INFO L87 Difference]: Start difference. First operand has 1102 states, 1094 states have (on average 1.9542961608775138) internal successors, (2138), 1101 states have internal predecessors, (2138), 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 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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) [2022-02-10 23:42:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:56,824 INFO L93 Difference]: Finished difference Result 1102 states and 2105 transitions. [2022-02-10 23:42:56,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 23:42:56,828 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 37 [2022-02-10 23:42:56,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:56,853 INFO L225 Difference]: With dead ends: 1102 [2022-02-10 23:42:56,853 INFO L226 Difference]: Without dead ends: 1090 [2022-02-10 23:42:56,855 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-10 23:42:56,858 INFO L934 BasicCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:42:56,860 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:42:56,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2022-02-10 23:42:56,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1090. [2022-02-10 23:42:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 1080 states have (on average 1.9277777777777778) internal successors, (2082), 1089 states have internal predecessors, (2082), 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) [2022-02-10 23:42:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 2082 transitions. [2022-02-10 23:42:56,945 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 2082 transitions. Word has length 37 [2022-02-10 23:42:56,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:56,945 INFO L470 AbstractCegarLoop]: Abstraction has 1090 states and 2082 transitions. [2022-02-10 23:42:56,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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) [2022-02-10 23:42:56,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 2082 transitions. [2022-02-10 23:42:56,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-10 23:42:56,947 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:56,947 INFO L515 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] [2022-02-10 23:42:56,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-10 23:42:56,948 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:42:56,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:56,949 INFO L85 PathProgramCache]: Analyzing trace with hash -779087186, now seen corresponding path program 1 times [2022-02-10 23:42:56,949 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:56,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891864134] [2022-02-10 23:42:56,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:56,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:57,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:57,029 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:57,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891864134] [2022-02-10 23:42:57,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891864134] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:42:57,030 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:42:57,031 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-10 23:42:57,031 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500496091] [2022-02-10 23:42:57,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:42:57,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 23:42:57,036 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:57,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 23:42:57,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:42:57,037 INFO L87 Difference]: Start difference. First operand 1090 states and 2082 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2022-02-10 23:42:57,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:57,065 INFO L93 Difference]: Finished difference Result 1094 states and 2086 transitions. [2022-02-10 23:42:57,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 23:42:57,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2022-02-10 23:42:57,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:57,076 INFO L225 Difference]: With dead ends: 1094 [2022-02-10 23:42:57,076 INFO L226 Difference]: Without dead ends: 1094 [2022-02-10 23:42:57,077 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:42:57,078 INFO L934 BasicCegarLoop]: 94 mSDtfsCounter, 3 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:42:57,080 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 184 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:42:57,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2022-02-10 23:42:57,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1091. [2022-02-10 23:42:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1081 states have (on average 1.9269195189639223) internal successors, (2083), 1090 states have internal predecessors, (2083), 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) [2022-02-10 23:42:57,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 2083 transitions. [2022-02-10 23:42:57,131 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 2083 transitions. Word has length 37 [2022-02-10 23:42:57,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:57,131 INFO L470 AbstractCegarLoop]: Abstraction has 1091 states and 2083 transitions. [2022-02-10 23:42:57,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2022-02-10 23:42:57,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 2083 transitions. [2022-02-10 23:42:57,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-10 23:42:57,139 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:57,139 INFO L515 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] [2022-02-10 23:42:57,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-10 23:42:57,139 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:42:57,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:57,144 INFO L85 PathProgramCache]: Analyzing trace with hash 624473633, now seen corresponding path program 1 times [2022-02-10 23:42:57,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:57,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743906630] [2022-02-10 23:42:57,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:57,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:57,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:57,229 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:57,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743906630] [2022-02-10 23:42:57,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743906630] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:42:57,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724825675] [2022-02-10 23:42:57,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:57,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:42:57,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:42:57,231 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:42:57,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-10 23:42:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:57,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-10 23:42:57,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:42:57,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:57,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:42:57,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:57,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724825675] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:42:57,551 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:42:57,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-10 23:42:57,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298330329] [2022-02-10 23:42:57,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:42:57,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:42:57,553 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:57,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:42:57,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-10 23:42:57,554 INFO L87 Difference]: Start difference. First operand 1091 states and 2083 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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) [2022-02-10 23:42:57,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:57,646 INFO L93 Difference]: Finished difference Result 1101 states and 2093 transitions. [2022-02-10 23:42:57,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 23:42:57,646 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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 42 [2022-02-10 23:42:57,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:57,651 INFO L225 Difference]: With dead ends: 1101 [2022-02-10 23:42:57,651 INFO L226 Difference]: Without dead ends: 1101 [2022-02-10 23:42:57,655 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-02-10 23:42:57,656 INFO L934 BasicCegarLoop]: 93 mSDtfsCounter, 10 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:42:57,657 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 547 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:42:57,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2022-02-10 23:42:57,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1101. [2022-02-10 23:42:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 1091 states have (on average 1.9184234647112741) internal successors, (2093), 1100 states have internal predecessors, (2093), 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) [2022-02-10 23:42:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 2093 transitions. [2022-02-10 23:42:57,680 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 2093 transitions. Word has length 42 [2022-02-10 23:42:57,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:57,680 INFO L470 AbstractCegarLoop]: Abstraction has 1101 states and 2093 transitions. [2022-02-10 23:42:57,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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) [2022-02-10 23:42:57,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 2093 transitions. [2022-02-10 23:42:57,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-10 23:42:57,683 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:57,683 INFO L515 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:42:57,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-10 23:42:57,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:42:57,896 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:42:57,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:57,896 INFO L85 PathProgramCache]: Analyzing trace with hash 653292097, now seen corresponding path program 2 times [2022-02-10 23:42:57,896 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:57,897 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80801118] [2022-02-10 23:42:57,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:57,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:58,020 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:58,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80801118] [2022-02-10 23:42:58,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80801118] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:42:58,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853579975] [2022-02-10 23:42:58,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:42:58,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:42:58,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:42:58,022 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:42:58,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-10 23:42:58,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-10 23:42:58,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:42:58,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-10 23:42:58,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:42:58,216 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-10 23:42:58,259 INFO L353 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-02-10 23:42:58,259 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-02-10 23:42:58,304 INFO L353 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-02-10 23:42:58,305 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2022-02-10 23:42:58,377 INFO L353 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-02-10 23:42:58,377 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2022-02-10 23:42:58,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-10 23:42:58,405 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:42:58,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853579975] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:42:58,405 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:42:58,405 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-02-10 23:42:58,405 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387072825] [2022-02-10 23:42:58,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:42:58,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 23:42:58,406 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:58,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 23:42:58,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-02-10 23:42:58,408 INFO L87 Difference]: Start difference. First operand 1101 states and 2093 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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) [2022-02-10 23:42:58,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:58,621 INFO L93 Difference]: Finished difference Result 1384 states and 2630 transitions. [2022-02-10 23:42:58,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 23:42:58,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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 52 [2022-02-10 23:42:58,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:58,630 INFO L225 Difference]: With dead ends: 1384 [2022-02-10 23:42:58,631 INFO L226 Difference]: Without dead ends: 1384 [2022-02-10 23:42:58,631 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-02-10 23:42:58,633 INFO L934 BasicCegarLoop]: 175 mSDtfsCounter, 136 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:42:58,634 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 364 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 23:42:58,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2022-02-10 23:42:58,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1124. [2022-02-10 23:42:58,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 1116 states have (on average 1.9130824372759856) internal successors, (2135), 1123 states have internal predecessors, (2135), 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) [2022-02-10 23:42:58,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 2135 transitions. [2022-02-10 23:42:58,664 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 2135 transitions. Word has length 52 [2022-02-10 23:42:58,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:58,665 INFO L470 AbstractCegarLoop]: Abstraction has 1124 states and 2135 transitions. [2022-02-10 23:42:58,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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) [2022-02-10 23:42:58,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 2135 transitions. [2022-02-10 23:42:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-10 23:42:58,695 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:58,696 INFO L515 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:42:58,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-10 23:42:58,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-10 23:42:58,905 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:42:58,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:58,906 INFO L85 PathProgramCache]: Analyzing trace with hash -406389930, now seen corresponding path program 1 times [2022-02-10 23:42:58,906 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:58,906 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891420564] [2022-02-10 23:42:58,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:58,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:59,026 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:42:59,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891420564] [2022-02-10 23:42:59,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891420564] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:42:59,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120695471] [2022-02-10 23:42:59,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:59,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:42:59,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:42:59,028 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:42:59,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-10 23:42:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:42:59,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-10 23:42:59,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:42:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:59,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:42:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:42:59,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120695471] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:42:59,380 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:42:59,380 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-02-10 23:42:59,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808206231] [2022-02-10 23:42:59,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:42:59,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-10 23:42:59,381 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:42:59,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-10 23:42:59,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:42:59,382 INFO L87 Difference]: Start difference. First operand 1124 states and 2135 transitions. Second operand has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 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) [2022-02-10 23:42:59,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:42:59,553 INFO L93 Difference]: Finished difference Result 1144 states and 2155 transitions. [2022-02-10 23:42:59,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-10 23:42:59,554 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 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 60 [2022-02-10 23:42:59,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:42:59,558 INFO L225 Difference]: With dead ends: 1144 [2022-02-10 23:42:59,558 INFO L226 Difference]: Without dead ends: 1144 [2022-02-10 23:42:59,559 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2022-02-10 23:42:59,560 INFO L934 BasicCegarLoop]: 93 mSDtfsCounter, 31 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:42:59,560 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 550 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:42:59,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2022-02-10 23:42:59,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1144. [2022-02-10 23:42:59,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1136 states have (on average 1.8970070422535212) internal successors, (2155), 1143 states have internal predecessors, (2155), 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) [2022-02-10 23:42:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 2155 transitions. [2022-02-10 23:42:59,583 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 2155 transitions. Word has length 60 [2022-02-10 23:42:59,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:42:59,584 INFO L470 AbstractCegarLoop]: Abstraction has 1144 states and 2155 transitions. [2022-02-10 23:42:59,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 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) [2022-02-10 23:42:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 2155 transitions. [2022-02-10 23:42:59,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-10 23:42:59,585 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:42:59,585 INFO L515 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:42:59,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-10 23:42:59,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:42:59,799 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:42:59,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:42:59,800 INFO L85 PathProgramCache]: Analyzing trace with hash 232143766, now seen corresponding path program 2 times [2022-02-10 23:42:59,800 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:42:59,800 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943130475] [2022-02-10 23:42:59,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:42:59,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:42:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:00,026 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:43:00,026 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:00,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943130475] [2022-02-10 23:43:00,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943130475] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:00,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517958492] [2022-02-10 23:43:00,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 23:43:00,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:00,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:00,028 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:43:00,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-10 23:43:00,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-10 23:43:00,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 23:43:00,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-10 23:43:00,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:00,214 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-10 23:43:00,235 INFO L353 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-02-10 23:43:00,236 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-02-10 23:43:00,286 INFO L353 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-02-10 23:43:00,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2022-02-10 23:43:00,349 INFO L353 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-02-10 23:43:00,349 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2022-02-10 23:43:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-10 23:43:00,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-10 23:43:00,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517958492] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:00,377 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-10 23:43:00,377 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2022-02-10 23:43:00,377 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643394685] [2022-02-10 23:43:00,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:00,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 23:43:00,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:00,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 23:43:00,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-02-10 23:43:00,379 INFO L87 Difference]: Start difference. First operand 1144 states and 2155 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 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) [2022-02-10 23:43:00,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:00,640 INFO L93 Difference]: Finished difference Result 1501 states and 2816 transitions. [2022-02-10 23:43:00,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 23:43:00,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 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 80 [2022-02-10 23:43:00,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:00,646 INFO L225 Difference]: With dead ends: 1501 [2022-02-10 23:43:00,647 INFO L226 Difference]: Without dead ends: 1357 [2022-02-10 23:43:00,647 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-02-10 23:43:00,648 INFO L934 BasicCegarLoop]: 177 mSDtfsCounter, 124 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:00,648 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 431 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 23:43:00,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2022-02-10 23:43:00,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1068. [2022-02-10 23:43:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 1061 states have (on average 1.878416588124411) internal successors, (1993), 1067 states have internal predecessors, (1993), 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) [2022-02-10 23:43:00,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1993 transitions. [2022-02-10 23:43:00,675 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1993 transitions. Word has length 80 [2022-02-10 23:43:00,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:00,676 INFO L470 AbstractCegarLoop]: Abstraction has 1068 states and 1993 transitions. [2022-02-10 23:43:00,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 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) [2022-02-10 23:43:00,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1993 transitions. [2022-02-10 23:43:00,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-10 23:43:00,678 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:00,678 INFO L515 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:00,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-10 23:43:00,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:00,904 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:00,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:00,904 INFO L85 PathProgramCache]: Analyzing trace with hash -109360466, now seen corresponding path program 1 times [2022-02-10 23:43:00,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:00,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609584677] [2022-02-10 23:43:00,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:00,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:43:01,087 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:01,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609584677] [2022-02-10 23:43:01,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609584677] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 23:43:01,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424970352] [2022-02-10 23:43:01,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:01,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:01,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:43:01,089 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 23:43:01,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-10 23:43:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:01,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-10 23:43:01,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 23:43:01,363 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:43:01,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 23:43:01,578 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:43:01,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424970352] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 23:43:01,579 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 23:43:01,579 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-02-10 23:43:01,579 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913507261] [2022-02-10 23:43:01,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 23:43:01,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-10 23:43:01,580 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:01,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-10 23:43:01,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:43:01,580 INFO L87 Difference]: Start difference. First operand 1068 states and 1993 transitions. Second operand has 23 states, 23 states have (on average 4.260869565217392) internal successors, (98), 23 states have internal predecessors, (98), 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) [2022-02-10 23:43:01,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:01,849 INFO L93 Difference]: Finished difference Result 1083 states and 2008 transitions. [2022-02-10 23:43:01,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-10 23:43:01,850 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.260869565217392) internal successors, (98), 23 states have internal predecessors, (98), 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 81 [2022-02-10 23:43:01,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:01,854 INFO L225 Difference]: With dead ends: 1083 [2022-02-10 23:43:01,854 INFO L226 Difference]: Without dead ends: 1083 [2022-02-10 23:43:01,855 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2022-02-10 23:43:01,855 INFO L934 BasicCegarLoop]: 92 mSDtfsCounter, 43 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:01,856 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 636 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 23:43:01,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2022-02-10 23:43:01,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2022-02-10 23:43:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1076 states have (on average 1.8661710037174721) internal successors, (2008), 1082 states have internal predecessors, (2008), 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) [2022-02-10 23:43:01,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 2008 transitions. [2022-02-10 23:43:01,875 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 2008 transitions. Word has length 81 [2022-02-10 23:43:01,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:01,875 INFO L470 AbstractCegarLoop]: Abstraction has 1083 states and 2008 transitions. [2022-02-10 23:43:01,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.260869565217392) internal successors, (98), 23 states have internal predecessors, (98), 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) [2022-02-10 23:43:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 2008 transitions. [2022-02-10 23:43:01,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-10 23:43:01,877 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:01,877 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:01,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-10 23:43:02,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 23:43:02,088 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:02,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:02,088 INFO L85 PathProgramCache]: Analyzing trace with hash 827906497, now seen corresponding path program 2 times [2022-02-10 23:43:02,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:02,088 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902770821] [2022-02-10 23:43:02,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:02,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:02,223 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:02,223 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:02,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902770821] [2022-02-10 23:43:02,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902770821] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:02,223 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:02,223 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-10 23:43:02,224 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869288227] [2022-02-10 23:43:02,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:02,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 23:43:02,224 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:02,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 23:43:02,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:43:02,224 INFO L87 Difference]: Start difference. First operand 1083 states and 2008 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 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) [2022-02-10 23:43:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:02,447 INFO L93 Difference]: Finished difference Result 1504 states and 2821 transitions. [2022-02-10 23:43:02,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 23:43:02,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 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 96 [2022-02-10 23:43:02,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:02,453 INFO L225 Difference]: With dead ends: 1504 [2022-02-10 23:43:02,454 INFO L226 Difference]: Without dead ends: 1504 [2022-02-10 23:43:02,454 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:43:02,455 INFO L934 BasicCegarLoop]: 145 mSDtfsCounter, 104 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:02,455 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 285 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 23:43:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2022-02-10 23:43:02,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1124. [2022-02-10 23:43:02,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 1117 states have (on average 1.8675022381378692) internal successors, (2086), 1123 states have internal predecessors, (2086), 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) [2022-02-10 23:43:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 2086 transitions. [2022-02-10 23:43:02,483 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 2086 transitions. Word has length 96 [2022-02-10 23:43:02,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:02,483 INFO L470 AbstractCegarLoop]: Abstraction has 1124 states and 2086 transitions. [2022-02-10 23:43:02,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 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) [2022-02-10 23:43:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 2086 transitions. [2022-02-10 23:43:02,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-10 23:43:02,485 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:02,485 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:02,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-10 23:43:02,485 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:02,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:02,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1432249786, now seen corresponding path program 1 times [2022-02-10 23:43:02,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:02,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037844555] [2022-02-10 23:43:02,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:02,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:02,598 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:02,599 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:02,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037844555] [2022-02-10 23:43:02,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037844555] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:02,599 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:02,599 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-10 23:43:02,599 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125488214] [2022-02-10 23:43:02,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:02,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 23:43:02,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:02,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 23:43:02,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:43:02,601 INFO L87 Difference]: Start difference. First operand 1124 states and 2086 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 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) [2022-02-10 23:43:02,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:02,829 INFO L93 Difference]: Finished difference Result 1447 states and 2641 transitions. [2022-02-10 23:43:02,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 23:43:02,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 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 104 [2022-02-10 23:43:02,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:02,835 INFO L225 Difference]: With dead ends: 1447 [2022-02-10 23:43:02,835 INFO L226 Difference]: Without dead ends: 1150 [2022-02-10 23:43:02,835 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:43:02,836 INFO L934 BasicCegarLoop]: 147 mSDtfsCounter, 104 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:02,836 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 299 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 23:43:02,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2022-02-10 23:43:02,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 903. [2022-02-10 23:43:02,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 896 states have (on average 1.8091517857142858) internal successors, (1621), 902 states have internal predecessors, (1621), 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) [2022-02-10 23:43:02,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1621 transitions. [2022-02-10 23:43:02,855 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1621 transitions. Word has length 104 [2022-02-10 23:43:02,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:02,855 INFO L470 AbstractCegarLoop]: Abstraction has 903 states and 1621 transitions. [2022-02-10 23:43:02,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 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) [2022-02-10 23:43:02,856 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1621 transitions. [2022-02-10 23:43:02,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:02,857 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:02,857 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:02,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-10 23:43:02,858 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:02,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:02,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1475514096, now seen corresponding path program 1 times [2022-02-10 23:43:02,858 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:02,858 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147320309] [2022-02-10 23:43:02,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:02,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:03,167 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:03,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147320309] [2022-02-10 23:43:03,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147320309] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:03,167 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:03,167 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:03,168 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903293996] [2022-02-10 23:43:03,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:03,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:03,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:03,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:03,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:03,169 INFO L87 Difference]: Start difference. First operand 903 states and 1621 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:04,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:04,015 INFO L93 Difference]: Finished difference Result 1176 states and 2069 transitions. [2022-02-10 23:43:04,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-10 23:43:04,016 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:04,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:04,020 INFO L225 Difference]: With dead ends: 1176 [2022-02-10 23:43:04,020 INFO L226 Difference]: Without dead ends: 1135 [2022-02-10 23:43:04,021 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2022-02-10 23:43:04,021 INFO L934 BasicCegarLoop]: 153 mSDtfsCounter, 268 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:04,021 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 635 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-10 23:43:04,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2022-02-10 23:43:04,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 898. [2022-02-10 23:43:04,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 891 states have (on average 1.8159371492704826) internal successors, (1618), 897 states have internal predecessors, (1618), 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) [2022-02-10 23:43:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1618 transitions. [2022-02-10 23:43:04,040 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1618 transitions. Word has length 110 [2022-02-10 23:43:04,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:04,041 INFO L470 AbstractCegarLoop]: Abstraction has 898 states and 1618 transitions. [2022-02-10 23:43:04,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:04,041 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1618 transitions. [2022-02-10 23:43:04,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:04,042 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:04,042 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:04,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-10 23:43:04,043 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:04,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:04,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1432498022, now seen corresponding path program 2 times [2022-02-10 23:43:04,043 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:04,043 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465954213] [2022-02-10 23:43:04,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:04,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:04,382 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:04,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465954213] [2022-02-10 23:43:04,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465954213] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:04,383 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:04,383 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:04,383 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323817638] [2022-02-10 23:43:04,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:04,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:04,383 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:04,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:04,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:04,384 INFO L87 Difference]: Start difference. First operand 898 states and 1618 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:05,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:05,478 INFO L93 Difference]: Finished difference Result 1263 states and 2237 transitions. [2022-02-10 23:43:05,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-10 23:43:05,479 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:05,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:05,484 INFO L225 Difference]: With dead ends: 1263 [2022-02-10 23:43:05,484 INFO L226 Difference]: Without dead ends: 1233 [2022-02-10 23:43:05,484 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2022-02-10 23:43:05,485 INFO L934 BasicCegarLoop]: 151 mSDtfsCounter, 218 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:05,485 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 789 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-10 23:43:05,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2022-02-10 23:43:05,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 909. [2022-02-10 23:43:05,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 902 states have (on average 1.8148558758314857) internal successors, (1637), 908 states have internal predecessors, (1637), 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) [2022-02-10 23:43:05,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1637 transitions. [2022-02-10 23:43:05,503 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1637 transitions. Word has length 110 [2022-02-10 23:43:05,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:05,504 INFO L470 AbstractCegarLoop]: Abstraction has 909 states and 1637 transitions. [2022-02-10 23:43:05,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:05,504 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1637 transitions. [2022-02-10 23:43:05,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:05,505 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:05,505 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:05,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-10 23:43:05,506 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:05,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:05,506 INFO L85 PathProgramCache]: Analyzing trace with hash -590607614, now seen corresponding path program 3 times [2022-02-10 23:43:05,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:05,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109076727] [2022-02-10 23:43:05,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:05,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:05,774 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:05,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109076727] [2022-02-10 23:43:05,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109076727] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:05,774 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:05,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:05,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600503386] [2022-02-10 23:43:05,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:05,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:05,774 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:05,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:05,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:05,775 INFO L87 Difference]: Start difference. First operand 909 states and 1637 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:06,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:06,473 INFO L93 Difference]: Finished difference Result 1211 states and 2159 transitions. [2022-02-10 23:43:06,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-10 23:43:06,473 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:06,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:06,477 INFO L225 Difference]: With dead ends: 1211 [2022-02-10 23:43:06,478 INFO L226 Difference]: Without dead ends: 1182 [2022-02-10 23:43:06,478 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:43:06,478 INFO L934 BasicCegarLoop]: 148 mSDtfsCounter, 214 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:06,479 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 657 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-10 23:43:06,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2022-02-10 23:43:06,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 925. [2022-02-10 23:43:06,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 918 states have (on average 1.8028322440087146) internal successors, (1655), 924 states have internal predecessors, (1655), 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) [2022-02-10 23:43:06,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1655 transitions. [2022-02-10 23:43:06,508 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1655 transitions. Word has length 110 [2022-02-10 23:43:06,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:06,508 INFO L470 AbstractCegarLoop]: Abstraction has 925 states and 1655 transitions. [2022-02-10 23:43:06,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:06,508 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1655 transitions. [2022-02-10 23:43:06,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:06,510 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:06,510 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:06,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-10 23:43:06,510 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:06,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:06,511 INFO L85 PathProgramCache]: Analyzing trace with hash -822391322, now seen corresponding path program 4 times [2022-02-10 23:43:06,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:06,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757261428] [2022-02-10 23:43:06,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:06,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:06,905 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:06,905 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:06,905 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757261428] [2022-02-10 23:43:06,905 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757261428] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:06,906 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:06,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:06,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910956263] [2022-02-10 23:43:06,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:06,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:06,906 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:06,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:06,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:06,907 INFO L87 Difference]: Start difference. First operand 925 states and 1655 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:07,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:07,917 INFO L93 Difference]: Finished difference Result 1284 states and 2285 transitions. [2022-02-10 23:43:07,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-10 23:43:07,917 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:07,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:07,922 INFO L225 Difference]: With dead ends: 1284 [2022-02-10 23:43:07,922 INFO L226 Difference]: Without dead ends: 1261 [2022-02-10 23:43:07,922 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462 [2022-02-10 23:43:07,923 INFO L934 BasicCegarLoop]: 141 mSDtfsCounter, 192 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:07,923 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 722 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-10 23:43:07,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2022-02-10 23:43:07,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 927. [2022-02-10 23:43:07,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 920 states have (on average 1.8021739130434782) internal successors, (1658), 926 states have internal predecessors, (1658), 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) [2022-02-10 23:43:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1658 transitions. [2022-02-10 23:43:07,941 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1658 transitions. Word has length 110 [2022-02-10 23:43:07,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:07,941 INFO L470 AbstractCegarLoop]: Abstraction has 927 states and 1658 transitions. [2022-02-10 23:43:07,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:07,941 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1658 transitions. [2022-02-10 23:43:07,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:07,943 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:07,943 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:07,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-10 23:43:07,943 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:07,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:07,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1449470338, now seen corresponding path program 5 times [2022-02-10 23:43:07,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:07,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607026383] [2022-02-10 23:43:07,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:07,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:08,220 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:08,220 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:08,220 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607026383] [2022-02-10 23:43:08,220 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607026383] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:08,221 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:08,221 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:08,221 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318272060] [2022-02-10 23:43:08,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:08,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:08,222 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:08,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:08,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:08,222 INFO L87 Difference]: Start difference. First operand 927 states and 1658 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:09,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:09,153 INFO L93 Difference]: Finished difference Result 1321 states and 2352 transitions. [2022-02-10 23:43:09,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-10 23:43:09,154 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:09,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:09,158 INFO L225 Difference]: With dead ends: 1321 [2022-02-10 23:43:09,159 INFO L226 Difference]: Without dead ends: 1292 [2022-02-10 23:43:09,159 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2022-02-10 23:43:09,159 INFO L934 BasicCegarLoop]: 146 mSDtfsCounter, 219 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:09,160 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 650 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-10 23:43:09,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2022-02-10 23:43:09,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 926. [2022-02-10 23:43:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 919 states have (on average 1.8030467899891187) internal successors, (1657), 925 states have internal predecessors, (1657), 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) [2022-02-10 23:43:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1657 transitions. [2022-02-10 23:43:09,189 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1657 transitions. Word has length 110 [2022-02-10 23:43:09,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:09,190 INFO L470 AbstractCegarLoop]: Abstraction has 926 states and 1657 transitions. [2022-02-10 23:43:09,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:09,190 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1657 transitions. [2022-02-10 23:43:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:09,192 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:09,192 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:09,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-10 23:43:09,192 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:09,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash -280766288, now seen corresponding path program 6 times [2022-02-10 23:43:09,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:09,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356172338] [2022-02-10 23:43:09,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:09,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:09,477 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:09,477 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:09,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356172338] [2022-02-10 23:43:09,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356172338] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:09,478 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:09,478 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:09,478 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567783025] [2022-02-10 23:43:09,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:09,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:09,478 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:09,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:09,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:09,479 INFO L87 Difference]: Start difference. First operand 926 states and 1657 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:10,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:10,125 INFO L93 Difference]: Finished difference Result 1235 states and 2211 transitions. [2022-02-10 23:43:10,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-10 23:43:10,125 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:10,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:10,129 INFO L225 Difference]: With dead ends: 1235 [2022-02-10 23:43:10,130 INFO L226 Difference]: Without dead ends: 1199 [2022-02-10 23:43:10,132 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:43:10,133 INFO L934 BasicCegarLoop]: 140 mSDtfsCounter, 185 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:10,133 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 743 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-10 23:43:10,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2022-02-10 23:43:10,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 946. [2022-02-10 23:43:10,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 939 states have (on average 1.807241746538871) internal successors, (1697), 945 states have internal predecessors, (1697), 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) [2022-02-10 23:43:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1697 transitions. [2022-02-10 23:43:10,155 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1697 transitions. Word has length 110 [2022-02-10 23:43:10,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:10,155 INFO L470 AbstractCegarLoop]: Abstraction has 946 states and 1697 transitions. [2022-02-10 23:43:10,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:10,155 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1697 transitions. [2022-02-10 23:43:10,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:10,157 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:10,157 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:10,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-10 23:43:10,157 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:10,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:10,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1073377992, now seen corresponding path program 7 times [2022-02-10 23:43:10,158 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:10,158 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073187418] [2022-02-10 23:43:10,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:10,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:10,563 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:10,563 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:10,563 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073187418] [2022-02-10 23:43:10,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073187418] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:10,563 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:10,563 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:10,563 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737315695] [2022-02-10 23:43:10,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:10,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:10,564 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:10,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:10,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:10,564 INFO L87 Difference]: Start difference. First operand 946 states and 1697 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:11,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:11,582 INFO L93 Difference]: Finished difference Result 1232 states and 2196 transitions. [2022-02-10 23:43:11,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-10 23:43:11,583 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:11,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:11,587 INFO L225 Difference]: With dead ends: 1232 [2022-02-10 23:43:11,587 INFO L226 Difference]: Without dead ends: 1209 [2022-02-10 23:43:11,588 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:43:11,588 INFO L934 BasicCegarLoop]: 134 mSDtfsCounter, 188 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:11,588 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 713 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-10 23:43:11,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2022-02-10 23:43:11,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 949. [2022-02-10 23:43:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 942 states have (on average 1.8067940552016986) internal successors, (1702), 948 states have internal predecessors, (1702), 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) [2022-02-10 23:43:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1702 transitions. [2022-02-10 23:43:11,606 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1702 transitions. Word has length 110 [2022-02-10 23:43:11,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:11,606 INFO L470 AbstractCegarLoop]: Abstraction has 949 states and 1702 transitions. [2022-02-10 23:43:11,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:11,606 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1702 transitions. [2022-02-10 23:43:11,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:11,608 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:11,608 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:11,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-10 23:43:11,608 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:11,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1198483668, now seen corresponding path program 8 times [2022-02-10 23:43:11,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:11,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691430142] [2022-02-10 23:43:11,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:11,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:11,928 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:11,928 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:11,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691430142] [2022-02-10 23:43:11,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691430142] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:11,929 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:11,929 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:11,929 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368224287] [2022-02-10 23:43:11,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:11,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:11,929 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:11,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:11,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:11,930 INFO L87 Difference]: Start difference. First operand 949 states and 1702 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:12,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:12,755 INFO L93 Difference]: Finished difference Result 1269 states and 2263 transitions. [2022-02-10 23:43:12,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-10 23:43:12,755 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:12,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:12,760 INFO L225 Difference]: With dead ends: 1269 [2022-02-10 23:43:12,760 INFO L226 Difference]: Without dead ends: 1240 [2022-02-10 23:43:12,760 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2022-02-10 23:43:12,761 INFO L934 BasicCegarLoop]: 139 mSDtfsCounter, 214 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:12,761 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 644 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-10 23:43:12,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2022-02-10 23:43:12,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 948. [2022-02-10 23:43:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 941 states have (on average 1.8076514346439958) internal successors, (1701), 947 states have internal predecessors, (1701), 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) [2022-02-10 23:43:12,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1701 transitions. [2022-02-10 23:43:12,779 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1701 transitions. Word has length 110 [2022-02-10 23:43:12,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:12,779 INFO L470 AbstractCegarLoop]: Abstraction has 948 states and 1701 transitions. [2022-02-10 23:43:12,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:12,780 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1701 transitions. [2022-02-10 23:43:12,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:12,781 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:12,781 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:12,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-10 23:43:12,782 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:12,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:12,782 INFO L85 PathProgramCache]: Analyzing trace with hash -531752958, now seen corresponding path program 9 times [2022-02-10 23:43:12,782 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:12,782 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675489482] [2022-02-10 23:43:12,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:12,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:13,068 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:13,068 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:13,068 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675489482] [2022-02-10 23:43:13,068 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675489482] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:13,068 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:13,069 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:13,069 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521631390] [2022-02-10 23:43:13,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:13,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:13,069 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:13,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:13,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:13,070 INFO L87 Difference]: Start difference. First operand 948 states and 1701 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:13,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:13,861 INFO L93 Difference]: Finished difference Result 1324 states and 2356 transitions. [2022-02-10 23:43:13,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-10 23:43:13,861 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:13,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:13,866 INFO L225 Difference]: With dead ends: 1324 [2022-02-10 23:43:13,866 INFO L226 Difference]: Without dead ends: 1288 [2022-02-10 23:43:13,866 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2022-02-10 23:43:13,867 INFO L934 BasicCegarLoop]: 138 mSDtfsCounter, 215 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:13,867 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 569 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-10 23:43:13,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2022-02-10 23:43:13,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 947. [2022-02-10 23:43:13,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 940 states have (on average 1.8074468085106383) internal successors, (1699), 946 states have internal predecessors, (1699), 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) [2022-02-10 23:43:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1699 transitions. [2022-02-10 23:43:13,886 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1699 transitions. Word has length 110 [2022-02-10 23:43:13,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:13,886 INFO L470 AbstractCegarLoop]: Abstraction has 947 states and 1699 transitions. [2022-02-10 23:43:13,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:13,887 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1699 transitions. [2022-02-10 23:43:13,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:13,888 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:13,888 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:13,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-10 23:43:13,889 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:13,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:13,889 INFO L85 PathProgramCache]: Analyzing trace with hash -26692798, now seen corresponding path program 10 times [2022-02-10 23:43:13,889 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:13,889 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904158810] [2022-02-10 23:43:13,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:13,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:14,122 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:14,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904158810] [2022-02-10 23:43:14,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904158810] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:14,122 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:14,122 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:14,122 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200733389] [2022-02-10 23:43:14,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:14,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:14,123 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:14,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:14,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:14,123 INFO L87 Difference]: Start difference. First operand 947 states and 1699 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:14,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:14,672 INFO L93 Difference]: Finished difference Result 1177 states and 2109 transitions. [2022-02-10 23:43:14,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-10 23:43:14,672 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:14,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:14,676 INFO L225 Difference]: With dead ends: 1177 [2022-02-10 23:43:14,676 INFO L226 Difference]: Without dead ends: 1134 [2022-02-10 23:43:14,676 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:43:14,676 INFO L934 BasicCegarLoop]: 135 mSDtfsCounter, 172 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:14,677 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 566 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:43:14,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2022-02-10 23:43:14,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 971. [2022-02-10 23:43:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 964 states have (on average 1.812240663900415) internal successors, (1747), 970 states have internal predecessors, (1747), 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) [2022-02-10 23:43:14,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1747 transitions. [2022-02-10 23:43:14,694 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1747 transitions. Word has length 110 [2022-02-10 23:43:14,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:14,694 INFO L470 AbstractCegarLoop]: Abstraction has 971 states and 1747 transitions. [2022-02-10 23:43:14,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:14,695 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1747 transitions. [2022-02-10 23:43:14,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:14,696 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:14,696 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:14,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-10 23:43:14,696 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:14,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:14,697 INFO L85 PathProgramCache]: Analyzing trace with hash 18344714, now seen corresponding path program 11 times [2022-02-10 23:43:14,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:14,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48635092] [2022-02-10 23:43:14,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:14,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:14,893 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:14,893 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48635092] [2022-02-10 23:43:14,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48635092] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:14,893 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:14,893 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:14,893 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390165544] [2022-02-10 23:43:14,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:14,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:14,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:14,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:14,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:14,894 INFO L87 Difference]: Start difference. First operand 971 states and 1747 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:15,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:15,294 INFO L93 Difference]: Finished difference Result 1712 states and 3095 transitions. [2022-02-10 23:43:15,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-10 23:43:15,294 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:15,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:15,297 INFO L225 Difference]: With dead ends: 1712 [2022-02-10 23:43:15,297 INFO L226 Difference]: Without dead ends: 1661 [2022-02-10 23:43:15,298 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:43:15,298 INFO L934 BasicCegarLoop]: 128 mSDtfsCounter, 368 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:15,298 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 450 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 23:43:15,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2022-02-10 23:43:15,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1179. [2022-02-10 23:43:15,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 1172 states have (on average 1.8506825938566553) internal successors, (2169), 1178 states have internal predecessors, (2169), 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) [2022-02-10 23:43:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 2169 transitions. [2022-02-10 23:43:15,321 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 2169 transitions. Word has length 110 [2022-02-10 23:43:15,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:15,321 INFO L470 AbstractCegarLoop]: Abstraction has 1179 states and 2169 transitions. [2022-02-10 23:43:15,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:15,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 2169 transitions. [2022-02-10 23:43:15,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:15,323 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:15,323 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:15,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-10 23:43:15,323 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:15,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:15,324 INFO L85 PathProgramCache]: Analyzing trace with hash -724763226, now seen corresponding path program 1 times [2022-02-10 23:43:15,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:15,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051359533] [2022-02-10 23:43:15,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:15,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:15,530 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:15,530 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:15,530 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051359533] [2022-02-10 23:43:15,530 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051359533] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:15,530 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:15,531 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:15,531 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424577072] [2022-02-10 23:43:15,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:15,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:15,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:15,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:15,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:15,532 INFO L87 Difference]: Start difference. First operand 1179 states and 2169 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:15,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:15,979 INFO L93 Difference]: Finished difference Result 1533 states and 2770 transitions. [2022-02-10 23:43:15,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-10 23:43:15,980 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:15,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:15,982 INFO L225 Difference]: With dead ends: 1533 [2022-02-10 23:43:15,982 INFO L226 Difference]: Without dead ends: 1485 [2022-02-10 23:43:15,982 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:43:15,983 INFO L934 BasicCegarLoop]: 135 mSDtfsCounter, 350 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:15,983 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 535 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:43:15,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2022-02-10 23:43:16,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1187. [2022-02-10 23:43:16,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1180 states have (on average 1.8483050847457627) internal successors, (2181), 1186 states have internal predecessors, (2181), 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) [2022-02-10 23:43:16,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 2181 transitions. [2022-02-10 23:43:16,005 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 2181 transitions. Word has length 110 [2022-02-10 23:43:16,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:16,005 INFO L470 AbstractCegarLoop]: Abstraction has 1187 states and 2181 transitions. [2022-02-10 23:43:16,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:16,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 2181 transitions. [2022-02-10 23:43:16,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:16,007 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:16,007 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:16,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-10 23:43:16,007 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:16,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:16,008 INFO L85 PathProgramCache]: Analyzing trace with hash 2136923978, now seen corresponding path program 12 times [2022-02-10 23:43:16,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:16,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069160715] [2022-02-10 23:43:16,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:16,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:16,377 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:16,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069160715] [2022-02-10 23:43:16,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069160715] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:16,378 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:16,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:16,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405063456] [2022-02-10 23:43:16,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:16,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:16,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:16,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:16,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:16,379 INFO L87 Difference]: Start difference. First operand 1187 states and 2181 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:17,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:17,085 INFO L93 Difference]: Finished difference Result 1479 states and 2661 transitions. [2022-02-10 23:43:17,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 23:43:17,085 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:17,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:17,087 INFO L225 Difference]: With dead ends: 1479 [2022-02-10 23:43:17,087 INFO L226 Difference]: Without dead ends: 1456 [2022-02-10 23:43:17,088 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:17,088 INFO L934 BasicCegarLoop]: 122 mSDtfsCounter, 180 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:17,088 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 645 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-10 23:43:17,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2022-02-10 23:43:17,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1187. [2022-02-10 23:43:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1180 states have (on average 1.847457627118644) internal successors, (2180), 1186 states have internal predecessors, (2180), 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) [2022-02-10 23:43:17,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 2180 transitions. [2022-02-10 23:43:17,107 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 2180 transitions. Word has length 110 [2022-02-10 23:43:17,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:17,108 INFO L470 AbstractCegarLoop]: Abstraction has 1187 states and 2180 transitions. [2022-02-10 23:43:17,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:17,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 2180 transitions. [2022-02-10 23:43:17,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:17,109 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:17,110 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:17,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-10 23:43:17,110 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:17,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:17,110 INFO L85 PathProgramCache]: Analyzing trace with hash 113818342, now seen corresponding path program 13 times [2022-02-10 23:43:17,110 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:17,110 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707839132] [2022-02-10 23:43:17,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:17,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:17,421 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:17,421 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:17,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707839132] [2022-02-10 23:43:17,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707839132] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:17,421 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:17,421 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:17,421 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142820075] [2022-02-10 23:43:17,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:17,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:17,422 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:17,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:17,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:17,422 INFO L87 Difference]: Start difference. First operand 1187 states and 2180 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:17,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:17,956 INFO L93 Difference]: Finished difference Result 1508 states and 2715 transitions. [2022-02-10 23:43:17,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-10 23:43:17,959 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:17,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:17,962 INFO L225 Difference]: With dead ends: 1508 [2022-02-10 23:43:17,962 INFO L226 Difference]: Without dead ends: 1479 [2022-02-10 23:43:17,962 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:17,963 INFO L934 BasicCegarLoop]: 130 mSDtfsCounter, 208 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:17,963 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 489 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:43:17,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2022-02-10 23:43:17,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1186. [2022-02-10 23:43:17,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 1179 states have (on average 1.8481764206955047) internal successors, (2179), 1185 states have internal predecessors, (2179), 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) [2022-02-10 23:43:17,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2179 transitions. [2022-02-10 23:43:17,984 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2179 transitions. Word has length 110 [2022-02-10 23:43:17,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:17,984 INFO L470 AbstractCegarLoop]: Abstraction has 1186 states and 2179 transitions. [2022-02-10 23:43:17,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:17,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2179 transitions. [2022-02-10 23:43:17,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:17,986 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:17,986 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:17,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-10 23:43:17,987 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:17,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:17,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1616418284, now seen corresponding path program 14 times [2022-02-10 23:43:17,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:17,987 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765480915] [2022-02-10 23:43:17,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:17,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:18,275 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:18,275 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:18,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765480915] [2022-02-10 23:43:18,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765480915] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:18,275 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:18,276 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:18,276 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971922268] [2022-02-10 23:43:18,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:18,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:18,276 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:18,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:18,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:18,277 INFO L87 Difference]: Start difference. First operand 1186 states and 2179 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:18,785 INFO L93 Difference]: Finished difference Result 1554 states and 2790 transitions. [2022-02-10 23:43:18,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-10 23:43:18,785 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:18,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:18,788 INFO L225 Difference]: With dead ends: 1554 [2022-02-10 23:43:18,788 INFO L226 Difference]: Without dead ends: 1518 [2022-02-10 23:43:18,788 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:18,788 INFO L934 BasicCegarLoop]: 132 mSDtfsCounter, 271 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:18,789 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 448 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:43:18,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2022-02-10 23:43:18,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1185. [2022-02-10 23:43:18,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1178 states have (on average 1.8480475382003396) internal successors, (2177), 1184 states have internal predecessors, (2177), 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) [2022-02-10 23:43:18,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 2177 transitions. [2022-02-10 23:43:18,822 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 2177 transitions. Word has length 110 [2022-02-10 23:43:18,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:18,822 INFO L470 AbstractCegarLoop]: Abstraction has 1185 states and 2177 transitions. [2022-02-10 23:43:18,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:18,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 2177 transitions. [2022-02-10 23:43:18,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:18,824 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:18,824 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:18,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-10 23:43:18,825 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:18,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:18,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1111358124, now seen corresponding path program 15 times [2022-02-10 23:43:18,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:18,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794399479] [2022-02-10 23:43:18,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:18,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:19,078 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:19,079 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:19,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794399479] [2022-02-10 23:43:19,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794399479] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:19,079 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:19,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:19,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956901938] [2022-02-10 23:43:19,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:19,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:19,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:19,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:19,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:19,080 INFO L87 Difference]: Start difference. First operand 1185 states and 2177 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:19,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:19,561 INFO L93 Difference]: Finished difference Result 1496 states and 2690 transitions. [2022-02-10 23:43:19,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-10 23:43:19,561 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:19,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:19,564 INFO L225 Difference]: With dead ends: 1496 [2022-02-10 23:43:19,564 INFO L226 Difference]: Without dead ends: 1453 [2022-02-10 23:43:19,564 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:19,565 INFO L934 BasicCegarLoop]: 134 mSDtfsCounter, 247 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:19,565 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 517 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:43:19,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2022-02-10 23:43:19,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1163. [2022-02-10 23:43:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1156 states have (on average 1.8451557093425606) internal successors, (2133), 1162 states have internal predecessors, (2133), 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) [2022-02-10 23:43:19,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 2133 transitions. [2022-02-10 23:43:19,583 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 2133 transitions. Word has length 110 [2022-02-10 23:43:19,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:19,583 INFO L470 AbstractCegarLoop]: Abstraction has 1163 states and 2133 transitions. [2022-02-10 23:43:19,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:19,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 2133 transitions. [2022-02-10 23:43:19,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:19,585 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:19,585 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:19,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-10 23:43:19,585 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:19,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:19,586 INFO L85 PathProgramCache]: Analyzing trace with hash -347285014, now seen corresponding path program 1 times [2022-02-10 23:43:19,586 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:19,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533118963] [2022-02-10 23:43:19,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:19,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:19,899 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:19,900 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:19,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533118963] [2022-02-10 23:43:19,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533118963] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:19,900 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:19,900 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:19,900 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238081313] [2022-02-10 23:43:19,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:19,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:19,901 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:19,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:19,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:19,902 INFO L87 Difference]: Start difference. First operand 1163 states and 2133 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:20,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:20,531 INFO L93 Difference]: Finished difference Result 1477 states and 2702 transitions. [2022-02-10 23:43:20,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-10 23:43:20,531 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:20,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:20,534 INFO L225 Difference]: With dead ends: 1477 [2022-02-10 23:43:20,534 INFO L226 Difference]: Without dead ends: 1463 [2022-02-10 23:43:20,534 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2022-02-10 23:43:20,534 INFO L934 BasicCegarLoop]: 157 mSDtfsCounter, 228 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:20,535 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 680 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-10 23:43:20,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2022-02-10 23:43:20,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1184. [2022-02-10 23:43:20,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1177 states have (on average 1.8513169073916738) internal successors, (2179), 1183 states have internal predecessors, (2179), 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) [2022-02-10 23:43:20,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 2179 transitions. [2022-02-10 23:43:20,555 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 2179 transitions. Word has length 110 [2022-02-10 23:43:20,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:20,556 INFO L470 AbstractCegarLoop]: Abstraction has 1184 states and 2179 transitions. [2022-02-10 23:43:20,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:20,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 2179 transitions. [2022-02-10 23:43:20,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:20,557 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:20,558 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:20,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-10 23:43:20,558 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:20,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:20,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1081675656, now seen corresponding path program 2 times [2022-02-10 23:43:20,558 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:20,559 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905833268] [2022-02-10 23:43:20,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:20,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:20,926 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:20,926 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905833268] [2022-02-10 23:43:20,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905833268] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:20,926 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:20,926 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:20,926 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062044076] [2022-02-10 23:43:20,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:20,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:20,927 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:20,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:20,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:20,927 INFO L87 Difference]: Start difference. First operand 1184 states and 2179 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:21,939 INFO L93 Difference]: Finished difference Result 1667 states and 3067 transitions. [2022-02-10 23:43:21,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-10 23:43:21,940 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:21,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:21,943 INFO L225 Difference]: With dead ends: 1667 [2022-02-10 23:43:21,943 INFO L226 Difference]: Without dead ends: 1653 [2022-02-10 23:43:21,943 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:43:21,944 INFO L934 BasicCegarLoop]: 160 mSDtfsCounter, 269 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:21,944 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 821 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-10 23:43:21,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2022-02-10 23:43:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1194. [2022-02-10 23:43:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1187 states have (on average 1.8500421229991575) internal successors, (2196), 1193 states have internal predecessors, (2196), 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) [2022-02-10 23:43:21,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 2196 transitions. [2022-02-10 23:43:21,963 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 2196 transitions. Word has length 110 [2022-02-10 23:43:21,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:21,963 INFO L470 AbstractCegarLoop]: Abstraction has 1194 states and 2196 transitions. [2022-02-10 23:43:21,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:21,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 2196 transitions. [2022-02-10 23:43:21,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:21,965 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:21,965 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:21,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-10 23:43:21,965 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:21,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:21,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1609696764, now seen corresponding path program 3 times [2022-02-10 23:43:21,966 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:21,966 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725583124] [2022-02-10 23:43:21,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:21,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:22,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:22,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725583124] [2022-02-10 23:43:22,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725583124] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:22,341 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:22,341 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:22,341 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106956973] [2022-02-10 23:43:22,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:22,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:22,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:22,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:22,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:22,342 INFO L87 Difference]: Start difference. First operand 1194 states and 2196 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:22,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:22,997 INFO L93 Difference]: Finished difference Result 1533 states and 2826 transitions. [2022-02-10 23:43:22,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-10 23:43:22,998 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:22,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:23,000 INFO L225 Difference]: With dead ends: 1533 [2022-02-10 23:43:23,000 INFO L226 Difference]: Without dead ends: 1519 [2022-02-10 23:43:23,000 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:23,001 INFO L934 BasicCegarLoop]: 159 mSDtfsCounter, 229 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:23,001 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 764 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-10 23:43:23,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2022-02-10 23:43:23,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1209. [2022-02-10 23:43:23,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 1202 states have (on average 1.8510815307820299) internal successors, (2225), 1208 states have internal predecessors, (2225), 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) [2022-02-10 23:43:23,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 2225 transitions. [2022-02-10 23:43:23,019 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 2225 transitions. Word has length 110 [2022-02-10 23:43:23,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:23,019 INFO L470 AbstractCegarLoop]: Abstraction has 1209 states and 2225 transitions. [2022-02-10 23:43:23,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:23,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 2225 transitions. [2022-02-10 23:43:23,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:23,021 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:23,022 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:23,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-10 23:43:23,022 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:23,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:23,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1066179186, now seen corresponding path program 4 times [2022-02-10 23:43:23,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:23,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835603023] [2022-02-10 23:43:23,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:23,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:23,386 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:23,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835603023] [2022-02-10 23:43:23,387 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835603023] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:23,387 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:23,387 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:23,387 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024124440] [2022-02-10 23:43:23,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:23,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:23,387 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:23,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:23,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:23,388 INFO L87 Difference]: Start difference. First operand 1209 states and 2225 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:24,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:24,304 INFO L93 Difference]: Finished difference Result 1698 states and 3144 transitions. [2022-02-10 23:43:24,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-10 23:43:24,304 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:24,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:24,308 INFO L225 Difference]: With dead ends: 1698 [2022-02-10 23:43:24,308 INFO L226 Difference]: Without dead ends: 1691 [2022-02-10 23:43:24,309 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=335, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:43:24,309 INFO L934 BasicCegarLoop]: 150 mSDtfsCounter, 268 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:24,309 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 702 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-10 23:43:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2022-02-10 23:43:24,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1211. [2022-02-10 23:43:24,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 1204 states have (on average 1.851328903654485) internal successors, (2229), 1210 states have internal predecessors, (2229), 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) [2022-02-10 23:43:24,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 2229 transitions. [2022-02-10 23:43:24,330 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 2229 transitions. Word has length 110 [2022-02-10 23:43:24,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:24,330 INFO L470 AbstractCegarLoop]: Abstraction has 1211 states and 2229 transitions. [2022-02-10 23:43:24,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:24,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 2229 transitions. [2022-02-10 23:43:24,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:24,332 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:24,332 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:24,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-10 23:43:24,332 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:24,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:24,333 INFO L85 PathProgramCache]: Analyzing trace with hash -538158078, now seen corresponding path program 5 times [2022-02-10 23:43:24,333 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:24,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857952188] [2022-02-10 23:43:24,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:24,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:24,671 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:24,672 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:24,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857952188] [2022-02-10 23:43:24,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857952188] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:24,672 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:24,672 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:24,672 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762503862] [2022-02-10 23:43:24,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:24,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:24,673 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:24,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:24,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:24,673 INFO L87 Difference]: Start difference. First operand 1211 states and 2229 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:25,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:25,454 INFO L93 Difference]: Finished difference Result 1741 states and 3224 transitions. [2022-02-10 23:43:25,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-10 23:43:25,455 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:25,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:25,459 INFO L225 Difference]: With dead ends: 1741 [2022-02-10 23:43:25,459 INFO L226 Difference]: Without dead ends: 1727 [2022-02-10 23:43:25,459 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2022-02-10 23:43:25,460 INFO L934 BasicCegarLoop]: 152 mSDtfsCounter, 280 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:25,460 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 559 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-10 23:43:25,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2022-02-10 23:43:25,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1210. [2022-02-10 23:43:25,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 1203 states have (on average 1.8512053200332501) internal successors, (2227), 1209 states have internal predecessors, (2227), 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) [2022-02-10 23:43:25,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 2227 transitions. [2022-02-10 23:43:25,484 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 2227 transitions. Word has length 110 [2022-02-10 23:43:25,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:25,484 INFO L470 AbstractCegarLoop]: Abstraction has 1210 states and 2227 transitions. [2022-02-10 23:43:25,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:25,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 2227 transitions. [2022-02-10 23:43:25,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:25,486 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:25,487 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:25,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-02-10 23:43:25,487 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:25,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:25,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1059393834, now seen corresponding path program 6 times [2022-02-10 23:43:25,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:25,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326740993] [2022-02-10 23:43:25,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:25,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:25,808 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:25,808 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:25,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326740993] [2022-02-10 23:43:25,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326740993] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:25,809 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:25,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:25,809 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676943370] [2022-02-10 23:43:25,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:25,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:25,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:25,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:25,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:25,810 INFO L87 Difference]: Start difference. First operand 1210 states and 2227 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:26,489 INFO L93 Difference]: Finished difference Result 1564 states and 2898 transitions. [2022-02-10 23:43:26,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-10 23:43:26,489 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:26,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:26,491 INFO L225 Difference]: With dead ends: 1564 [2022-02-10 23:43:26,491 INFO L226 Difference]: Without dead ends: 1543 [2022-02-10 23:43:26,491 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:26,492 INFO L934 BasicCegarLoop]: 151 mSDtfsCounter, 215 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:26,492 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 754 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-10 23:43:26,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2022-02-10 23:43:26,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1227. [2022-02-10 23:43:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 1220 states have (on average 1.8524590163934427) internal successors, (2260), 1226 states have internal predecessors, (2260), 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) [2022-02-10 23:43:26,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 2260 transitions. [2022-02-10 23:43:26,508 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 2260 transitions. Word has length 110 [2022-02-10 23:43:26,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:26,509 INFO L470 AbstractCegarLoop]: Abstraction has 1227 states and 2260 transitions. [2022-02-10 23:43:26,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 2260 transitions. [2022-02-10 23:43:26,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:26,511 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:26,511 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:26,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-02-10 23:43:26,511 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:26,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:26,512 INFO L85 PathProgramCache]: Analyzing trace with hash 841263638, now seen corresponding path program 7 times [2022-02-10 23:43:26,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:26,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109431422] [2022-02-10 23:43:26,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:26,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:26,912 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:26,912 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:26,912 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109431422] [2022-02-10 23:43:26,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109431422] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:26,912 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:26,912 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:26,912 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396814826] [2022-02-10 23:43:26,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:26,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:26,913 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:26,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:26,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:26,913 INFO L87 Difference]: Start difference. First operand 1227 states and 2260 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:27,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:27,718 INFO L93 Difference]: Finished difference Result 1651 states and 3056 transitions. [2022-02-10 23:43:27,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-10 23:43:27,718 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:27,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:27,720 INFO L225 Difference]: With dead ends: 1651 [2022-02-10 23:43:27,721 INFO L226 Difference]: Without dead ends: 1644 [2022-02-10 23:43:27,721 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2022-02-10 23:43:27,721 INFO L934 BasicCegarLoop]: 140 mSDtfsCounter, 245 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:27,722 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 566 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:43:27,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2022-02-10 23:43:27,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1230. [2022-02-10 23:43:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1223 states have (on average 1.8528209321340965) internal successors, (2266), 1229 states have internal predecessors, (2266), 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) [2022-02-10 23:43:27,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2266 transitions. [2022-02-10 23:43:27,739 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2266 transitions. Word has length 110 [2022-02-10 23:43:27,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:27,739 INFO L470 AbstractCegarLoop]: Abstraction has 1230 states and 2266 transitions. [2022-02-10 23:43:27,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:27,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2266 transitions. [2022-02-10 23:43:27,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:27,741 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:27,741 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:27,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-02-10 23:43:27,741 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:27,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:27,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1369284746, now seen corresponding path program 8 times [2022-02-10 23:43:27,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:27,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810664066] [2022-02-10 23:43:27,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:27,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:28,092 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:28,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:28,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810664066] [2022-02-10 23:43:28,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810664066] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:28,093 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:28,093 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:28,093 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362121016] [2022-02-10 23:43:28,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:28,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:28,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:28,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:28,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:28,094 INFO L87 Difference]: Start difference. First operand 1230 states and 2266 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:28,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:28,992 INFO L93 Difference]: Finished difference Result 1694 states and 3136 transitions. [2022-02-10 23:43:28,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-10 23:43:28,992 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:28,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:28,995 INFO L225 Difference]: With dead ends: 1694 [2022-02-10 23:43:28,995 INFO L226 Difference]: Without dead ends: 1680 [2022-02-10 23:43:28,995 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2022-02-10 23:43:28,996 INFO L934 BasicCegarLoop]: 142 mSDtfsCounter, 212 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:28,996 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 849 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-10 23:43:28,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2022-02-10 23:43:29,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1229. [2022-02-10 23:43:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 1222 states have (on average 1.8527004909983633) internal successors, (2264), 1228 states have internal predecessors, (2264), 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) [2022-02-10 23:43:29,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 2264 transitions. [2022-02-10 23:43:29,013 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 2264 transitions. Word has length 110 [2022-02-10 23:43:29,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:29,013 INFO L470 AbstractCegarLoop]: Abstraction has 1229 states and 2264 transitions. [2022-02-10 23:43:29,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 2264 transitions. [2022-02-10 23:43:29,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:29,025 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:29,025 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:29,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-02-10 23:43:29,025 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:29,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:29,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1328130638, now seen corresponding path program 9 times [2022-02-10 23:43:29,026 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:29,026 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733980341] [2022-02-10 23:43:29,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:29,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:29,329 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:29,329 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:29,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733980341] [2022-02-10 23:43:29,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733980341] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:29,330 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:29,330 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:29,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316345471] [2022-02-10 23:43:29,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:29,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:29,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:29,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:29,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:29,331 INFO L87 Difference]: Start difference. First operand 1229 states and 2264 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:30,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:30,023 INFO L93 Difference]: Finished difference Result 1741 states and 3227 transitions. [2022-02-10 23:43:30,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-10 23:43:30,024 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:30,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:30,026 INFO L225 Difference]: With dead ends: 1741 [2022-02-10 23:43:30,027 INFO L226 Difference]: Without dead ends: 1720 [2022-02-10 23:43:30,027 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2022-02-10 23:43:30,027 INFO L934 BasicCegarLoop]: 141 mSDtfsCounter, 256 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:30,028 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 681 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-10 23:43:30,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2022-02-10 23:43:30,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1228. [2022-02-10 23:43:30,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 1221 states have (on average 1.8525798525798525) internal successors, (2262), 1227 states have internal predecessors, (2262), 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) [2022-02-10 23:43:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 2262 transitions. [2022-02-10 23:43:30,045 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 2262 transitions. Word has length 110 [2022-02-10 23:43:30,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:30,046 INFO L470 AbstractCegarLoop]: Abstraction has 1228 states and 2262 transitions. [2022-02-10 23:43:30,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 2262 transitions. [2022-02-10 23:43:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:30,047 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:30,047 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:30,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-02-10 23:43:30,048 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:30,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:30,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2088485180, now seen corresponding path program 10 times [2022-02-10 23:43:30,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:30,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126441879] [2022-02-10 23:43:30,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:30,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:30,325 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:30,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126441879] [2022-02-10 23:43:30,325 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126441879] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:30,325 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:30,325 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:30,325 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142805167] [2022-02-10 23:43:30,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:30,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:30,326 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:30,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:30,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:30,326 INFO L87 Difference]: Start difference. First operand 1228 states and 2262 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:30,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:30,811 INFO L93 Difference]: Finished difference Result 1522 states and 2815 transitions. [2022-02-10 23:43:30,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-10 23:43:30,811 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:30,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:30,813 INFO L225 Difference]: With dead ends: 1522 [2022-02-10 23:43:30,813 INFO L226 Difference]: Without dead ends: 1494 [2022-02-10 23:43:30,813 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:30,814 INFO L934 BasicCegarLoop]: 141 mSDtfsCounter, 239 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:30,814 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 558 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:43:30,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2022-02-10 23:43:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1247. [2022-02-10 23:43:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 1240 states have (on average 1.854032258064516) internal successors, (2299), 1246 states have internal predecessors, (2299), 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) [2022-02-10 23:43:30,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 2299 transitions. [2022-02-10 23:43:30,826 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 2299 transitions. Word has length 110 [2022-02-10 23:43:30,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:30,826 INFO L470 AbstractCegarLoop]: Abstraction has 1247 states and 2299 transitions. [2022-02-10 23:43:30,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:30,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 2299 transitions. [2022-02-10 23:43:30,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:30,828 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:30,828 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:30,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-02-10 23:43:30,828 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:30,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:30,829 INFO L85 PathProgramCache]: Analyzing trace with hash 330556564, now seen corresponding path program 11 times [2022-02-10 23:43:30,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:30,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513171970] [2022-02-10 23:43:30,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:30,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:31,238 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:31,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513171970] [2022-02-10 23:43:31,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513171970] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:31,238 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:31,238 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:31,238 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148778941] [2022-02-10 23:43:31,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:31,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:31,239 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:31,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:31,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:31,240 INFO L87 Difference]: Start difference. First operand 1247 states and 2299 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:31,819 INFO L93 Difference]: Finished difference Result 1498 states and 2736 transitions. [2022-02-10 23:43:31,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 23:43:31,819 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:31,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:31,821 INFO L225 Difference]: With dead ends: 1498 [2022-02-10 23:43:31,821 INFO L226 Difference]: Without dead ends: 1491 [2022-02-10 23:43:31,821 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:31,822 INFO L934 BasicCegarLoop]: 131 mSDtfsCounter, 237 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:31,822 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 509 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:43:31,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2022-02-10 23:43:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1246. [2022-02-10 23:43:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1239 states have (on average 1.8539144471347861) internal successors, (2297), 1245 states have internal predecessors, (2297), 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) [2022-02-10 23:43:31,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 2297 transitions. [2022-02-10 23:43:31,837 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 2297 transitions. Word has length 110 [2022-02-10 23:43:31,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:31,837 INFO L470 AbstractCegarLoop]: Abstraction has 1246 states and 2297 transitions. [2022-02-10 23:43:31,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:31,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 2297 transitions. [2022-02-10 23:43:31,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:31,839 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:31,839 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:31,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-02-10 23:43:31,839 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:31,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:31,840 INFO L85 PathProgramCache]: Analyzing trace with hash 858577672, now seen corresponding path program 12 times [2022-02-10 23:43:31,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:31,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080536384] [2022-02-10 23:43:31,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:31,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:32,235 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:32,235 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:32,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080536384] [2022-02-10 23:43:32,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080536384] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:32,235 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:32,235 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:32,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429271772] [2022-02-10 23:43:32,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:32,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:32,236 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:32,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:32,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:32,238 INFO L87 Difference]: Start difference. First operand 1246 states and 2297 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:32,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:32,777 INFO L93 Difference]: Finished difference Result 1541 states and 2816 transitions. [2022-02-10 23:43:32,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-10 23:43:32,777 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:32,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:32,779 INFO L225 Difference]: With dead ends: 1541 [2022-02-10 23:43:32,779 INFO L226 Difference]: Without dead ends: 1527 [2022-02-10 23:43:32,779 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:32,779 INFO L934 BasicCegarLoop]: 133 mSDtfsCounter, 251 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:32,779 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 439 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:43:32,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2022-02-10 23:43:32,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1245. [2022-02-10 23:43:32,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 1238 states have (on average 1.8537964458804523) internal successors, (2295), 1244 states have internal predecessors, (2295), 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) [2022-02-10 23:43:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 2295 transitions. [2022-02-10 23:43:32,792 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 2295 transitions. Word has length 110 [2022-02-10 23:43:32,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:32,792 INFO L470 AbstractCegarLoop]: Abstraction has 1245 states and 2295 transitions. [2022-02-10 23:43:32,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:32,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 2295 transitions. [2022-02-10 23:43:32,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:32,794 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:32,794 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:32,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-02-10 23:43:32,794 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:32,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:32,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1838837712, now seen corresponding path program 13 times [2022-02-10 23:43:32,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:32,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248795662] [2022-02-10 23:43:32,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:32,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:33,125 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:33,125 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:33,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248795662] [2022-02-10 23:43:33,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248795662] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:33,125 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:33,125 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:33,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105785548] [2022-02-10 23:43:33,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:33,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:33,126 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:33,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:33,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:33,126 INFO L87 Difference]: Start difference. First operand 1245 states and 2295 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:33,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:33,636 INFO L93 Difference]: Finished difference Result 1588 states and 2907 transitions. [2022-02-10 23:43:33,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-10 23:43:33,636 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:33,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:33,638 INFO L225 Difference]: With dead ends: 1588 [2022-02-10 23:43:33,638 INFO L226 Difference]: Without dead ends: 1567 [2022-02-10 23:43:33,638 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:33,639 INFO L934 BasicCegarLoop]: 135 mSDtfsCounter, 240 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:33,639 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 456 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:43:33,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2022-02-10 23:43:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1244. [2022-02-10 23:43:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 1237 states have (on average 1.8536782538399352) internal successors, (2293), 1243 states have internal predecessors, (2293), 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) [2022-02-10 23:43:33,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 2293 transitions. [2022-02-10 23:43:33,652 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 2293 transitions. Word has length 110 [2022-02-10 23:43:33,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:33,652 INFO L470 AbstractCegarLoop]: Abstraction has 1244 states and 2293 transitions. [2022-02-10 23:43:33,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:33,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 2293 transitions. [2022-02-10 23:43:33,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:33,654 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:33,654 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:33,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-02-10 23:43:33,654 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:33,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:33,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1577778106, now seen corresponding path program 14 times [2022-02-10 23:43:33,655 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:33,655 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362658156] [2022-02-10 23:43:33,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:33,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:33,938 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:33,938 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:33,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362658156] [2022-02-10 23:43:33,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362658156] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:33,938 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:33,938 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:33,939 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370599242] [2022-02-10 23:43:33,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:33,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:33,939 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:33,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:33,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:33,940 INFO L87 Difference]: Start difference. First operand 1244 states and 2293 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:34,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:34,479 INFO L93 Difference]: Finished difference Result 1639 states and 3006 transitions. [2022-02-10 23:43:34,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-10 23:43:34,479 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:34,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:34,482 INFO L225 Difference]: With dead ends: 1639 [2022-02-10 23:43:34,482 INFO L226 Difference]: Without dead ends: 1611 [2022-02-10 23:43:34,482 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:34,482 INFO L934 BasicCegarLoop]: 135 mSDtfsCounter, 322 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:34,483 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 420 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:43:34,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2022-02-10 23:43:34,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1243. [2022-02-10 23:43:34,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1236 states have (on average 1.853559870550162) internal successors, (2291), 1242 states have internal predecessors, (2291), 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) [2022-02-10 23:43:34,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 2291 transitions. [2022-02-10 23:43:34,499 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 2291 transitions. Word has length 110 [2022-02-10 23:43:34,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:34,499 INFO L470 AbstractCegarLoop]: Abstraction has 1243 states and 2291 transitions. [2022-02-10 23:43:34,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:34,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 2291 transitions. [2022-02-10 23:43:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:34,500 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:34,501 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:34,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-02-10 23:43:34,501 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:34,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:34,501 INFO L85 PathProgramCache]: Analyzing trace with hash -934609174, now seen corresponding path program 15 times [2022-02-10 23:43:34,501 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:34,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702611639] [2022-02-10 23:43:34,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:34,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:34,755 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:34,755 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:34,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702611639] [2022-02-10 23:43:34,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702611639] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:34,756 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:34,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:34,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391513728] [2022-02-10 23:43:34,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:34,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:34,756 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:34,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:34,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:34,757 INFO L87 Difference]: Start difference. First operand 1243 states and 2291 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:35,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:35,282 INFO L93 Difference]: Finished difference Result 1411 states and 2560 transitions. [2022-02-10 23:43:35,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-10 23:43:35,282 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:35,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:35,284 INFO L225 Difference]: With dead ends: 1411 [2022-02-10 23:43:35,284 INFO L226 Difference]: Without dead ends: 1379 [2022-02-10 23:43:35,285 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2022-02-10 23:43:35,285 INFO L934 BasicCegarLoop]: 142 mSDtfsCounter, 312 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:35,285 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 518 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 23:43:35,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2022-02-10 23:43:35,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1171. [2022-02-10 23:43:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 1164 states have (on average 1.838487972508591) internal successors, (2140), 1170 states have internal predecessors, (2140), 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) [2022-02-10 23:43:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 2140 transitions. [2022-02-10 23:43:35,299 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 2140 transitions. Word has length 110 [2022-02-10 23:43:35,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:35,300 INFO L470 AbstractCegarLoop]: Abstraction has 1171 states and 2140 transitions. [2022-02-10 23:43:35,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:35,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 2140 transitions. [2022-02-10 23:43:35,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:35,301 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:35,301 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:35,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-02-10 23:43:35,301 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:35,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:35,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1325303053, now seen corresponding path program 1 times [2022-02-10 23:43:35,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:35,302 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887474146] [2022-02-10 23:43:35,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:35,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:35,486 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:35,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887474146] [2022-02-10 23:43:35,487 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887474146] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:35,487 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:35,487 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 23:43:35,487 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285899896] [2022-02-10 23:43:35,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:35,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 23:43:35,487 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:35,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 23:43:35,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:35,488 INFO L87 Difference]: Start difference. First operand 1171 states and 2140 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:36,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:36,135 INFO L93 Difference]: Finished difference Result 1481 states and 2654 transitions. [2022-02-10 23:43:36,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-10 23:43:36,135 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:36,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:36,137 INFO L225 Difference]: With dead ends: 1481 [2022-02-10 23:43:36,137 INFO L226 Difference]: Without dead ends: 1011 [2022-02-10 23:43:36,137 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2022-02-10 23:43:36,137 INFO L934 BasicCegarLoop]: 149 mSDtfsCounter, 320 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:36,137 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 828 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-10 23:43:36,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2022-02-10 23:43:36,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 764. [2022-02-10 23:43:36,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 757 states have (on average 1.7807133421400265) internal successors, (1348), 763 states have internal predecessors, (1348), 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) [2022-02-10 23:43:36,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1348 transitions. [2022-02-10 23:43:36,147 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1348 transitions. Word has length 110 [2022-02-10 23:43:36,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:36,147 INFO L470 AbstractCegarLoop]: Abstraction has 764 states and 1348 transitions. [2022-02-10 23:43:36,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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) [2022-02-10 23:43:36,148 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1348 transitions. [2022-02-10 23:43:36,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:36,148 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:36,149 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:36,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-02-10 23:43:36,149 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:36,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:36,149 INFO L85 PathProgramCache]: Analyzing trace with hash -661546646, now seen corresponding path program 16 times [2022-02-10 23:43:36,149 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:36,150 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872888249] [2022-02-10 23:43:36,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:36,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:36,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:36,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872888249] [2022-02-10 23:43:36,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872888249] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:36,356 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:36,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 23:43:36,356 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99791571] [2022-02-10 23:43:36,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:36,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:36,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:36,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:36,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-02-10 23:43:36,357 INFO L87 Difference]: Start difference. First operand 764 states and 1348 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:36,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:36,690 INFO L93 Difference]: Finished difference Result 876 states and 1540 transitions. [2022-02-10 23:43:36,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 23:43:36,691 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:36,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:36,692 INFO L225 Difference]: With dead ends: 876 [2022-02-10 23:43:36,692 INFO L226 Difference]: Without dead ends: 825 [2022-02-10 23:43:36,692 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2022-02-10 23:43:36,693 INFO L934 BasicCegarLoop]: 111 mSDtfsCounter, 205 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:36,693 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 384 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 23:43:36,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2022-02-10 23:43:36,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 777. [2022-02-10 23:43:36,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 770 states have (on average 1.761038961038961) internal successors, (1356), 776 states have internal predecessors, (1356), 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) [2022-02-10 23:43:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1356 transitions. [2022-02-10 23:43:36,702 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1356 transitions. Word has length 110 [2022-02-10 23:43:36,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:36,703 INFO L470 AbstractCegarLoop]: Abstraction has 777 states and 1356 transitions. [2022-02-10 23:43:36,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:36,703 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1356 transitions. [2022-02-10 23:43:36,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:36,704 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:36,704 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:36,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-02-10 23:43:36,704 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:36,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:36,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1404654586, now seen corresponding path program 2 times [2022-02-10 23:43:36,705 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:36,705 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808978710] [2022-02-10 23:43:36,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:36,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:36,908 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:36,908 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:36,909 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808978710] [2022-02-10 23:43:36,909 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808978710] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:36,909 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:36,909 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 23:43:36,909 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056947975] [2022-02-10 23:43:36,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:36,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:36,910 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:36,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:36,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-02-10 23:43:36,911 INFO L87 Difference]: Start difference. First operand 777 states and 1356 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:37,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:37,276 INFO L93 Difference]: Finished difference Result 877 states and 1540 transitions. [2022-02-10 23:43:37,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 23:43:37,276 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:37,277 INFO L225 Difference]: With dead ends: 877 [2022-02-10 23:43:37,278 INFO L226 Difference]: Without dead ends: 829 [2022-02-10 23:43:37,278 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2022-02-10 23:43:37,278 INFO L934 BasicCegarLoop]: 116 mSDtfsCounter, 208 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:37,278 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 453 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 23:43:37,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2022-02-10 23:43:37,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 805. [2022-02-10 23:43:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 799 states have (on average 1.7659574468085106) internal successors, (1411), 804 states have internal predecessors, (1411), 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) [2022-02-10 23:43:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1411 transitions. [2022-02-10 23:43:37,287 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1411 transitions. Word has length 110 [2022-02-10 23:43:37,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:37,287 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 1411 transitions. [2022-02-10 23:43:37,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:37,287 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1411 transitions. [2022-02-10 23:43:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:37,288 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:37,288 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:37,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-02-10 23:43:37,289 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:37,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:37,289 INFO L85 PathProgramCache]: Analyzing trace with hash 451291516, now seen corresponding path program 16 times [2022-02-10 23:43:37,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:37,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866109024] [2022-02-10 23:43:37,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:37,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:37,542 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:37,542 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866109024] [2022-02-10 23:43:37,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866109024] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:37,542 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:37,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 23:43:37,542 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014463197] [2022-02-10 23:43:37,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:37,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:37,542 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:37,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:37,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-02-10 23:43:37,543 INFO L87 Difference]: Start difference. First operand 805 states and 1411 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:37,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:37,831 INFO L93 Difference]: Finished difference Result 905 states and 1597 transitions. [2022-02-10 23:43:37,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 23:43:37,831 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:37,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:37,832 INFO L225 Difference]: With dead ends: 905 [2022-02-10 23:43:37,832 INFO L226 Difference]: Without dead ends: 873 [2022-02-10 23:43:37,833 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2022-02-10 23:43:37,833 INFO L934 BasicCegarLoop]: 105 mSDtfsCounter, 186 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:37,833 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 393 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 23:43:37,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2022-02-10 23:43:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 855. [2022-02-10 23:43:37,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 849 states have (on average 1.7750294464075382) internal successors, (1507), 854 states have internal predecessors, (1507), 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) [2022-02-10 23:43:37,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1507 transitions. [2022-02-10 23:43:37,844 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1507 transitions. Word has length 110 [2022-02-10 23:43:37,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:37,844 INFO L470 AbstractCegarLoop]: Abstraction has 855 states and 1507 transitions. [2022-02-10 23:43:37,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:37,844 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1507 transitions. [2022-02-10 23:43:37,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:37,845 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:37,845 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:37,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-02-10 23:43:37,845 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:37,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:37,846 INFO L85 PathProgramCache]: Analyzing trace with hash 60597637, now seen corresponding path program 2 times [2022-02-10 23:43:37,846 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:37,846 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693074843] [2022-02-10 23:43:37,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:37,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:38,020 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:38,021 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:38,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693074843] [2022-02-10 23:43:38,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693074843] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:38,021 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:38,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 23:43:38,021 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185574412] [2022-02-10 23:43:38,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:38,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:38,022 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:38,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:38,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-02-10 23:43:38,022 INFO L87 Difference]: Start difference. First operand 855 states and 1507 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:38,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:38,545 INFO L93 Difference]: Finished difference Result 824 states and 1446 transitions. [2022-02-10 23:43:38,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-10 23:43:38,546 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:38,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:38,546 INFO L225 Difference]: With dead ends: 824 [2022-02-10 23:43:38,546 INFO L226 Difference]: Without dead ends: 498 [2022-02-10 23:43:38,547 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2022-02-10 23:43:38,547 INFO L934 BasicCegarLoop]: 131 mSDtfsCounter, 243 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:38,547 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 476 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 23:43:38,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-02-10 23:43:38,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 474. [2022-02-10 23:43:38,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 471 states have (on average 1.6178343949044587) internal successors, (762), 473 states have internal predecessors, (762), 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) [2022-02-10 23:43:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 762 transitions. [2022-02-10 23:43:38,552 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 762 transitions. Word has length 110 [2022-02-10 23:43:38,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:38,553 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 762 transitions. [2022-02-10 23:43:38,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:38,553 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 762 transitions. [2022-02-10 23:43:38,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:38,553 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:38,553 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:38,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-02-10 23:43:38,553 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:38,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:38,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1609272518, now seen corresponding path program 17 times [2022-02-10 23:43:38,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:38,554 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115899864] [2022-02-10 23:43:38,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:38,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:38,932 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:38,932 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:38,932 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115899864] [2022-02-10 23:43:38,932 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115899864] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:38,932 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:38,932 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 23:43:38,932 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958040026] [2022-02-10 23:43:38,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:38,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:38,933 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:38,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:38,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-02-10 23:43:38,933 INFO L87 Difference]: Start difference. First operand 474 states and 762 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:39,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:39,516 INFO L93 Difference]: Finished difference Result 508 states and 804 transitions. [2022-02-10 23:43:39,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 23:43:39,516 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:39,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:39,517 INFO L225 Difference]: With dead ends: 508 [2022-02-10 23:43:39,517 INFO L226 Difference]: Without dead ends: 485 [2022-02-10 23:43:39,517 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2022-02-10 23:43:39,517 INFO L934 BasicCegarLoop]: 95 mSDtfsCounter, 187 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:39,518 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 344 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 23:43:39,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-02-10 23:43:39,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 473. [2022-02-10 23:43:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 470 states have (on average 1.6170212765957446) internal successors, (760), 472 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) [2022-02-10 23:43:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 760 transitions. [2022-02-10 23:43:39,522 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 760 transitions. Word has length 110 [2022-02-10 23:43:39,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:39,522 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 760 transitions. [2022-02-10 23:43:39,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 760 transitions. [2022-02-10 23:43:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:39,523 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:39,523 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:39,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-02-10 23:43:39,523 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:39,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:39,523 INFO L85 PathProgramCache]: Analyzing trace with hash 662589142, now seen corresponding path program 18 times [2022-02-10 23:43:39,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:39,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612964663] [2022-02-10 23:43:39,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:39,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:39,901 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:39,902 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:39,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612964663] [2022-02-10 23:43:39,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612964663] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:39,902 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:39,902 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 23:43:39,902 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320501899] [2022-02-10 23:43:39,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:39,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:39,902 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:39,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:39,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-02-10 23:43:39,903 INFO L87 Difference]: Start difference. First operand 473 states and 760 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:40,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:40,399 INFO L93 Difference]: Finished difference Result 529 states and 845 transitions. [2022-02-10 23:43:40,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 23:43:40,400 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:40,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:40,400 INFO L225 Difference]: With dead ends: 529 [2022-02-10 23:43:40,400 INFO L226 Difference]: Without dead ends: 484 [2022-02-10 23:43:40,400 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-02-10 23:43:40,401 INFO L934 BasicCegarLoop]: 98 mSDtfsCounter, 171 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:40,401 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 369 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 23:43:40,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-02-10 23:43:40,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 472. [2022-02-10 23:43:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 469 states have (on average 1.6162046908315566) internal successors, (758), 471 states have internal predecessors, (758), 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) [2022-02-10 23:43:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 758 transitions. [2022-02-10 23:43:40,405 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 758 transitions. Word has length 110 [2022-02-10 23:43:40,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:40,406 INFO L470 AbstractCegarLoop]: Abstraction has 472 states and 758 transitions. [2022-02-10 23:43:40,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 758 transitions. [2022-02-10 23:43:40,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:40,406 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:40,406 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:40,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-02-10 23:43:40,407 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:40,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:40,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1067647484, now seen corresponding path program 19 times [2022-02-10 23:43:40,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:40,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686904933] [2022-02-10 23:43:40,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:40,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:40,727 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:40,727 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:40,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686904933] [2022-02-10 23:43:40,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686904933] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:40,727 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:40,727 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 23:43:40,727 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262422635] [2022-02-10 23:43:40,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:40,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:40,728 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:40,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:40,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-02-10 23:43:40,728 INFO L87 Difference]: Start difference. First operand 472 states and 758 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:41,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:41,180 INFO L93 Difference]: Finished difference Result 550 states and 886 transitions. [2022-02-10 23:43:41,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 23:43:41,181 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:41,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:41,181 INFO L225 Difference]: With dead ends: 550 [2022-02-10 23:43:41,181 INFO L226 Difference]: Without dead ends: 483 [2022-02-10 23:43:41,182 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2022-02-10 23:43:41,182 INFO L934 BasicCegarLoop]: 101 mSDtfsCounter, 175 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:41,182 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 341 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 23:43:41,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-02-10 23:43:41,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 471. [2022-02-10 23:43:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 468 states have (on average 1.6153846153846154) internal successors, (756), 470 states have internal predecessors, (756), 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) [2022-02-10 23:43:41,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 756 transitions. [2022-02-10 23:43:41,192 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 756 transitions. Word has length 110 [2022-02-10 23:43:41,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:41,193 INFO L470 AbstractCegarLoop]: Abstraction has 471 states and 756 transitions. [2022-02-10 23:43:41,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:41,193 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 756 transitions. [2022-02-10 23:43:41,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:41,193 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:41,193 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:41,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-02-10 23:43:41,193 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:41,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:41,194 INFO L85 PathProgramCache]: Analyzing trace with hash -562587324, now seen corresponding path program 20 times [2022-02-10 23:43:41,194 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:41,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121255173] [2022-02-10 23:43:41,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:41,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:41,449 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:41,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121255173] [2022-02-10 23:43:41,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121255173] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:41,449 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:41,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 23:43:41,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205098707] [2022-02-10 23:43:41,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:41,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:41,450 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:41,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:41,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-02-10 23:43:41,450 INFO L87 Difference]: Start difference. First operand 471 states and 756 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:41,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:41,774 INFO L93 Difference]: Finished difference Result 464 states and 740 transitions. [2022-02-10 23:43:41,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 23:43:41,774 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:41,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:41,775 INFO L225 Difference]: With dead ends: 464 [2022-02-10 23:43:41,775 INFO L226 Difference]: Without dead ends: 371 [2022-02-10 23:43:41,775 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2022-02-10 23:43:41,775 INFO L934 BasicCegarLoop]: 104 mSDtfsCounter, 162 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:41,775 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 330 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 23:43:41,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-02-10 23:43:41,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 359. [2022-02-10 23:43:41,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 357 states have (on average 1.57703081232493) internal successors, (563), 358 states have internal predecessors, (563), 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) [2022-02-10 23:43:41,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 563 transitions. [2022-02-10 23:43:41,780 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 563 transitions. Word has length 110 [2022-02-10 23:43:41,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:41,780 INFO L470 AbstractCegarLoop]: Abstraction has 359 states and 563 transitions. [2022-02-10 23:43:41,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 563 transitions. [2022-02-10 23:43:41,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:41,781 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:41,781 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:41,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-02-10 23:43:41,781 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:41,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:41,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2078749440, now seen corresponding path program 17 times [2022-02-10 23:43:41,782 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:41,782 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530428259] [2022-02-10 23:43:41,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:41,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:42,195 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:42,196 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:42,196 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530428259] [2022-02-10 23:43:42,196 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530428259] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:42,196 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:42,196 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 23:43:42,196 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45622878] [2022-02-10 23:43:42,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:42,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:42,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:42,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:42,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-02-10 23:43:42,197 INFO L87 Difference]: Start difference. First operand 359 states and 563 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:42,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:42,678 INFO L93 Difference]: Finished difference Result 385 states and 588 transitions. [2022-02-10 23:43:42,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 23:43:42,679 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:42,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:42,679 INFO L225 Difference]: With dead ends: 385 [2022-02-10 23:43:42,679 INFO L226 Difference]: Without dead ends: 362 [2022-02-10 23:43:42,679 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2022-02-10 23:43:42,680 INFO L934 BasicCegarLoop]: 90 mSDtfsCounter, 178 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:42,680 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 298 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 23:43:42,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-02-10 23:43:42,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 358. [2022-02-10 23:43:42,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 356 states have (on average 1.5758426966292134) internal successors, (561), 357 states have internal predecessors, (561), 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) [2022-02-10 23:43:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 561 transitions. [2022-02-10 23:43:42,684 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 561 transitions. Word has length 110 [2022-02-10 23:43:42,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:42,684 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 561 transitions. [2022-02-10 23:43:42,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:42,685 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 561 transitions. [2022-02-10 23:43:42,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:42,685 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:42,685 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:42,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-02-10 23:43:42,686 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:42,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:42,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1688196748, now seen corresponding path program 18 times [2022-02-10 23:43:42,686 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:42,686 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977790751] [2022-02-10 23:43:42,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:42,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:43,073 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:43,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:43,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977790751] [2022-02-10 23:43:43,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977790751] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:43,074 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:43,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 23:43:43,074 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396299850] [2022-02-10 23:43:43,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:43,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:43,075 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:43,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:43,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-02-10 23:43:43,075 INFO L87 Difference]: Start difference. First operand 358 states and 561 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:43,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:43,511 INFO L93 Difference]: Finished difference Result 402 states and 625 transitions. [2022-02-10 23:43:43,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 23:43:43,512 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:43,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:43,512 INFO L225 Difference]: With dead ends: 402 [2022-02-10 23:43:43,512 INFO L226 Difference]: Without dead ends: 357 [2022-02-10 23:43:43,513 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-02-10 23:43:43,513 INFO L934 BasicCegarLoop]: 93 mSDtfsCounter, 146 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:43,513 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 379 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 23:43:43,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-02-10 23:43:43,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2022-02-10 23:43:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 355 states have (on average 1.5746478873239436) internal successors, (559), 356 states have internal predecessors, (559), 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) [2022-02-10 23:43:43,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 559 transitions. [2022-02-10 23:43:43,517 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 559 transitions. Word has length 110 [2022-02-10 23:43:43,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:43,517 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 559 transitions. [2022-02-10 23:43:43,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:43,517 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 559 transitions. [2022-02-10 23:43:43,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:43,518 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:43,518 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:43,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-02-10 23:43:43,518 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:43,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:43,518 INFO L85 PathProgramCache]: Analyzing trace with hash -90644836, now seen corresponding path program 19 times [2022-02-10 23:43:43,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:43,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549972797] [2022-02-10 23:43:43,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:43,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:43,874 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:43,874 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:43,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549972797] [2022-02-10 23:43:43,874 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549972797] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:43,874 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:43,874 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 23:43:43,874 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314996152] [2022-02-10 23:43:43,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:43,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:43,875 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:43,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:43,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-02-10 23:43:43,875 INFO L87 Difference]: Start difference. First operand 357 states and 559 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:44,281 INFO L93 Difference]: Finished difference Result 423 states and 666 transitions. [2022-02-10 23:43:44,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 23:43:44,282 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:44,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:44,282 INFO L225 Difference]: With dead ends: 423 [2022-02-10 23:43:44,282 INFO L226 Difference]: Without dead ends: 356 [2022-02-10 23:43:44,283 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2022-02-10 23:43:44,283 INFO L934 BasicCegarLoop]: 96 mSDtfsCounter, 155 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:44,283 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 408 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 23:43:44,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-02-10 23:43:44,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2022-02-10 23:43:44,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 354 states have (on average 1.573446327683616) internal successors, (557), 355 states have internal predecessors, (557), 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) [2022-02-10 23:43:44,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 557 transitions. [2022-02-10 23:43:44,287 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 557 transitions. Word has length 110 [2022-02-10 23:43:44,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:44,287 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 557 transitions. [2022-02-10 23:43:44,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 557 transitions. [2022-02-10 23:43:44,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:44,288 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:44,288 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:44,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-02-10 23:43:44,288 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:44,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:44,288 INFO L85 PathProgramCache]: Analyzing trace with hash -968996314, now seen corresponding path program 20 times [2022-02-10 23:43:44,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:44,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126640872] [2022-02-10 23:43:44,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:44,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:44,597 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:44,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126640872] [2022-02-10 23:43:44,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126640872] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:44,597 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:44,597 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 23:43:44,597 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748314633] [2022-02-10 23:43:44,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:44,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:44,598 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:44,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:44,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-02-10 23:43:44,598 INFO L87 Difference]: Start difference. First operand 356 states and 557 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:44,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:44,993 INFO L93 Difference]: Finished difference Result 345 states and 536 transitions. [2022-02-10 23:43:44,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 23:43:44,993 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:44,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:44,993 INFO L225 Difference]: With dead ends: 345 [2022-02-10 23:43:44,994 INFO L226 Difference]: Without dead ends: 253 [2022-02-10 23:43:44,994 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2022-02-10 23:43:44,994 INFO L934 BasicCegarLoop]: 97 mSDtfsCounter, 139 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:44,994 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 363 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 23:43:44,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-02-10 23:43:44,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2022-02-10 23:43:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.5119047619047619) internal successors, (381), 252 states have internal predecessors, (381), 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) [2022-02-10 23:43:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 381 transitions. [2022-02-10 23:43:44,997 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 381 transitions. Word has length 110 [2022-02-10 23:43:44,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:44,998 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 381 transitions. [2022-02-10 23:43:44,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 381 transitions. [2022-02-10 23:43:44,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:44,998 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:44,999 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:44,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-02-10 23:43:44,999 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:44,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:44,999 INFO L85 PathProgramCache]: Analyzing trace with hash 157500306, now seen corresponding path program 3 times [2022-02-10 23:43:44,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:44,999 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25261352] [2022-02-10 23:43:45,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:45,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:45,283 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:45,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25261352] [2022-02-10 23:43:45,283 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25261352] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:45,283 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:45,284 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 23:43:45,284 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237497742] [2022-02-10 23:43:45,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:45,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:45,284 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:45,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:45,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-10 23:43:45,285 INFO L87 Difference]: Start difference. First operand 253 states and 381 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:45,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:45,506 INFO L93 Difference]: Finished difference Result 279 states and 406 transitions. [2022-02-10 23:43:45,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 23:43:45,506 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:45,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:45,506 INFO L225 Difference]: With dead ends: 279 [2022-02-10 23:43:45,506 INFO L226 Difference]: Without dead ends: 250 [2022-02-10 23:43:45,506 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2022-02-10 23:43:45,507 INFO L934 BasicCegarLoop]: 81 mSDtfsCounter, 95 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:45,507 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 280 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 23:43:45,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-02-10 23:43:45,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2022-02-10 23:43:45,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.5060240963855422) internal successors, (375), 249 states have internal predecessors, (375), 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) [2022-02-10 23:43:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2022-02-10 23:43:45,510 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 110 [2022-02-10 23:43:45,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:45,511 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2022-02-10 23:43:45,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:45,511 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2022-02-10 23:43:45,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:45,511 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:45,511 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:45,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-02-10 23:43:45,512 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:45,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:45,512 INFO L85 PathProgramCache]: Analyzing trace with hash -370520802, now seen corresponding path program 4 times [2022-02-10 23:43:45,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:45,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386561114] [2022-02-10 23:43:45,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:45,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:45,801 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:45,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:45,802 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386561114] [2022-02-10 23:43:45,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386561114] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:45,802 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:45,802 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 23:43:45,802 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924813593] [2022-02-10 23:43:45,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:45,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:45,802 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:45,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:45,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-02-10 23:43:45,803 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:46,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:46,044 INFO L93 Difference]: Finished difference Result 302 states and 451 transitions. [2022-02-10 23:43:46,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 23:43:46,045 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:46,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:46,045 INFO L225 Difference]: With dead ends: 302 [2022-02-10 23:43:46,045 INFO L226 Difference]: Without dead ends: 247 [2022-02-10 23:43:46,046 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-10 23:43:46,046 INFO L934 BasicCegarLoop]: 97 mSDtfsCounter, 145 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:46,046 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 324 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 23:43:46,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-02-10 23:43:46,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2022-02-10 23:43:46,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.5) internal successors, (369), 246 states have internal predecessors, (369), 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) [2022-02-10 23:43:46,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 369 transitions. [2022-02-10 23:43:46,049 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 369 transitions. Word has length 110 [2022-02-10 23:43:46,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:46,049 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 369 transitions. [2022-02-10 23:43:46,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:46,049 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 369 transitions. [2022-02-10 23:43:46,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:46,050 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:46,050 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:46,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-02-10 23:43:46,050 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:46,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:46,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1841162828, now seen corresponding path program 5 times [2022-02-10 23:43:46,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:46,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957387950] [2022-02-10 23:43:46,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:46,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:46,312 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:46,312 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:46,312 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957387950] [2022-02-10 23:43:46,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957387950] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:46,312 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:46,312 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 23:43:46,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473427121] [2022-02-10 23:43:46,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:46,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:46,313 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:46,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:46,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-02-10 23:43:46,313 INFO L87 Difference]: Start difference. First operand 247 states and 369 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:46,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:46,604 INFO L93 Difference]: Finished difference Result 325 states and 496 transitions. [2022-02-10 23:43:46,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 23:43:46,604 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:46,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:46,604 INFO L225 Difference]: With dead ends: 325 [2022-02-10 23:43:46,604 INFO L226 Difference]: Without dead ends: 244 [2022-02-10 23:43:46,605 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-02-10 23:43:46,605 INFO L934 BasicCegarLoop]: 101 mSDtfsCounter, 123 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:46,605 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 462 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 23:43:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-02-10 23:43:46,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-02-10 23:43:46,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.4938271604938271) internal successors, (363), 243 states have internal predecessors, (363), 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) [2022-02-10 23:43:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 363 transitions. [2022-02-10 23:43:46,607 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 363 transitions. Word has length 110 [2022-02-10 23:43:46,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:46,607 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 363 transitions. [2022-02-10 23:43:46,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 363 transitions. [2022-02-10 23:43:46,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-10 23:43:46,608 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:43:46,608 INFO L515 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:43:46,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-02-10 23:43:46,609 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-10 23:43:46,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:43:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2090455932, now seen corresponding path program 6 times [2022-02-10 23:43:46,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:43:46,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702035200] [2022-02-10 23:43:46,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:43:46,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:43:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:43:46,863 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-10 23:43:46,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:43:46,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702035200] [2022-02-10 23:43:46,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702035200] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:43:46,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:43:46,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 23:43:46,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034012149] [2022-02-10 23:43:46,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:43:46,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 23:43:46,864 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:43:46,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 23:43:46,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-10 23:43:46,865 INFO L87 Difference]: Start difference. First operand 244 states and 363 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:43:47,122 INFO L93 Difference]: Finished difference Result 229 states and 334 transitions. [2022-02-10 23:43:47,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 23:43:47,123 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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 110 [2022-02-10 23:43:47,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:43:47,123 INFO L225 Difference]: With dead ends: 229 [2022-02-10 23:43:47,123 INFO L226 Difference]: Without dead ends: 0 [2022-02-10 23:43:47,123 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2022-02-10 23:43:47,124 INFO L934 BasicCegarLoop]: 99 mSDtfsCounter, 96 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 23:43:47,124 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 382 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 23:43:47,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-10 23:43:47,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-10 23:43:47,124 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) [2022-02-10 23:43:47,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-10 23:43:47,124 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2022-02-10 23:43:47,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:43:47,124 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-10 23:43:47,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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) [2022-02-10 23:43:47,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-10 23:43:47,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-10 23:43:47,126 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2022-02-10 23:43:47,127 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2022-02-10 23:43:47,127 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-02-10 23:43:47,127 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2022-02-10 23:43:47,127 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2022-02-10 23:43:47,127 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2022-02-10 23:43:47,127 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2022-02-10 23:43:47,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-02-10 23:43:47,129 INFO L733 BasicCegarLoop]: Path program histogram: [20, 20, 6, 2, 2, 2, 2, 1, 1, 1] [2022-02-10 23:43:47,132 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-10 23:43:47,132 INFO L184 ceAbstractionStarter]: Computing trace abstraction results [2022-02-10 23:43:47,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 11:43:47 BasicIcfg [2022-02-10 23:43:47,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-10 23:43:47,134 INFO L158 Benchmark]: Toolchain (without parser) took 52127.28ms. Allocated memory was 179.3MB in the beginning and 273.7MB in the end (delta: 94.4MB). Free memory was 125.5MB in the beginning and 201.2MB in the end (delta: -75.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-02-10 23:43:47,134 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 179.3MB. Free memory was 143.5MB in the beginning and 143.5MB in the end (delta: 71.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 23:43:47,134 INFO L158 Benchmark]: CACSL2BoogieTranslator took 686.89ms. Allocated memory was 179.3MB in the beginning and 227.5MB in the end (delta: 48.2MB). Free memory was 125.3MB in the beginning and 184.0MB in the end (delta: -58.7MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-02-10 23:43:47,134 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.71ms. Allocated memory is still 227.5MB. Free memory was 184.0MB in the beginning and 181.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-10 23:43:47,134 INFO L158 Benchmark]: Boogie Preprocessor took 45.49ms. Allocated memory is still 227.5MB. Free memory was 181.4MB in the beginning and 179.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-10 23:43:47,134 INFO L158 Benchmark]: RCFGBuilder took 438.75ms. Allocated memory is still 227.5MB. Free memory was 179.8MB in the beginning and 164.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-02-10 23:43:47,134 INFO L158 Benchmark]: TraceAbstraction took 50875.72ms. Allocated memory was 227.5MB in the beginning and 273.7MB in the end (delta: 46.1MB). Free memory was 163.5MB in the beginning and 201.2MB in the end (delta: -37.6MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. [2022-02-10 23:43:47,135 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.13ms. Allocated memory is still 179.3MB. Free memory was 143.5MB in the beginning and 143.5MB in the end (delta: 71.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 686.89ms. Allocated memory was 179.3MB in the beginning and 227.5MB in the end (delta: 48.2MB). Free memory was 125.3MB in the beginning and 184.0MB in the end (delta: -58.7MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 73.71ms. Allocated memory is still 227.5MB. Free memory was 184.0MB in the beginning and 181.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.49ms. Allocated memory is still 227.5MB. Free memory was 181.4MB in the beginning and 179.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 438.75ms. Allocated memory is still 227.5MB. Free memory was 179.8MB in the beginning and 164.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 50875.72ms. Allocated memory was 227.5MB in the beginning and 273.7MB in the end (delta: 46.1MB). Free memory was 163.5MB in the beginning and 201.2MB in the end (delta: -37.6MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 943]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 943]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 931]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 931]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 138 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 50.7s, OverallIterations: 57, TraceHistogramMax: 10, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.1s, AutomataDifference: 30.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11001 SdHoareTripleChecker+Valid, 20.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11001 mSDsluCounter, 29256 SdHoareTripleChecker+Invalid, 17.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22103 mSDsCounter, 4543 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27833 IncrementalHoareTripleChecker+Invalid, 32376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4543 mSolverCounterUnsat, 7253 mSDtfsCounter, 27833 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1558 GetRequests, 668 SyntacticMatches, 1 SemanticMatches, 889 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2959 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1247occurred in iteration=35, InterpolantAutomatonStates: 755, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 57 MinimizatonAttempts, 11775 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 6184 NumberOfCodeBlocks, 6134 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 6302 ConstructedInterpolants, 0 QuantifiedInterpolants, 55127 SizeOfPredicates, 22 NumberOfNonLiveVariables, 681 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 65 InterpolantComputations, 54 PerfectInterpolantSequences, 11880/12403 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-10 23:43:47,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...