/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/09-regions_03-list2_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 15:09:05,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 15:09:05,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 15:09:05,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 15:09:05,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 15:09:05,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 15:09:05,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 15:09:05,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 15:09:05,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 15:09:05,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 15:09:05,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 15:09:05,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 15:09:05,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 15:09:05,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 15:09:05,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 15:09:05,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 15:09:05,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 15:09:05,969 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 15:09:05,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 15:09:05,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 15:09:05,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 15:09:05,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 15:09:05,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 15:09:05,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 15:09:05,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 15:09:05,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 15:09:05,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 15:09:05,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 15:09:05,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 15:09:05,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 15:09:05,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 15:09:05,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 15:09:05,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 15:09:05,993 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 15:09:05,994 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 15:09:05,994 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 15:09:05,994 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 15:09:05,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 15:09:05,995 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 15:09:05,995 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 15:09:05,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 15:09:05,996 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-03-15 15:09:06,009 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 15:09:06,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 15:09:06,010 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-15 15:09:06,010 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-15 15:09:06,010 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 15:09:06,011 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 15:09:06,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 15:09:06,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 15:09:06,011 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 15:09:06,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 15:09:06,012 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 15:09:06,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 15:09:06,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 15:09:06,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 15:09:06,012 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 15:09:06,012 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 15:09:06,012 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 15:09:06,013 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 15:09:06,013 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 15:09:06,013 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 15:09:06,013 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 15:09:06,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 15:09:06,013 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 15:09:06,013 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 15:09:06,014 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 15:09:06,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 15:09:06,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 15:09:06,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-15 15:09:06,014 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 15:09:06,014 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 15:09:06,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 15:09:06,014 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-15 15:09:06,015 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 15:09:06,015 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-03-15 15:09:06,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 15:09:06,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 15:09:06,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 15:09:06,228 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 15:09:06,230 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 15:09:06,231 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.i [2022-03-15 15:09:06,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4d9e2cba/10fd2c8ae28c434cb2a40d23e5136b1e/FLAGd479ce13c [2022-03-15 15:09:06,720 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 15:09:06,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.i [2022-03-15 15:09:06,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4d9e2cba/10fd2c8ae28c434cb2a40d23e5136b1e/FLAGd479ce13c [2022-03-15 15:09:07,255 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4d9e2cba/10fd2c8ae28c434cb2a40d23e5136b1e [2022-03-15 15:09:07,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 15:09:07,258 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 15:09:07,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 15:09:07,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 15:09:07,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 15:09:07,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 03:09:07" (1/1) ... [2022-03-15 15:09:07,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d81aee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:09:07, skipping insertion in model container [2022-03-15 15:09:07,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 03:09:07" (1/1) ... [2022-03-15 15:09:07,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 15:09:07,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 15:09:07,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 15:09:07,778 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 15:09:07,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 15:09:07,864 INFO L208 MainTranslator]: Completed translation [2022-03-15 15:09:07,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:09:07 WrapperNode [2022-03-15 15:09:07,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 15:09:07,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 15:09:07,866 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 15:09:07,867 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 15:09:07,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:09:07" (1/1) ... [2022-03-15 15:09:07,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:09:07" (1/1) ... [2022-03-15 15:09:07,930 INFO L137 Inliner]: procedures = 368, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 184 [2022-03-15 15:09:07,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 15:09:07,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 15:09:07,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 15:09:07,931 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 15:09:07,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:09:07" (1/1) ... [2022-03-15 15:09:07,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:09:07" (1/1) ... [2022-03-15 15:09:07,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:09:07" (1/1) ... [2022-03-15 15:09:07,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:09:07" (1/1) ... [2022-03-15 15:09:07,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:09:07" (1/1) ... [2022-03-15 15:09:07,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:09:07" (1/1) ... [2022-03-15 15:09:07,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:09:07" (1/1) ... [2022-03-15 15:09:07,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 15:09:07,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 15:09:07,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 15:09:07,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 15:09:07,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:09:07" (1/1) ... [2022-03-15 15:09:07,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 15:09:08,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:08,026 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-03-15 15:09:08,033 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-03-15 15:09:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 15:09:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-03-15 15:09:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 15:09:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 15:09:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 15:09:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 15:09:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 15:09:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 15:09:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-03-15 15:09:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-15 15:09:08,062 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-15 15:09:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 15:09:08,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 15:09:08,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 15:09:08,063 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 15:09:08,153 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 15:09:08,154 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 15:09:08,474 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 15:09:08,480 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 15:09:08,480 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 15:09:08,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 03:09:08 BoogieIcfgContainer [2022-03-15 15:09:08,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 15:09:08,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 15:09:08,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 15:09:08,486 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 15:09:08,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 03:09:07" (1/3) ... [2022-03-15 15:09:08,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390fb38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 03:09:08, skipping insertion in model container [2022-03-15 15:09:08,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:09:07" (2/3) ... [2022-03-15 15:09:08,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390fb38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 03:09:08, skipping insertion in model container [2022-03-15 15:09:08,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 03:09:08" (3/3) ... [2022-03-15 15:09:08,488 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_03-list2_rc.i [2022-03-15 15:09:08,491 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 15:09:08,491 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-15 15:09:08,491 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-03-15 15:09:08,491 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 15:09:08,533 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,534 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,534 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,534 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,534 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,534 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,534 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,534 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,534 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,535 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,536 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,537 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,537 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,537 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,537 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,537 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,537 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,537 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,537 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,538 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,538 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,538 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,538 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,538 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,538 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,538 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,538 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,539 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,539 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,539 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,539 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,539 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,539 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,539 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,539 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,539 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,540 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,540 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,540 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,540 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,540 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,540 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,540 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,540 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,540 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,540 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,540 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,540 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,541 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,541 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,541 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,541 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,541 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,541 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,541 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,541 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,541 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,541 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,541 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,542 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,542 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,542 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,542 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,542 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,542 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,542 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,542 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,542 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,542 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,542 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,543 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,543 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,543 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,543 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,543 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,543 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,543 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,543 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,543 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,543 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,544 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,544 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,544 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,544 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,544 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,544 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,544 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,544 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,544 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,544 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,545 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,545 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,545 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,545 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,545 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,545 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,545 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,546 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,546 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,546 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,546 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,546 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,546 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,546 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,546 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,546 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,546 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,546 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,546 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,547 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,547 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,547 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,547 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,547 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,547 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,547 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,547 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,547 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,547 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,548 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,548 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,548 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,548 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,548 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,548 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,548 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,548 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,548 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,549 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,549 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,549 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,549 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,549 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,549 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,549 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,549 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,549 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,549 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,549 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,549 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,550 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,550 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,550 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,550 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,550 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,550 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,550 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,550 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,550 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,550 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,550 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,551 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,551 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,551 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,551 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,551 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,551 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,551 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,551 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,551 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,551 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,551 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,552 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,552 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,552 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,552 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,552 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,552 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,552 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,552 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,552 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,553 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,553 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,553 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,553 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,553 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,553 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,553 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,553 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,553 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,554 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,554 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,554 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,554 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,554 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,554 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,554 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,554 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,554 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,556 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,556 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,557 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,557 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,557 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,557 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,557 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,557 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,558 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,558 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,558 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,567 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,567 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,568 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,569 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,569 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:09:08,570 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 15:09:08,606 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 15:09:08,612 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, mLazyFiniteAutomaton=false, 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, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 15:09:08,612 INFO L340 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2022-03-15 15:09:08,626 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 290 places, 286 transitions, 577 flow [2022-03-15 15:09:08,737 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4078 states, 4002 states have (on average 1.9662668665667167) internal successors, (7869), 4077 states have internal predecessors, (7869), 0 states have call successors, (0), 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-03-15 15:09:08,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 4078 states, 4002 states have (on average 1.9662668665667167) internal successors, (7869), 4077 states have internal predecessors, (7869), 0 states have call successors, (0), 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-03-15 15:09:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-15 15:09:08,749 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:08,749 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:08,750 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:08,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:08,754 INFO L85 PathProgramCache]: Analyzing trace with hash 2019786680, now seen corresponding path program 1 times [2022-03-15 15:09:08,763 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:08,763 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021439978] [2022-03-15 15:09:08,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:08,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:09,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:09,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021439978] [2022-03-15 15:09:09,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021439978] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:09,077 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:09,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:09:09,078 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80482845] [2022-03-15 15:09:09,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:09,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:09:09,082 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:09,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:09:09,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:09:09,112 INFO L87 Difference]: Start difference. First operand has 4078 states, 4002 states have (on average 1.9662668665667167) internal successors, (7869), 4077 states have internal predecessors, (7869), 0 states have call successors, (0), 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 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-03-15 15:09:09,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:09,366 INFO L93 Difference]: Finished difference Result 4075 states and 7866 transitions. [2022-03-15 15:09:09,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:09:09,368 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 50 [2022-03-15 15:09:09,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:09,392 INFO L225 Difference]: With dead ends: 4075 [2022-03-15 15:09:09,392 INFO L226 Difference]: Without dead ends: 4075 [2022-03-15 15:09:09,393 INFO L932 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-03-15 15:09:09,397 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 6 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:09,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 585 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:09:09,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2022-03-15 15:09:09,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 4075. [2022-03-15 15:09:09,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4075 states, 4002 states have (on average 1.9655172413793103) internal successors, (7866), 4074 states have internal predecessors, (7866), 0 states have call successors, (0), 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-03-15 15:09:09,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4075 states to 4075 states and 7866 transitions. [2022-03-15 15:09:09,519 INFO L78 Accepts]: Start accepts. Automaton has 4075 states and 7866 transitions. Word has length 50 [2022-03-15 15:09:09,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:09,519 INFO L470 AbstractCegarLoop]: Abstraction has 4075 states and 7866 transitions. [2022-03-15 15:09:09,519 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-03-15 15:09:09,520 INFO L276 IsEmpty]: Start isEmpty. Operand 4075 states and 7866 transitions. [2022-03-15 15:09:09,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-03-15 15:09:09,521 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:09,521 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:09,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 15:09:09,521 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:09,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:09,522 INFO L85 PathProgramCache]: Analyzing trace with hash 433367205, now seen corresponding path program 1 times [2022-03-15 15:09:09,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:09,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926691419] [2022-03-15 15:09:09,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:09,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:09,632 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:09,632 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926691419] [2022-03-15 15:09:09,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926691419] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:09,632 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:09,632 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:09:09,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855839471] [2022-03-15 15:09:09,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:09,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:09:09,634 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:09,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:09:09,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:09:09,634 INFO L87 Difference]: Start difference. First operand 4075 states and 7866 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 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-03-15 15:09:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:09,880 INFO L93 Difference]: Finished difference Result 4072 states and 7863 transitions. [2022-03-15 15:09:09,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:09:09,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-03-15 15:09:09,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:09,892 INFO L225 Difference]: With dead ends: 4072 [2022-03-15 15:09:09,892 INFO L226 Difference]: Without dead ends: 4072 [2022-03-15 15:09:09,893 INFO L932 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-03-15 15:09:09,894 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 3 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:09,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 740 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:09:09,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4072 states. [2022-03-15 15:09:09,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4072 to 4072. [2022-03-15 15:09:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4072 states, 4002 states have (on average 1.964767616191904) internal successors, (7863), 4071 states have internal predecessors, (7863), 0 states have call successors, (0), 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-03-15 15:09:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4072 states to 4072 states and 7863 transitions. [2022-03-15 15:09:09,966 INFO L78 Accepts]: Start accepts. Automaton has 4072 states and 7863 transitions. Word has length 58 [2022-03-15 15:09:09,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:09,967 INFO L470 AbstractCegarLoop]: Abstraction has 4072 states and 7863 transitions. [2022-03-15 15:09:09,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 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-03-15 15:09:09,968 INFO L276 IsEmpty]: Start isEmpty. Operand 4072 states and 7863 transitions. [2022-03-15 15:09:09,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-03-15 15:09:09,970 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:09,970 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:09,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 15:09:09,971 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:09,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:09,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1886336480, now seen corresponding path program 1 times [2022-03-15 15:09:09,971 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:09,971 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995115191] [2022-03-15 15:09:09,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:09,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:10,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:10,029 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:10,029 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995115191] [2022-03-15 15:09:10,029 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995115191] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:10,029 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:10,029 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 15:09:10,029 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940938186] [2022-03-15 15:09:10,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:10,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 15:09:10,030 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:10,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 15:09:10,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 15:09:10,030 INFO L87 Difference]: Start difference. First operand 4072 states and 7863 transitions. Second operand has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 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-03-15 15:09:10,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:10,058 INFO L93 Difference]: Finished difference Result 4071 states and 7862 transitions. [2022-03-15 15:09:10,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 15:09:10,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 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 65 [2022-03-15 15:09:10,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:10,072 INFO L225 Difference]: With dead ends: 4071 [2022-03-15 15:09:10,072 INFO L226 Difference]: Without dead ends: 4071 [2022-03-15 15:09:10,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-15 15:09:10,077 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 2 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:10,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 535 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:09:10,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4071 states. [2022-03-15 15:09:10,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4071 to 4071. [2022-03-15 15:09:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4071 states, 4002 states have (on average 1.9645177411294352) internal successors, (7862), 4070 states have internal predecessors, (7862), 0 states have call successors, (0), 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-03-15 15:09:10,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4071 states to 4071 states and 7862 transitions. [2022-03-15 15:09:10,162 INFO L78 Accepts]: Start accepts. Automaton has 4071 states and 7862 transitions. Word has length 65 [2022-03-15 15:09:10,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:10,162 INFO L470 AbstractCegarLoop]: Abstraction has 4071 states and 7862 transitions. [2022-03-15 15:09:10,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 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-03-15 15:09:10,162 INFO L276 IsEmpty]: Start isEmpty. Operand 4071 states and 7862 transitions. [2022-03-15 15:09:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-03-15 15:09:10,163 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:10,163 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:10,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 15:09:10,164 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:10,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:10,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1758764611, now seen corresponding path program 1 times [2022-03-15 15:09:10,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:10,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248629930] [2022-03-15 15:09:10,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:10,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:10,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:10,234 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:10,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248629930] [2022-03-15 15:09:10,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248629930] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:10,234 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:10,234 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 15:09:10,234 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377734800] [2022-03-15 15:09:10,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:10,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 15:09:10,235 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:10,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 15:09:10,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 15:09:10,236 INFO L87 Difference]: Start difference. First operand 4071 states and 7862 transitions. Second operand has 3 states, 2 states have (on average 34.5) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-03-15 15:09:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:10,260 INFO L93 Difference]: Finished difference Result 3943 states and 7610 transitions. [2022-03-15 15:09:10,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 15:09:10,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 34.5) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-03-15 15:09:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:10,274 INFO L225 Difference]: With dead ends: 3943 [2022-03-15 15:09:10,274 INFO L226 Difference]: Without dead ends: 3943 [2022-03-15 15:09:10,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-15 15:09:10,280 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 203 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:10,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 334 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:09:10,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3943 states. [2022-03-15 15:09:10,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3943 to 3943. [2022-03-15 15:09:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3943 states, 3891 states have (on average 1.9557954253405294) internal successors, (7610), 3942 states have internal predecessors, (7610), 0 states have call successors, (0), 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-03-15 15:09:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3943 states to 3943 states and 7610 transitions. [2022-03-15 15:09:10,338 INFO L78 Accepts]: Start accepts. Automaton has 3943 states and 7610 transitions. Word has length 69 [2022-03-15 15:09:10,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:10,338 INFO L470 AbstractCegarLoop]: Abstraction has 3943 states and 7610 transitions. [2022-03-15 15:09:10,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 34.5) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-03-15 15:09:10,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3943 states and 7610 transitions. [2022-03-15 15:09:10,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-03-15 15:09:10,345 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:10,345 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:10,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 15:09:10,345 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:10,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:10,345 INFO L85 PathProgramCache]: Analyzing trace with hash 894955619, now seen corresponding path program 1 times [2022-03-15 15:09:10,346 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:10,346 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508514155] [2022-03-15 15:09:10,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:10,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:10,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:10,468 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:10,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508514155] [2022-03-15 15:09:10,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508514155] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:10,469 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:10,469 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:09:10,469 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834153295] [2022-03-15 15:09:10,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:10,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:09:10,470 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:10,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:09:10,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:09:10,470 INFO L87 Difference]: Start difference. First operand 3943 states and 7610 transitions. Second operand has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 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-03-15 15:09:10,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:10,603 INFO L93 Difference]: Finished difference Result 3942 states and 7609 transitions. [2022-03-15 15:09:10,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:09:10,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2022-03-15 15:09:10,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:10,620 INFO L225 Difference]: With dead ends: 3942 [2022-03-15 15:09:10,620 INFO L226 Difference]: Without dead ends: 3942 [2022-03-15 15:09:10,620 INFO L932 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-03-15 15:09:10,621 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 1 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:10,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 592 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 15:09:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3942 states. [2022-03-15 15:09:10,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3942 to 3942. [2022-03-15 15:09:10,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3942 states, 3891 states have (on average 1.955538421999486) internal successors, (7609), 3941 states have internal predecessors, (7609), 0 states have call successors, (0), 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-03-15 15:09:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 7609 transitions. [2022-03-15 15:09:10,689 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 7609 transitions. Word has length 100 [2022-03-15 15:09:10,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:10,690 INFO L470 AbstractCegarLoop]: Abstraction has 3942 states and 7609 transitions. [2022-03-15 15:09:10,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 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-03-15 15:09:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 7609 transitions. [2022-03-15 15:09:10,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-03-15 15:09:10,695 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:10,695 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:10,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 15:09:10,695 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:10,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:10,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1539731552, now seen corresponding path program 1 times [2022-03-15 15:09:10,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:10,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364111110] [2022-03-15 15:09:10,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:10,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:10,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:10,761 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:10,761 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364111110] [2022-03-15 15:09:10,761 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364111110] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:10,761 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:10,761 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 15:09:10,761 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536481033] [2022-03-15 15:09:10,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:10,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 15:09:10,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:10,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 15:09:10,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 15:09:10,762 INFO L87 Difference]: Start difference. First operand 3942 states and 7609 transitions. Second operand has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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-03-15 15:09:10,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:10,782 INFO L93 Difference]: Finished difference Result 3941 states and 7608 transitions. [2022-03-15 15:09:10,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 15:09:10,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-03-15 15:09:10,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:10,796 INFO L225 Difference]: With dead ends: 3941 [2022-03-15 15:09:10,797 INFO L226 Difference]: Without dead ends: 3941 [2022-03-15 15:09:10,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-15 15:09:10,798 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 2 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:10,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 523 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:09:10,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states. [2022-03-15 15:09:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 3941. [2022-03-15 15:09:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3941 states, 3891 states have (on average 1.9552814186584426) internal successors, (7608), 3940 states have internal predecessors, (7608), 0 states have call successors, (0), 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-03-15 15:09:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 7608 transitions. [2022-03-15 15:09:10,850 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 7608 transitions. Word has length 106 [2022-03-15 15:09:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:10,851 INFO L470 AbstractCegarLoop]: Abstraction has 3941 states and 7608 transitions. [2022-03-15 15:09:10,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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-03-15 15:09:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 7608 transitions. [2022-03-15 15:09:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-03-15 15:09:10,851 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:10,851 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:10,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 15:09:10,852 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:10,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:10,852 INFO L85 PathProgramCache]: Analyzing trace with hash -930597695, now seen corresponding path program 1 times [2022-03-15 15:09:10,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:10,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312918600] [2022-03-15 15:09:10,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:10,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:10,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:10,894 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:10,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312918600] [2022-03-15 15:09:10,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312918600] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:10,894 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:10,894 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 15:09:10,894 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14856151] [2022-03-15 15:09:10,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:10,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 15:09:10,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:10,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 15:09:10,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 15:09:10,895 INFO L87 Difference]: Start difference. First operand 3941 states and 7608 transitions. Second operand has 3 states, 2 states have (on average 55.0) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-03-15 15:09:10,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:10,914 INFO L93 Difference]: Finished difference Result 3815 states and 7360 transitions. [2022-03-15 15:09:10,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 15:09:10,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 55.0) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-03-15 15:09:10,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:10,922 INFO L225 Difference]: With dead ends: 3815 [2022-03-15 15:09:10,922 INFO L226 Difference]: Without dead ends: 3815 [2022-03-15 15:09:10,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-15 15:09:10,922 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 156 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:10,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 369 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:09:10,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3815 states. [2022-03-15 15:09:10,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3815 to 3815. [2022-03-15 15:09:10,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3815 states, 3780 states have (on average 1.947089947089947) internal successors, (7360), 3814 states have internal predecessors, (7360), 0 states have call successors, (0), 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-03-15 15:09:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3815 states to 3815 states and 7360 transitions. [2022-03-15 15:09:10,997 INFO L78 Accepts]: Start accepts. Automaton has 3815 states and 7360 transitions. Word has length 110 [2022-03-15 15:09:10,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:10,997 INFO L470 AbstractCegarLoop]: Abstraction has 3815 states and 7360 transitions. [2022-03-15 15:09:10,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 55.0) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-03-15 15:09:10,998 INFO L276 IsEmpty]: Start isEmpty. Operand 3815 states and 7360 transitions. [2022-03-15 15:09:10,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-03-15 15:09:10,998 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:10,998 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:10,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 15:09:10,999 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:10,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:10,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1661222507, now seen corresponding path program 1 times [2022-03-15 15:09:10,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:10,999 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024284684] [2022-03-15 15:09:10,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:10,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:11,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:11,091 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:11,091 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024284684] [2022-03-15 15:09:11,091 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024284684] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:11,091 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:11,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:09:11,092 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880496326] [2022-03-15 15:09:11,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:11,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:09:11,092 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:11,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:09:11,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:09:11,093 INFO L87 Difference]: Start difference. First operand 3815 states and 7360 transitions. Second operand has 6 states, 5 states have (on average 28.2) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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-03-15 15:09:11,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:11,191 INFO L93 Difference]: Finished difference Result 3814 states and 7359 transitions. [2022-03-15 15:09:11,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:09:11,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 28.2) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2022-03-15 15:09:11,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:11,197 INFO L225 Difference]: With dead ends: 3814 [2022-03-15 15:09:11,197 INFO L226 Difference]: Without dead ends: 3814 [2022-03-15 15:09:11,198 INFO L932 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-03-15 15:09:11,198 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 3 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:11,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 419 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 15:09:11,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3814 states. [2022-03-15 15:09:11,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3814 to 3814. [2022-03-15 15:09:11,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3814 states, 3780 states have (on average 1.9468253968253968) internal successors, (7359), 3813 states have internal predecessors, (7359), 0 states have call successors, (0), 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-03-15 15:09:11,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3814 states to 3814 states and 7359 transitions. [2022-03-15 15:09:11,250 INFO L78 Accepts]: Start accepts. Automaton has 3814 states and 7359 transitions. Word has length 141 [2022-03-15 15:09:11,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:11,251 INFO L470 AbstractCegarLoop]: Abstraction has 3814 states and 7359 transitions. [2022-03-15 15:09:11,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 28.2) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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-03-15 15:09:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 3814 states and 7359 transitions. [2022-03-15 15:09:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-03-15 15:09:11,252 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:11,252 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:11,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 15:09:11,252 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:11,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:11,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1597179399, now seen corresponding path program 1 times [2022-03-15 15:09:11,253 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:11,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627276651] [2022-03-15 15:09:11,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:11,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:11,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:11,346 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:11,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627276651] [2022-03-15 15:09:11,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627276651] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:11,346 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:11,346 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:09:11,346 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795528724] [2022-03-15 15:09:11,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:11,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:09:11,347 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:11,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:09:11,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:09:11,347 INFO L87 Difference]: Start difference. First operand 3814 states and 7359 transitions. Second operand has 6 states, 5 states have (on average 31.4) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 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-03-15 15:09:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:11,713 INFO L93 Difference]: Finished difference Result 5735 states and 11111 transitions. [2022-03-15 15:09:11,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:09:11,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 31.4) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2022-03-15 15:09:11,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:11,723 INFO L225 Difference]: With dead ends: 5735 [2022-03-15 15:09:11,723 INFO L226 Difference]: Without dead ends: 5735 [2022-03-15 15:09:11,723 INFO L932 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-03-15 15:09:11,723 INFO L933 BasicCegarLoop]: 360 mSDtfsCounter, 205 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:11,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 832 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:09:11,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5735 states. [2022-03-15 15:09:11,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5735 to 3917. [2022-03-15 15:09:11,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3917 states, 3889 states have (on average 1.9444587297505787) internal successors, (7562), 3916 states have internal predecessors, (7562), 0 states have call successors, (0), 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-03-15 15:09:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3917 states to 3917 states and 7562 transitions. [2022-03-15 15:09:11,780 INFO L78 Accepts]: Start accepts. Automaton has 3917 states and 7562 transitions. Word has length 157 [2022-03-15 15:09:11,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:11,780 INFO L470 AbstractCegarLoop]: Abstraction has 3917 states and 7562 transitions. [2022-03-15 15:09:11,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 31.4) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 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-03-15 15:09:11,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3917 states and 7562 transitions. [2022-03-15 15:09:11,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-03-15 15:09:11,782 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:11,782 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:11,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 15:09:11,782 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:11,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:11,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2099699453, now seen corresponding path program 1 times [2022-03-15 15:09:11,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:11,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204993797] [2022-03-15 15:09:11,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:11,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:11,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:11,867 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:11,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204993797] [2022-03-15 15:09:11,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204993797] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:11,867 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:11,867 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:09:11,868 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946584863] [2022-03-15 15:09:11,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:11,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:09:11,868 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:11,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:09:11,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:09:11,868 INFO L87 Difference]: Start difference. First operand 3917 states and 7562 transitions. Second operand has 6 states, 5 states have (on average 32.6) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 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-03-15 15:09:12,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:12,118 INFO L93 Difference]: Finished difference Result 3863 states and 7455 transitions. [2022-03-15 15:09:12,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:09:12,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 32.6) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2022-03-15 15:09:12,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:12,124 INFO L225 Difference]: With dead ends: 3863 [2022-03-15 15:09:12,124 INFO L226 Difference]: Without dead ends: 3863 [2022-03-15 15:09:12,124 INFO L932 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-03-15 15:09:12,124 INFO L933 BasicCegarLoop]: 378 mSDtfsCounter, 160 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:12,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 788 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:09:12,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3863 states. [2022-03-15 15:09:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3863 to 3863. [2022-03-15 15:09:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3863 states, 3839 states have (on average 1.9419119562386038) internal successors, (7455), 3862 states have internal predecessors, (7455), 0 states have call successors, (0), 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-03-15 15:09:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3863 states to 3863 states and 7455 transitions. [2022-03-15 15:09:12,168 INFO L78 Accepts]: Start accepts. Automaton has 3863 states and 7455 transitions. Word has length 163 [2022-03-15 15:09:12,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:12,168 INFO L470 AbstractCegarLoop]: Abstraction has 3863 states and 7455 transitions. [2022-03-15 15:09:12,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.6) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 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-03-15 15:09:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3863 states and 7455 transitions. [2022-03-15 15:09:12,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-03-15 15:09:12,169 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:12,169 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:12,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 15:09:12,169 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:12,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:12,170 INFO L85 PathProgramCache]: Analyzing trace with hash 449131661, now seen corresponding path program 1 times [2022-03-15 15:09:12,170 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:12,170 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934327629] [2022-03-15 15:09:12,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:12,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:12,259 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:12,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934327629] [2022-03-15 15:09:12,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934327629] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:12,260 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:12,260 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:09:12,260 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496487534] [2022-03-15 15:09:12,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:12,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:09:12,260 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:12,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:09:12,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:09:12,261 INFO L87 Difference]: Start difference. First operand 3863 states and 7455 transitions. Second operand has 6 states, 5 states have (on average 33.4) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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-03-15 15:09:12,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:12,562 INFO L93 Difference]: Finished difference Result 5144 states and 9941 transitions. [2022-03-15 15:09:12,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:09:12,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 33.4) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2022-03-15 15:09:12,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:12,571 INFO L225 Difference]: With dead ends: 5144 [2022-03-15 15:09:12,571 INFO L226 Difference]: Without dead ends: 5064 [2022-03-15 15:09:12,571 INFO L932 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-03-15 15:09:12,572 INFO L933 BasicCegarLoop]: 374 mSDtfsCounter, 221 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:12,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 655 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:09:12,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5064 states. [2022-03-15 15:09:12,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5064 to 4109. [2022-03-15 15:09:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4109 states, 4085 states have (on average 1.9414932680538555) internal successors, (7931), 4108 states have internal predecessors, (7931), 0 states have call successors, (0), 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-03-15 15:09:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4109 states to 4109 states and 7931 transitions. [2022-03-15 15:09:12,631 INFO L78 Accepts]: Start accepts. Automaton has 4109 states and 7931 transitions. Word has length 167 [2022-03-15 15:09:12,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:12,631 INFO L470 AbstractCegarLoop]: Abstraction has 4109 states and 7931 transitions. [2022-03-15 15:09:12,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.4) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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-03-15 15:09:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 4109 states and 7931 transitions. [2022-03-15 15:09:12,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-03-15 15:09:12,632 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:12,632 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:12,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 15:09:12,632 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:12,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:12,633 INFO L85 PathProgramCache]: Analyzing trace with hash 544060034, now seen corresponding path program 1 times [2022-03-15 15:09:12,633 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:12,633 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807955077] [2022-03-15 15:09:12,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:12,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:12,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:12,721 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:12,721 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807955077] [2022-03-15 15:09:12,721 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807955077] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:12,721 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:12,721 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:09:12,721 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088620702] [2022-03-15 15:09:12,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:12,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:09:12,722 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:12,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:09:12,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:09:12,722 INFO L87 Difference]: Start difference. First operand 4109 states and 7931 transitions. Second operand has 6 states, 5 states have (on average 34.2) internal successors, (171), 6 states have internal predecessors, (171), 0 states have call successors, (0), 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-03-15 15:09:12,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:12,929 INFO L93 Difference]: Finished difference Result 4342 states and 8392 transitions. [2022-03-15 15:09:12,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:09:12,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 34.2) internal successors, (171), 6 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2022-03-15 15:09:12,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:12,937 INFO L225 Difference]: With dead ends: 4342 [2022-03-15 15:09:12,937 INFO L226 Difference]: Without dead ends: 4342 [2022-03-15 15:09:12,937 INFO L932 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-03-15 15:09:12,938 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 154 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:12,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 687 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:09:12,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4342 states. [2022-03-15 15:09:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4342 to 4286. [2022-03-15 15:09:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4286 states, 4262 states have (on average 1.9429845143125293) internal successors, (8281), 4285 states have internal predecessors, (8281), 0 states have call successors, (0), 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-03-15 15:09:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 8281 transitions. [2022-03-15 15:09:13,025 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 8281 transitions. Word has length 171 [2022-03-15 15:09:13,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:13,025 INFO L470 AbstractCegarLoop]: Abstraction has 4286 states and 8281 transitions. [2022-03-15 15:09:13,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 34.2) internal successors, (171), 6 states have internal predecessors, (171), 0 states have call successors, (0), 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-03-15 15:09:13,025 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 8281 transitions. [2022-03-15 15:09:13,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-03-15 15:09:13,027 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:13,027 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:13,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 15:09:13,027 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:13,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:13,028 INFO L85 PathProgramCache]: Analyzing trace with hash 654097040, now seen corresponding path program 1 times [2022-03-15 15:09:13,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:13,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260181919] [2022-03-15 15:09:13,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:13,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:13,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:13,116 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:13,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260181919] [2022-03-15 15:09:13,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260181919] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:13,117 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:13,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:09:13,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758860904] [2022-03-15 15:09:13,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:13,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:09:13,117 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:13,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:09:13,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:09:13,117 INFO L87 Difference]: Start difference. First operand 4286 states and 8281 transitions. Second operand has 6 states, 5 states have (on average 35.8) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 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-03-15 15:09:13,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:13,610 INFO L93 Difference]: Finished difference Result 4766 states and 9176 transitions. [2022-03-15 15:09:13,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:09:13,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 35.8) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 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 179 [2022-03-15 15:09:13,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:13,618 INFO L225 Difference]: With dead ends: 4766 [2022-03-15 15:09:13,618 INFO L226 Difference]: Without dead ends: 4502 [2022-03-15 15:09:13,619 INFO L932 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-03-15 15:09:13,619 INFO L933 BasicCegarLoop]: 415 mSDtfsCounter, 287 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:13,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 1158 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 15:09:13,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4502 states. [2022-03-15 15:09:13,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4502 to 4055. [2022-03-15 15:09:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4055 states, 4036 states have (on average 1.929633300297324) internal successors, (7788), 4054 states have internal predecessors, (7788), 0 states have call successors, (0), 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-03-15 15:09:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4055 states to 4055 states and 7788 transitions. [2022-03-15 15:09:13,698 INFO L78 Accepts]: Start accepts. Automaton has 4055 states and 7788 transitions. Word has length 179 [2022-03-15 15:09:13,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:13,699 INFO L470 AbstractCegarLoop]: Abstraction has 4055 states and 7788 transitions. [2022-03-15 15:09:13,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 35.8) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 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-03-15 15:09:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand 4055 states and 7788 transitions. [2022-03-15 15:09:13,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-03-15 15:09:13,701 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:13,701 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:13,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 15:09:13,701 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:13,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:13,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1572605453, now seen corresponding path program 1 times [2022-03-15 15:09:13,701 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:13,702 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721998621] [2022-03-15 15:09:13,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:13,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:13,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:13,767 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:13,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721998621] [2022-03-15 15:09:13,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721998621] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:13,767 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:13,768 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 15:09:13,768 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104875476] [2022-03-15 15:09:13,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:13,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 15:09:13,768 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:13,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 15:09:13,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 15:09:13,769 INFO L87 Difference]: Start difference. First operand 4055 states and 7788 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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-03-15 15:09:13,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:13,789 INFO L93 Difference]: Finished difference Result 3270 states and 6142 transitions. [2022-03-15 15:09:13,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 15:09:13,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 179 [2022-03-15 15:09:13,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:13,794 INFO L225 Difference]: With dead ends: 3270 [2022-03-15 15:09:13,794 INFO L226 Difference]: Without dead ends: 3270 [2022-03-15 15:09:13,794 INFO L932 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-03-15 15:09:13,795 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 99 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:13,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 548 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:09:13,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2022-03-15 15:09:13,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3074. [2022-03-15 15:09:13,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3074 states, 3059 states have (on average 1.888852566198104) internal successors, (5778), 3073 states have internal predecessors, (5778), 0 states have call successors, (0), 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-03-15 15:09:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 5778 transitions. [2022-03-15 15:09:13,834 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 5778 transitions. Word has length 179 [2022-03-15 15:09:13,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:13,835 INFO L470 AbstractCegarLoop]: Abstraction has 3074 states and 5778 transitions. [2022-03-15 15:09:13,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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-03-15 15:09:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 5778 transitions. [2022-03-15 15:09:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-03-15 15:09:13,836 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:13,837 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:13,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-15 15:09:13,837 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:13,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:13,837 INFO L85 PathProgramCache]: Analyzing trace with hash 859331813, now seen corresponding path program 1 times [2022-03-15 15:09:13,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:13,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586992081] [2022-03-15 15:09:13,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:13,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:13,964 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:13,964 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586992081] [2022-03-15 15:09:13,964 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586992081] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:13,964 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:13,964 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:09:13,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204397191] [2022-03-15 15:09:13,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:13,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:09:13,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:13,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:09:13,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:09:13,965 INFO L87 Difference]: Start difference. First operand 3074 states and 5778 transitions. Second operand has 6 states, 5 states have (on average 38.4) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 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-03-15 15:09:14,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:14,247 INFO L93 Difference]: Finished difference Result 3017 states and 5666 transitions. [2022-03-15 15:09:14,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:09:14,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 38.4) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 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 192 [2022-03-15 15:09:14,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:14,252 INFO L225 Difference]: With dead ends: 3017 [2022-03-15 15:09:14,253 INFO L226 Difference]: Without dead ends: 3017 [2022-03-15 15:09:14,253 INFO L932 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-03-15 15:09:14,253 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 148 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:14,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 976 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:09:14,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2022-03-15 15:09:14,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 3017. [2022-03-15 15:09:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3017 states, 3005 states have (on average 1.8855241264559068) internal successors, (5666), 3016 states have internal predecessors, (5666), 0 states have call successors, (0), 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-03-15 15:09:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 5666 transitions. [2022-03-15 15:09:14,288 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 5666 transitions. Word has length 192 [2022-03-15 15:09:14,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:14,288 INFO L470 AbstractCegarLoop]: Abstraction has 3017 states and 5666 transitions. [2022-03-15 15:09:14,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 38.4) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 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-03-15 15:09:14,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 5666 transitions. [2022-03-15 15:09:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-03-15 15:09:14,290 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:14,291 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:14,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-15 15:09:14,291 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:14,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:14,291 INFO L85 PathProgramCache]: Analyzing trace with hash 247325162, now seen corresponding path program 1 times [2022-03-15 15:09:14,291 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:14,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220220419] [2022-03-15 15:09:14,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:14,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:14,876 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:14,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220220419] [2022-03-15 15:09:14,876 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220220419] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:14,876 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:14,876 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-03-15 15:09:14,876 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146142280] [2022-03-15 15:09:14,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:14,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 15:09:14,876 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:14,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 15:09:14,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-03-15 15:09:14,877 INFO L87 Difference]: Start difference. First operand 3017 states and 5666 transitions. Second operand has 20 states, 19 states have (on average 10.526315789473685) internal successors, (200), 20 states have internal predecessors, (200), 0 states have call successors, (0), 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-03-15 15:09:16,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:16,306 INFO L93 Difference]: Finished difference Result 4046 states and 7656 transitions. [2022-03-15 15:09:16,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 15:09:16,307 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 10.526315789473685) internal successors, (200), 20 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2022-03-15 15:09:16,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:16,312 INFO L225 Difference]: With dead ends: 4046 [2022-03-15 15:09:16,312 INFO L226 Difference]: Without dead ends: 4046 [2022-03-15 15:09:16,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=295, Invalid=1427, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 15:09:16,313 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 1427 mSDsluCounter, 2171 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 2423 SdHoareTripleChecker+Invalid, 2299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:16,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1427 Valid, 2423 Invalid, 2299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 1866 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 15:09:16,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4046 states. [2022-03-15 15:09:16,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4046 to 3036. [2022-03-15 15:09:16,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3036 states, 3024 states have (on average 1.8862433862433863) internal successors, (5704), 3035 states have internal predecessors, (5704), 0 states have call successors, (0), 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-03-15 15:09:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 5704 transitions. [2022-03-15 15:09:16,351 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 5704 transitions. Word has length 200 [2022-03-15 15:09:16,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:16,351 INFO L470 AbstractCegarLoop]: Abstraction has 3036 states and 5704 transitions. [2022-03-15 15:09:16,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 10.526315789473685) internal successors, (200), 20 states have internal predecessors, (200), 0 states have call successors, (0), 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-03-15 15:09:16,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 5704 transitions. [2022-03-15 15:09:16,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-03-15 15:09:16,353 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:16,354 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:16,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-15 15:09:16,354 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:16,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:16,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2112059964, now seen corresponding path program 2 times [2022-03-15 15:09:16,354 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:16,354 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878049414] [2022-03-15 15:09:16,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:16,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:16,853 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:16,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878049414] [2022-03-15 15:09:16,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878049414] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:16,853 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:16,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-03-15 15:09:16,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320113010] [2022-03-15 15:09:16,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:16,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 15:09:16,854 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:16,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 15:09:16,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-03-15 15:09:16,854 INFO L87 Difference]: Start difference. First operand 3036 states and 5704 transitions. Second operand has 20 states, 19 states have (on average 10.526315789473685) internal successors, (200), 20 states have internal predecessors, (200), 0 states have call successors, (0), 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-03-15 15:09:18,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:18,366 INFO L93 Difference]: Finished difference Result 4129 states and 7822 transitions. [2022-03-15 15:09:18,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 15:09:18,369 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 10.526315789473685) internal successors, (200), 20 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2022-03-15 15:09:18,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:18,379 INFO L225 Difference]: With dead ends: 4129 [2022-03-15 15:09:18,379 INFO L226 Difference]: Without dead ends: 4129 [2022-03-15 15:09:18,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=327, Invalid=1653, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 15:09:18,380 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 1466 mSDsluCounter, 2166 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 500 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 2420 SdHoareTripleChecker+Invalid, 2498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 500 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:18,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1466 Valid, 2420 Invalid, 2498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [500 Valid, 1998 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 15:09:18,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2022-03-15 15:09:18,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3059. [2022-03-15 15:09:18,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3059 states, 3047 states have (on average 1.8871020676074828) internal successors, (5750), 3058 states have internal predecessors, (5750), 0 states have call successors, (0), 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-03-15 15:09:18,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 5750 transitions. [2022-03-15 15:09:18,419 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 5750 transitions. Word has length 200 [2022-03-15 15:09:18,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:18,419 INFO L470 AbstractCegarLoop]: Abstraction has 3059 states and 5750 transitions. [2022-03-15 15:09:18,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 10.526315789473685) internal successors, (200), 20 states have internal predecessors, (200), 0 states have call successors, (0), 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-03-15 15:09:18,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 5750 transitions. [2022-03-15 15:09:18,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-03-15 15:09:18,421 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:18,421 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:18,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-15 15:09:18,422 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:18,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:18,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1483591062, now seen corresponding path program 3 times [2022-03-15 15:09:18,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:18,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916720099] [2022-03-15 15:09:18,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:18,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:19,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:19,332 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:19,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916720099] [2022-03-15 15:09:19,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916720099] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:19,332 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:19,332 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-03-15 15:09:19,332 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787222732] [2022-03-15 15:09:19,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:19,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 15:09:19,332 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:19,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 15:09:19,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:09:19,333 INFO L87 Difference]: Start difference. First operand 3059 states and 5750 transitions. Second operand has 23 states, 22 states have (on average 9.090909090909092) internal successors, (200), 23 states have internal predecessors, (200), 0 states have call successors, (0), 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-03-15 15:09:21,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:21,542 INFO L93 Difference]: Finished difference Result 4567 states and 8691 transitions. [2022-03-15 15:09:21,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 15:09:21,542 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 9.090909090909092) internal successors, (200), 23 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2022-03-15 15:09:21,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:21,552 INFO L225 Difference]: With dead ends: 4567 [2022-03-15 15:09:21,552 INFO L226 Difference]: Without dead ends: 4567 [2022-03-15 15:09:21,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=517, Invalid=2345, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 15:09:21,553 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 1526 mSDsluCounter, 2427 mSDsCounter, 0 mSdLazyCounter, 2154 mSolverCounterSat, 576 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 2675 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 576 IncrementalHoareTripleChecker+Valid, 2154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:21,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1526 Valid, 2675 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [576 Valid, 2154 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 15:09:21,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4567 states. [2022-03-15 15:09:21,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4567 to 3083. [2022-03-15 15:09:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3083 states, 3071 states have (on average 1.8883099967437318) internal successors, (5799), 3082 states have internal predecessors, (5799), 0 states have call successors, (0), 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-03-15 15:09:21,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 3083 states and 5799 transitions. [2022-03-15 15:09:21,607 INFO L78 Accepts]: Start accepts. Automaton has 3083 states and 5799 transitions. Word has length 200 [2022-03-15 15:09:21,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:21,608 INFO L470 AbstractCegarLoop]: Abstraction has 3083 states and 5799 transitions. [2022-03-15 15:09:21,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 9.090909090909092) internal successors, (200), 23 states have internal predecessors, (200), 0 states have call successors, (0), 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-03-15 15:09:21,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 5799 transitions. [2022-03-15 15:09:21,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-03-15 15:09:21,610 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:21,610 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:21,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-15 15:09:21,610 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:21,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:21,611 INFO L85 PathProgramCache]: Analyzing trace with hash -537915958, now seen corresponding path program 4 times [2022-03-15 15:09:21,611 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:21,611 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205623504] [2022-03-15 15:09:21,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:21,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:22,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:22,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:22,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205623504] [2022-03-15 15:09:22,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205623504] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:22,074 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:22,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-03-15 15:09:22,074 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272075956] [2022-03-15 15:09:22,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:22,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 15:09:22,074 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:22,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 15:09:22,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-03-15 15:09:22,075 INFO L87 Difference]: Start difference. First operand 3083 states and 5799 transitions. Second operand has 22 states, 21 states have (on average 9.523809523809524) internal successors, (200), 22 states have internal predecessors, (200), 0 states have call successors, (0), 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-03-15 15:09:24,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:24,335 INFO L93 Difference]: Finished difference Result 4559 states and 8657 transitions. [2022-03-15 15:09:24,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 15:09:24,335 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.523809523809524) internal successors, (200), 22 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2022-03-15 15:09:24,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:24,341 INFO L225 Difference]: With dead ends: 4559 [2022-03-15 15:09:24,341 INFO L226 Difference]: Without dead ends: 4559 [2022-03-15 15:09:24,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=523, Invalid=2447, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 15:09:24,342 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 1320 mSDsluCounter, 3285 mSDsCounter, 0 mSdLazyCounter, 3059 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 3535 SdHoareTripleChecker+Invalid, 3719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 3059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:24,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1320 Valid, 3535 Invalid, 3719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 3059 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 15:09:24,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4559 states. [2022-03-15 15:09:24,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4559 to 3107. [2022-03-15 15:09:24,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3107 states, 3095 states have (on average 1.8894991922455573) internal successors, (5848), 3106 states have internal predecessors, (5848), 0 states have call successors, (0), 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-03-15 15:09:24,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3107 states to 3107 states and 5848 transitions. [2022-03-15 15:09:24,380 INFO L78 Accepts]: Start accepts. Automaton has 3107 states and 5848 transitions. Word has length 200 [2022-03-15 15:09:24,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:24,381 INFO L470 AbstractCegarLoop]: Abstraction has 3107 states and 5848 transitions. [2022-03-15 15:09:24,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.523809523809524) internal successors, (200), 22 states have internal predecessors, (200), 0 states have call successors, (0), 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-03-15 15:09:24,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3107 states and 5848 transitions. [2022-03-15 15:09:24,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-03-15 15:09:24,383 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:24,383 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:24,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-15 15:09:24,383 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:24,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:24,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1859248506, now seen corresponding path program 5 times [2022-03-15 15:09:24,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:24,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473538383] [2022-03-15 15:09:24,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:24,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:24,849 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:24,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473538383] [2022-03-15 15:09:24,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473538383] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:24,849 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:24,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-03-15 15:09:24,849 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787817670] [2022-03-15 15:09:24,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:24,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 15:09:24,849 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:24,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 15:09:24,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-03-15 15:09:24,850 INFO L87 Difference]: Start difference. First operand 3107 states and 5848 transitions. Second operand has 22 states, 21 states have (on average 9.523809523809524) internal successors, (200), 22 states have internal predecessors, (200), 0 states have call successors, (0), 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-03-15 15:09:26,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:26,370 INFO L93 Difference]: Finished difference Result 3564 states and 6712 transitions. [2022-03-15 15:09:26,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 15:09:26,375 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.523809523809524) internal successors, (200), 22 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2022-03-15 15:09:26,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:26,379 INFO L225 Difference]: With dead ends: 3564 [2022-03-15 15:09:26,379 INFO L226 Difference]: Without dead ends: 3564 [2022-03-15 15:09:26,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=512, Invalid=2244, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 15:09:26,381 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 1582 mSDsluCounter, 2053 mSDsCounter, 0 mSdLazyCounter, 2055 mSolverCounterSat, 499 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1582 SdHoareTripleChecker+Valid, 2282 SdHoareTripleChecker+Invalid, 2554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 499 IncrementalHoareTripleChecker+Valid, 2055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:26,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1582 Valid, 2282 Invalid, 2554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [499 Valid, 2055 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 15:09:26,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2022-03-15 15:09:26,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 2990. [2022-03-15 15:09:26,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2990 states, 2979 states have (on average 1.8848606915072172) internal successors, (5615), 2989 states have internal predecessors, (5615), 0 states have call successors, (0), 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-03-15 15:09:26,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 5615 transitions. [2022-03-15 15:09:26,413 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 5615 transitions. Word has length 200 [2022-03-15 15:09:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:26,413 INFO L470 AbstractCegarLoop]: Abstraction has 2990 states and 5615 transitions. [2022-03-15 15:09:26,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.523809523809524) internal successors, (200), 22 states have internal predecessors, (200), 0 states have call successors, (0), 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-03-15 15:09:26,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 5615 transitions. [2022-03-15 15:09:26,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-03-15 15:09:26,416 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:26,416 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:26,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-15 15:09:26,416 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:26,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:26,417 INFO L85 PathProgramCache]: Analyzing trace with hash 34158403, now seen corresponding path program 1 times [2022-03-15 15:09:26,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:26,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524284667] [2022-03-15 15:09:26,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:26,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:26,811 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:26,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524284667] [2022-03-15 15:09:26,811 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524284667] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:26,811 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:26,811 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-03-15 15:09:26,811 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744091910] [2022-03-15 15:09:26,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:26,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 15:09:26,811 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:26,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 15:09:26,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:09:26,812 INFO L87 Difference]: Start difference. First operand 2990 states and 5615 transitions. Second operand has 19 states, 18 states have (on average 11.11111111111111) internal successors, (200), 19 states have internal predecessors, (200), 0 states have call successors, (0), 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-03-15 15:09:27,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:27,837 INFO L93 Difference]: Finished difference Result 2998 states and 5627 transitions. [2022-03-15 15:09:27,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 15:09:27,837 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 11.11111111111111) internal successors, (200), 19 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2022-03-15 15:09:27,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:27,840 INFO L225 Difference]: With dead ends: 2998 [2022-03-15 15:09:27,840 INFO L226 Difference]: Without dead ends: 2998 [2022-03-15 15:09:27,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=323, Invalid=1657, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 15:09:27,841 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 1144 mSDsluCounter, 2466 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 2746 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:27,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1144 Valid, 2746 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1703 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 15:09:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2022-03-15 15:09:27,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2945. [2022-03-15 15:09:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2945 states, 2934 states have (on average 1.882072256305385) internal successors, (5522), 2944 states have internal predecessors, (5522), 0 states have call successors, (0), 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-03-15 15:09:27,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 5522 transitions. [2022-03-15 15:09:27,868 INFO L78 Accepts]: Start accepts. Automaton has 2945 states and 5522 transitions. Word has length 200 [2022-03-15 15:09:27,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:27,868 INFO L470 AbstractCegarLoop]: Abstraction has 2945 states and 5522 transitions. [2022-03-15 15:09:27,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 11.11111111111111) internal successors, (200), 19 states have internal predecessors, (200), 0 states have call successors, (0), 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-03-15 15:09:27,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2945 states and 5522 transitions. [2022-03-15 15:09:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-03-15 15:09:27,870 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:27,871 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:27,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-15 15:09:27,871 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:27,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:27,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1838917866, now seen corresponding path program 1 times [2022-03-15 15:09:27,871 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:27,871 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547410709] [2022-03-15 15:09:27,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:27,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:27,949 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:27,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547410709] [2022-03-15 15:09:27,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547410709] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:27,949 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:27,949 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:09:27,949 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69928331] [2022-03-15 15:09:27,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:27,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:09:27,950 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:27,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:09:27,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:09:27,950 INFO L87 Difference]: Start difference. First operand 2945 states and 5522 transitions. Second operand has 6 states, 5 states have (on average 40.0) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 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-03-15 15:09:28,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:28,211 INFO L93 Difference]: Finished difference Result 3137 states and 5871 transitions. [2022-03-15 15:09:28,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:09:28,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 40.0) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2022-03-15 15:09:28,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:28,214 INFO L225 Difference]: With dead ends: 3137 [2022-03-15 15:09:28,214 INFO L226 Difference]: Without dead ends: 2651 [2022-03-15 15:09:28,214 INFO L932 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-03-15 15:09:28,215 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 153 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:28,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 846 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:09:28,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2651 states. [2022-03-15 15:09:28,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2651 to 2635. [2022-03-15 15:09:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2624 states have (on average 1.8467987804878048) internal successors, (4846), 2634 states have internal predecessors, (4846), 0 states have call successors, (0), 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-03-15 15:09:28,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 4846 transitions. [2022-03-15 15:09:28,249 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 4846 transitions. Word has length 200 [2022-03-15 15:09:28,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:28,249 INFO L470 AbstractCegarLoop]: Abstraction has 2635 states and 4846 transitions. [2022-03-15 15:09:28,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 40.0) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 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-03-15 15:09:28,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 4846 transitions. [2022-03-15 15:09:28,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-03-15 15:09:28,251 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:28,252 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:28,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-15 15:09:28,252 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:28,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:28,252 INFO L85 PathProgramCache]: Analyzing trace with hash -979472995, now seen corresponding path program 1 times [2022-03-15 15:09:28,252 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:28,252 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921601694] [2022-03-15 15:09:28,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:28,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:28,714 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:28,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921601694] [2022-03-15 15:09:28,714 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921601694] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:28,714 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:28,714 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-03-15 15:09:28,714 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993511140] [2022-03-15 15:09:28,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:28,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 15:09:28,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:28,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 15:09:28,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2022-03-15 15:09:28,715 INFO L87 Difference]: Start difference. First operand 2635 states and 4846 transitions. Second operand has 20 states, 19 states have (on average 10.789473684210526) internal successors, (205), 20 states have internal predecessors, (205), 0 states have call successors, (0), 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-03-15 15:09:29,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:29,954 INFO L93 Difference]: Finished difference Result 3393 states and 6256 transitions. [2022-03-15 15:09:29,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 15:09:29,955 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 10.789473684210526) internal successors, (205), 20 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2022-03-15 15:09:29,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:29,958 INFO L225 Difference]: With dead ends: 3393 [2022-03-15 15:09:29,959 INFO L226 Difference]: Without dead ends: 3393 [2022-03-15 15:09:29,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=299, Invalid=1507, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 15:09:29,959 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 1265 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 1881 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 2176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 1881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:29,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1265 Valid, 2411 Invalid, 2176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 1881 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 15:09:29,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3393 states. [2022-03-15 15:09:29,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3393 to 2653. [2022-03-15 15:09:29,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2653 states, 2642 states have (on average 1.8478425435276307) internal successors, (4882), 2652 states have internal predecessors, (4882), 0 states have call successors, (0), 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-03-15 15:09:30,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 4882 transitions. [2022-03-15 15:09:30,018 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 4882 transitions. Word has length 205 [2022-03-15 15:09:30,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:30,018 INFO L470 AbstractCegarLoop]: Abstraction has 2653 states and 4882 transitions. [2022-03-15 15:09:30,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 10.789473684210526) internal successors, (205), 20 states have internal predecessors, (205), 0 states have call successors, (0), 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-03-15 15:09:30,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 4882 transitions. [2022-03-15 15:09:30,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-03-15 15:09:30,021 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:30,021 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:30,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-15 15:09:30,021 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:30,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:30,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1289205875, now seen corresponding path program 2 times [2022-03-15 15:09:30,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:30,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729570460] [2022-03-15 15:09:30,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:30,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:31,088 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:31,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729570460] [2022-03-15 15:09:31,088 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729570460] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:31,088 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:31,088 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-03-15 15:09:31,089 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145117400] [2022-03-15 15:09:31,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:31,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 15:09:31,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:31,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 15:09:31,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2022-03-15 15:09:31,090 INFO L87 Difference]: Start difference. First operand 2653 states and 4882 transitions. Second operand has 24 states, 23 states have (on average 8.91304347826087) internal successors, (205), 24 states have internal predecessors, (205), 0 states have call successors, (0), 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-03-15 15:09:33,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:33,230 INFO L93 Difference]: Finished difference Result 3424 states and 6339 transitions. [2022-03-15 15:09:33,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 15:09:33,230 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 8.91304347826087) internal successors, (205), 24 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2022-03-15 15:09:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:33,234 INFO L225 Difference]: With dead ends: 3424 [2022-03-15 15:09:33,234 INFO L226 Difference]: Without dead ends: 3424 [2022-03-15 15:09:33,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=434, Invalid=2218, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 15:09:33,235 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 1165 mSDsluCounter, 3102 mSDsCounter, 0 mSdLazyCounter, 2503 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1165 SdHoareTripleChecker+Valid, 3343 SdHoareTripleChecker+Invalid, 2899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 2503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:33,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1165 Valid, 3343 Invalid, 2899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 2503 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 15:09:33,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3424 states. [2022-03-15 15:09:33,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3424 to 2673. [2022-03-15 15:09:33,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2662 states have (on average 1.8489857250187829) internal successors, (4922), 2672 states have internal predecessors, (4922), 0 states have call successors, (0), 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-03-15 15:09:33,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 4922 transitions. [2022-03-15 15:09:33,263 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 4922 transitions. Word has length 205 [2022-03-15 15:09:33,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:33,263 INFO L470 AbstractCegarLoop]: Abstraction has 2673 states and 4922 transitions. [2022-03-15 15:09:33,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 8.91304347826087) internal successors, (205), 24 states have internal predecessors, (205), 0 states have call successors, (0), 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-03-15 15:09:33,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 4922 transitions. [2022-03-15 15:09:33,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-03-15 15:09:33,265 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:33,265 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:33,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-15 15:09:33,266 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:33,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:33,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1265094627, now seen corresponding path program 3 times [2022-03-15 15:09:33,266 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:33,266 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028521029] [2022-03-15 15:09:33,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:33,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:33,711 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:33,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028521029] [2022-03-15 15:09:33,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028521029] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:33,711 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:33,711 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-03-15 15:09:33,711 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20020052] [2022-03-15 15:09:33,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:33,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 15:09:33,712 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:33,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 15:09:33,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-03-15 15:09:33,713 INFO L87 Difference]: Start difference. First operand 2673 states and 4922 transitions. Second operand has 20 states, 19 states have (on average 10.789473684210526) internal successors, (205), 20 states have internal predecessors, (205), 0 states have call successors, (0), 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-03-15 15:09:35,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:35,215 INFO L93 Difference]: Finished difference Result 3441 states and 6352 transitions. [2022-03-15 15:09:35,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 15:09:35,216 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 10.789473684210526) internal successors, (205), 20 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2022-03-15 15:09:35,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:35,219 INFO L225 Difference]: With dead ends: 3441 [2022-03-15 15:09:35,219 INFO L226 Difference]: Without dead ends: 3441 [2022-03-15 15:09:35,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=350, Invalid=1720, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 15:09:35,220 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 1138 mSDsluCounter, 2817 mSDsCounter, 0 mSdLazyCounter, 2487 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 3079 SdHoareTripleChecker+Invalid, 2756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:35,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1138 Valid, 3079 Invalid, 2756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2487 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 15:09:35,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3441 states. [2022-03-15 15:09:35,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3441 to 2671. [2022-03-15 15:09:35,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2671 states, 2660 states have (on average 1.848872180451128) internal successors, (4918), 2670 states have internal predecessors, (4918), 0 states have call successors, (0), 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-03-15 15:09:35,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 4918 transitions. [2022-03-15 15:09:35,247 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 4918 transitions. Word has length 205 [2022-03-15 15:09:35,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:35,247 INFO L470 AbstractCegarLoop]: Abstraction has 2671 states and 4918 transitions. [2022-03-15 15:09:35,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 10.789473684210526) internal successors, (205), 20 states have internal predecessors, (205), 0 states have call successors, (0), 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-03-15 15:09:35,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 4918 transitions. [2022-03-15 15:09:35,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-03-15 15:09:35,249 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:35,249 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:35,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-15 15:09:35,249 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:35,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:35,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1042183327, now seen corresponding path program 4 times [2022-03-15 15:09:35,250 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:35,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890466586] [2022-03-15 15:09:35,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:35,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:35,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:35,750 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890466586] [2022-03-15 15:09:35,750 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890466586] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:35,750 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:35,750 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-03-15 15:09:35,750 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341022753] [2022-03-15 15:09:35,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:35,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 15:09:35,751 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:35,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 15:09:35,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2022-03-15 15:09:35,752 INFO L87 Difference]: Start difference. First operand 2671 states and 4918 transitions. Second operand has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 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-03-15 15:09:37,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:37,555 INFO L93 Difference]: Finished difference Result 3854 states and 7151 transitions. [2022-03-15 15:09:37,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 15:09:37,555 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2022-03-15 15:09:37,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:37,559 INFO L225 Difference]: With dead ends: 3854 [2022-03-15 15:09:37,559 INFO L226 Difference]: Without dead ends: 3854 [2022-03-15 15:09:37,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=480, Invalid=2172, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 15:09:37,560 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 1157 mSDsluCounter, 2766 mSDsCounter, 0 mSdLazyCounter, 2600 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 3015 SdHoareTripleChecker+Invalid, 3062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 2600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:37,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1157 Valid, 3015 Invalid, 3062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 2600 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 15:09:37,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3854 states. [2022-03-15 15:09:37,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3854 to 2711. [2022-03-15 15:09:37,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2700 states have (on average 1.8511111111111112) internal successors, (4998), 2710 states have internal predecessors, (4998), 0 states have call successors, (0), 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-03-15 15:09:37,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 4998 transitions. [2022-03-15 15:09:37,604 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 4998 transitions. Word has length 205 [2022-03-15 15:09:37,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:37,604 INFO L470 AbstractCegarLoop]: Abstraction has 2711 states and 4998 transitions. [2022-03-15 15:09:37,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 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-03-15 15:09:37,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 4998 transitions. [2022-03-15 15:09:37,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-03-15 15:09:37,608 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:37,608 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:37,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-15 15:09:37,608 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:37,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:37,609 INFO L85 PathProgramCache]: Analyzing trace with hash -106384083, now seen corresponding path program 5 times [2022-03-15 15:09:37,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:37,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491656244] [2022-03-15 15:09:37,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:37,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:38,050 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:38,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491656244] [2022-03-15 15:09:38,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491656244] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:38,050 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:38,050 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-03-15 15:09:38,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489709185] [2022-03-15 15:09:38,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:38,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 15:09:38,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:38,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 15:09:38,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2022-03-15 15:09:38,051 INFO L87 Difference]: Start difference. First operand 2711 states and 4998 transitions. Second operand has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 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-03-15 15:09:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:39,933 INFO L93 Difference]: Finished difference Result 3857 states and 7157 transitions. [2022-03-15 15:09:39,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 15:09:39,933 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2022-03-15 15:09:39,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:39,937 INFO L225 Difference]: With dead ends: 3857 [2022-03-15 15:09:39,937 INFO L226 Difference]: Without dead ends: 3857 [2022-03-15 15:09:39,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=555, Invalid=2415, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 15:09:39,938 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 1502 mSDsluCounter, 2535 mSDsCounter, 0 mSdLazyCounter, 2271 mSolverCounterSat, 575 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 2802 SdHoareTripleChecker+Invalid, 2846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 575 IncrementalHoareTripleChecker+Valid, 2271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:39,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1502 Valid, 2802 Invalid, 2846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [575 Valid, 2271 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 15:09:39,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3857 states. [2022-03-15 15:09:39,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3857 to 2691. [2022-03-15 15:09:39,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2691 states, 2680 states have (on average 1.85) internal successors, (4958), 2690 states have internal predecessors, (4958), 0 states have call successors, (0), 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-03-15 15:09:39,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 4958 transitions. [2022-03-15 15:09:39,964 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 4958 transitions. Word has length 205 [2022-03-15 15:09:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:39,964 INFO L470 AbstractCegarLoop]: Abstraction has 2691 states and 4958 transitions. [2022-03-15 15:09:39,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 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-03-15 15:09:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 4958 transitions. [2022-03-15 15:09:39,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-03-15 15:09:39,966 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:39,966 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:39,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-15 15:09:39,966 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:39,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:39,967 INFO L85 PathProgramCache]: Analyzing trace with hash 337813469, now seen corresponding path program 6 times [2022-03-15 15:09:39,967 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:39,967 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498728112] [2022-03-15 15:09:39,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:39,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:40,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:40,844 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:40,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498728112] [2022-03-15 15:09:40,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498728112] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:40,844 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:40,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-03-15 15:09:40,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910565575] [2022-03-15 15:09:40,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:40,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 15:09:40,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:40,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 15:09:40,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:09:40,845 INFO L87 Difference]: Start difference. First operand 2691 states and 4958 transitions. Second operand has 23 states, 22 states have (on average 9.318181818181818) internal successors, (205), 23 states have internal predecessors, (205), 0 states have call successors, (0), 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-03-15 15:09:43,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:43,093 INFO L93 Difference]: Finished difference Result 4732 states and 8813 transitions. [2022-03-15 15:09:43,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 15:09:43,093 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 9.318181818181818) internal successors, (205), 23 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2022-03-15 15:09:43,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:43,098 INFO L225 Difference]: With dead ends: 4732 [2022-03-15 15:09:43,098 INFO L226 Difference]: Without dead ends: 4732 [2022-03-15 15:09:43,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=730, Invalid=3176, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 15:09:43,100 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 1211 mSDsluCounter, 3161 mSDsCounter, 0 mSdLazyCounter, 2659 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 3426 SdHoareTripleChecker+Invalid, 3102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:43,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1211 Valid, 3426 Invalid, 3102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2659 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 15:09:43,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4732 states. [2022-03-15 15:09:43,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4732 to 2689. [2022-03-15 15:09:43,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2689 states, 2678 states have (on average 1.8498879761015683) internal successors, (4954), 2688 states have internal predecessors, (4954), 0 states have call successors, (0), 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-03-15 15:09:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 4954 transitions. [2022-03-15 15:09:43,143 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 4954 transitions. Word has length 205 [2022-03-15 15:09:43,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:43,143 INFO L470 AbstractCegarLoop]: Abstraction has 2689 states and 4954 transitions. [2022-03-15 15:09:43,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 9.318181818181818) internal successors, (205), 23 states have internal predecessors, (205), 0 states have call successors, (0), 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-03-15 15:09:43,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 4954 transitions. [2022-03-15 15:09:43,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-03-15 15:09:43,145 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:43,145 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:43,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-15 15:09:43,145 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:43,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:43,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2143987693, now seen corresponding path program 7 times [2022-03-15 15:09:43,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:43,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122110402] [2022-03-15 15:09:43,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:43,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:43,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:43,564 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:43,564 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122110402] [2022-03-15 15:09:43,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122110402] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:43,564 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:43,565 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-03-15 15:09:43,565 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406734700] [2022-03-15 15:09:43,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:43,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 15:09:43,565 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:43,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 15:09:43,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:09:43,566 INFO L87 Difference]: Start difference. First operand 2689 states and 4954 transitions. Second operand has 21 states, 20 states have (on average 10.25) internal successors, (205), 21 states have internal predecessors, (205), 0 states have call successors, (0), 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-03-15 15:09:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:45,052 INFO L93 Difference]: Finished difference Result 3238 states and 5997 transitions. [2022-03-15 15:09:45,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 15:09:45,053 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 10.25) internal successors, (205), 21 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2022-03-15 15:09:45,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:45,056 INFO L225 Difference]: With dead ends: 3238 [2022-03-15 15:09:45,056 INFO L226 Difference]: Without dead ends: 3238 [2022-03-15 15:09:45,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=457, Invalid=1993, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 15:09:45,057 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 1341 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 2333 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1341 SdHoareTripleChecker+Valid, 2795 SdHoareTripleChecker+Invalid, 2712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 2333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:45,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1341 Valid, 2795 Invalid, 2712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 2333 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 15:09:45,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3238 states. [2022-03-15 15:09:45,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3238 to 2669. [2022-03-15 15:09:45,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2669 states, 2658 states have (on average 1.8487584650112867) internal successors, (4914), 2668 states have internal predecessors, (4914), 0 states have call successors, (0), 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-03-15 15:09:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 4914 transitions. [2022-03-15 15:09:45,080 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 4914 transitions. Word has length 205 [2022-03-15 15:09:45,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:45,081 INFO L470 AbstractCegarLoop]: Abstraction has 2669 states and 4914 transitions. [2022-03-15 15:09:45,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 10.25) internal successors, (205), 21 states have internal predecessors, (205), 0 states have call successors, (0), 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-03-15 15:09:45,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 4914 transitions. [2022-03-15 15:09:45,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-03-15 15:09:45,083 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:45,083 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:45,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-15 15:09:45,083 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:45,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:45,083 INFO L85 PathProgramCache]: Analyzing trace with hash 266578173, now seen corresponding path program 8 times [2022-03-15 15:09:45,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:45,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678314125] [2022-03-15 15:09:45,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:45,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:45,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:45,472 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:45,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678314125] [2022-03-15 15:09:45,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678314125] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:45,472 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:45,472 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-03-15 15:09:45,473 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785557632] [2022-03-15 15:09:45,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:45,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 15:09:45,473 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:45,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 15:09:45,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2022-03-15 15:09:45,473 INFO L87 Difference]: Start difference. First operand 2669 states and 4914 transitions. Second operand has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 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-03-15 15:09:46,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:46,962 INFO L93 Difference]: Finished difference Result 3261 states and 6043 transitions. [2022-03-15 15:09:46,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 15:09:46,963 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2022-03-15 15:09:46,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:46,967 INFO L225 Difference]: With dead ends: 3261 [2022-03-15 15:09:46,967 INFO L226 Difference]: Without dead ends: 3261 [2022-03-15 15:09:46,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=500, Invalid=2152, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 15:09:46,968 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 1287 mSDsluCounter, 2534 mSDsCounter, 0 mSdLazyCounter, 2321 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 2771 SdHoareTripleChecker+Invalid, 2684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 2321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:46,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1287 Valid, 2771 Invalid, 2684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 2321 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 15:09:46,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3261 states. [2022-03-15 15:09:46,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3261 to 2649. [2022-03-15 15:09:46,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2649 states, 2638 states have (on average 1.847611827141774) internal successors, (4874), 2648 states have internal predecessors, (4874), 0 states have call successors, (0), 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-03-15 15:09:46,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2649 states and 4874 transitions. [2022-03-15 15:09:46,991 INFO L78 Accepts]: Start accepts. Automaton has 2649 states and 4874 transitions. Word has length 205 [2022-03-15 15:09:46,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:46,991 INFO L470 AbstractCegarLoop]: Abstraction has 2649 states and 4874 transitions. [2022-03-15 15:09:46,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.761904761904763) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 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-03-15 15:09:46,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 4874 transitions. [2022-03-15 15:09:46,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-03-15 15:09:46,993 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:46,993 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:46,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-15 15:09:46,993 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:46,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:46,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1760104399, now seen corresponding path program 9 times [2022-03-15 15:09:46,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:46,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270964988] [2022-03-15 15:09:46,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:46,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:47,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:47,359 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:47,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270964988] [2022-03-15 15:09:47,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270964988] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:47,360 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:47,360 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-03-15 15:09:47,360 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906918618] [2022-03-15 15:09:47,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:47,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 15:09:47,360 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:47,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 15:09:47,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2022-03-15 15:09:47,361 INFO L87 Difference]: Start difference. First operand 2649 states and 4874 transitions. Second operand has 21 states, 20 states have (on average 10.25) internal successors, (205), 21 states have internal predecessors, (205), 0 states have call successors, (0), 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-03-15 15:09:49,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:49,219 INFO L93 Difference]: Finished difference Result 3095 states and 5722 transitions. [2022-03-15 15:09:49,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 15:09:49,219 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 10.25) internal successors, (205), 21 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2022-03-15 15:09:49,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:49,222 INFO L225 Difference]: With dead ends: 3095 [2022-03-15 15:09:49,223 INFO L226 Difference]: Without dead ends: 3095 [2022-03-15 15:09:49,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=648, Invalid=2658, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 15:09:49,223 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 1210 mSDsluCounter, 3395 mSDsCounter, 0 mSdLazyCounter, 3148 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 3698 SdHoareTripleChecker+Invalid, 3521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 3148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:49,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1210 Valid, 3698 Invalid, 3521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 3148 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 15:09:49,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2022-03-15 15:09:49,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 2559. [2022-03-15 15:09:49,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2559 states, 2548 states have (on average 1.846546310832025) internal successors, (4705), 2558 states have internal predecessors, (4705), 0 states have call successors, (0), 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-03-15 15:09:49,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 4705 transitions. [2022-03-15 15:09:49,247 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 4705 transitions. Word has length 205 [2022-03-15 15:09:49,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:49,247 INFO L470 AbstractCegarLoop]: Abstraction has 2559 states and 4705 transitions. [2022-03-15 15:09:49,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 10.25) internal successors, (205), 21 states have internal predecessors, (205), 0 states have call successors, (0), 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-03-15 15:09:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 4705 transitions. [2022-03-15 15:09:49,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-03-15 15:09:49,249 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:49,249 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:49,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-15 15:09:49,249 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:49,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:49,250 INFO L85 PathProgramCache]: Analyzing trace with hash 759161237, now seen corresponding path program 1 times [2022-03-15 15:09:49,250 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:49,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563095279] [2022-03-15 15:09:49,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:49,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:49,718 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:49,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563095279] [2022-03-15 15:09:49,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563095279] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:49,718 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:49,718 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-03-15 15:09:49,719 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014628086] [2022-03-15 15:09:49,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:49,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 15:09:49,719 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:49,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 15:09:49,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-03-15 15:09:49,719 INFO L87 Difference]: Start difference. First operand 2559 states and 4705 transitions. Second operand has 22 states, 21 states have (on average 9.904761904761905) internal successors, (208), 22 states have internal predecessors, (208), 0 states have call successors, (0), 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-03-15 15:09:51,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:51,534 INFO L93 Difference]: Finished difference Result 3363 states and 6216 transitions. [2022-03-15 15:09:51,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 15:09:51,535 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.904761904761905) internal successors, (208), 22 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2022-03-15 15:09:51,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:51,538 INFO L225 Difference]: With dead ends: 3363 [2022-03-15 15:09:51,538 INFO L226 Difference]: Without dead ends: 3355 [2022-03-15 15:09:51,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=531, Invalid=3009, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 15:09:51,540 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 1358 mSDsluCounter, 2400 mSDsCounter, 0 mSdLazyCounter, 2611 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1358 SdHoareTripleChecker+Valid, 2647 SdHoareTripleChecker+Invalid, 3026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 2611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:51,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1358 Valid, 2647 Invalid, 3026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 2611 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 15:09:51,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2022-03-15 15:09:51,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 2637. [2022-03-15 15:09:51,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2637 states, 2626 states have (on average 1.8514851485148516) internal successors, (4862), 2636 states have internal predecessors, (4862), 0 states have call successors, (0), 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-03-15 15:09:51,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 4862 transitions. [2022-03-15 15:09:51,566 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 4862 transitions. Word has length 208 [2022-03-15 15:09:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:51,567 INFO L470 AbstractCegarLoop]: Abstraction has 2637 states and 4862 transitions. [2022-03-15 15:09:51,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.904761904761905) internal successors, (208), 22 states have internal predecessors, (208), 0 states have call successors, (0), 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-03-15 15:09:51,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 4862 transitions. [2022-03-15 15:09:51,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-03-15 15:09:51,569 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:51,569 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:51,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-15 15:09:51,569 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:51,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:51,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1923489027, now seen corresponding path program 1 times [2022-03-15 15:09:51,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:51,570 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017965273] [2022-03-15 15:09:51,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:51,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:52,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:52,111 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:52,111 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017965273] [2022-03-15 15:09:52,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017965273] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:52,111 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:52,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-03-15 15:09:52,111 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199157905] [2022-03-15 15:09:52,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:52,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 15:09:52,111 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:52,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 15:09:52,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2022-03-15 15:09:52,112 INFO L87 Difference]: Start difference. First operand 2637 states and 4862 transitions. Second operand has 25 states, 24 states have (on average 8.666666666666666) internal successors, (208), 25 states have internal predecessors, (208), 0 states have call successors, (0), 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-03-15 15:09:54,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:54,252 INFO L93 Difference]: Finished difference Result 2636 states and 4854 transitions. [2022-03-15 15:09:54,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 15:09:54,252 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 8.666666666666666) internal successors, (208), 25 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2022-03-15 15:09:54,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:54,255 INFO L225 Difference]: With dead ends: 2636 [2022-03-15 15:09:54,255 INFO L226 Difference]: Without dead ends: 2636 [2022-03-15 15:09:54,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=400, Invalid=2356, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 15:09:54,256 INFO L933 BasicCegarLoop]: 296 mSDtfsCounter, 1181 mSDsluCounter, 3510 mSDsCounter, 0 mSdLazyCounter, 4053 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 3801 SdHoareTripleChecker+Invalid, 4130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 4053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:54,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1181 Valid, 3801 Invalid, 4130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 4053 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 15:09:54,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2022-03-15 15:09:54,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2572. [2022-03-15 15:09:54,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2572 states, 2562 states have (on average 1.8481654957064793) internal successors, (4735), 2571 states have internal predecessors, (4735), 0 states have call successors, (0), 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-03-15 15:09:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2572 states and 4735 transitions. [2022-03-15 15:09:54,302 INFO L78 Accepts]: Start accepts. Automaton has 2572 states and 4735 transitions. Word has length 208 [2022-03-15 15:09:54,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:54,303 INFO L470 AbstractCegarLoop]: Abstraction has 2572 states and 4735 transitions. [2022-03-15 15:09:54,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 8.666666666666666) internal successors, (208), 25 states have internal predecessors, (208), 0 states have call successors, (0), 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-03-15 15:09:54,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 4735 transitions. [2022-03-15 15:09:54,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-03-15 15:09:54,304 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:54,305 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:54,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-15 15:09:54,305 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:54,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:54,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1425961517, now seen corresponding path program 2 times [2022-03-15 15:09:54,305 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:54,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952292494] [2022-03-15 15:09:54,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:54,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:54,842 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:54,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952292494] [2022-03-15 15:09:54,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952292494] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:54,842 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:54,843 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-03-15 15:09:54,843 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687591396] [2022-03-15 15:09:54,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:54,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 15:09:54,843 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:54,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 15:09:54,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:09:54,843 INFO L87 Difference]: Start difference. First operand 2572 states and 4735 transitions. Second operand has 23 states, 22 states have (on average 9.454545454545455) internal successors, (208), 23 states have internal predecessors, (208), 0 states have call successors, (0), 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-03-15 15:09:56,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:56,977 INFO L93 Difference]: Finished difference Result 4198 states and 7798 transitions. [2022-03-15 15:09:56,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 15:09:56,977 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 9.454545454545455) internal successors, (208), 23 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2022-03-15 15:09:56,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:56,982 INFO L225 Difference]: With dead ends: 4198 [2022-03-15 15:09:56,982 INFO L226 Difference]: Without dead ends: 4190 [2022-03-15 15:09:56,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=600, Invalid=3060, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 15:09:56,985 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 1171 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 2982 mSolverCounterSat, 536 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 3232 SdHoareTripleChecker+Invalid, 3518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 536 IncrementalHoareTripleChecker+Valid, 2982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:56,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1171 Valid, 3232 Invalid, 3518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [536 Valid, 2982 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 15:09:56,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2022-03-15 15:09:57,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 2572. [2022-03-15 15:09:57,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2572 states, 2562 states have (on average 1.8481654957064793) internal successors, (4735), 2571 states have internal predecessors, (4735), 0 states have call successors, (0), 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-03-15 15:09:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2572 states and 4735 transitions. [2022-03-15 15:09:57,017 INFO L78 Accepts]: Start accepts. Automaton has 2572 states and 4735 transitions. Word has length 208 [2022-03-15 15:09:57,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:57,017 INFO L470 AbstractCegarLoop]: Abstraction has 2572 states and 4735 transitions. [2022-03-15 15:09:57,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 9.454545454545455) internal successors, (208), 23 states have internal predecessors, (208), 0 states have call successors, (0), 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-03-15 15:09:57,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 4735 transitions. [2022-03-15 15:09:57,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-03-15 15:09:57,019 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:57,019 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:09:57,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-15 15:09:57,020 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:09:57,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:57,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1115506225, now seen corresponding path program 3 times [2022-03-15 15:09:57,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:57,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739776963] [2022-03-15 15:09:57,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:57,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:09:57,660 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:57,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739776963] [2022-03-15 15:09:57,660 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739776963] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:57,660 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:57,660 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-03-15 15:09:57,660 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102543415] [2022-03-15 15:09:57,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:57,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 15:09:57,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:57,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 15:09:57,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2022-03-15 15:09:57,661 INFO L87 Difference]: Start difference. First operand 2572 states and 4735 transitions. Second operand has 25 states, 24 states have (on average 8.666666666666666) internal successors, (208), 25 states have internal predecessors, (208), 0 states have call successors, (0), 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-03-15 15:10:00,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:00,440 INFO L93 Difference]: Finished difference Result 4137 states and 7677 transitions. [2022-03-15 15:10:00,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 15:10:00,440 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 8.666666666666666) internal successors, (208), 25 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2022-03-15 15:10:00,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:00,444 INFO L225 Difference]: With dead ends: 4137 [2022-03-15 15:10:00,444 INFO L226 Difference]: Without dead ends: 4129 [2022-03-15 15:10:00,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=740, Invalid=3952, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 15:10:00,445 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 1300 mSDsluCounter, 3591 mSDsCounter, 0 mSdLazyCounter, 3978 mSolverCounterSat, 501 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 3839 SdHoareTripleChecker+Invalid, 4479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 501 IncrementalHoareTripleChecker+Valid, 3978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:00,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1300 Valid, 3839 Invalid, 4479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [501 Valid, 3978 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 15:10:00,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2022-03-15 15:10:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 2572. [2022-03-15 15:10:00,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2572 states, 2562 states have (on average 1.8481654957064793) internal successors, (4735), 2571 states have internal predecessors, (4735), 0 states have call successors, (0), 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-03-15 15:10:00,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2572 states and 4735 transitions. [2022-03-15 15:10:00,474 INFO L78 Accepts]: Start accepts. Automaton has 2572 states and 4735 transitions. Word has length 208 [2022-03-15 15:10:00,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:00,474 INFO L470 AbstractCegarLoop]: Abstraction has 2572 states and 4735 transitions. [2022-03-15 15:10:00,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 8.666666666666666) internal successors, (208), 25 states have internal predecessors, (208), 0 states have call successors, (0), 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-03-15 15:10:00,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 4735 transitions. [2022-03-15 15:10:00,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-03-15 15:10:00,476 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:00,476 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:10:00,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-15 15:10:00,476 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:10:00,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:00,476 INFO L85 PathProgramCache]: Analyzing trace with hash 406230407, now seen corresponding path program 4 times [2022-03-15 15:10:00,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:00,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266348212] [2022-03-15 15:10:00,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:00,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:10:00,991 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:00,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266348212] [2022-03-15 15:10:00,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266348212] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:10:00,991 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:10:00,991 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-03-15 15:10:00,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846957329] [2022-03-15 15:10:00,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:10:00,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 15:10:00,992 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:00,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 15:10:00,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:10:00,992 INFO L87 Difference]: Start difference. First operand 2572 states and 4735 transitions. Second operand has 23 states, 22 states have (on average 9.454545454545455) internal successors, (208), 23 states have internal predecessors, (208), 0 states have call successors, (0), 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-03-15 15:10:03,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:03,142 INFO L93 Difference]: Finished difference Result 4147 states and 7696 transitions. [2022-03-15 15:10:03,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 15:10:03,143 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 9.454545454545455) internal successors, (208), 23 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2022-03-15 15:10:03,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:03,147 INFO L225 Difference]: With dead ends: 4147 [2022-03-15 15:10:03,147 INFO L226 Difference]: Without dead ends: 4139 [2022-03-15 15:10:03,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=549, Invalid=2991, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 15:10:03,148 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 1235 mSDsluCounter, 2647 mSDsCounter, 0 mSdLazyCounter, 2967 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 2896 SdHoareTripleChecker+Invalid, 3524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 2967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:03,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1235 Valid, 2896 Invalid, 3524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 2967 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 15:10:03,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4139 states. [2022-03-15 15:10:03,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4139 to 2487. [2022-03-15 15:10:03,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2487 states, 2477 states have (on average 1.8433589018974565) internal successors, (4566), 2486 states have internal predecessors, (4566), 0 states have call successors, (0), 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-03-15 15:10:03,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 4566 transitions. [2022-03-15 15:10:03,171 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 4566 transitions. Word has length 208 [2022-03-15 15:10:03,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:03,172 INFO L470 AbstractCegarLoop]: Abstraction has 2487 states and 4566 transitions. [2022-03-15 15:10:03,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 9.454545454545455) internal successors, (208), 23 states have internal predecessors, (208), 0 states have call successors, (0), 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-03-15 15:10:03,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 4566 transitions. [2022-03-15 15:10:03,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-03-15 15:10:03,173 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:03,174 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-15 15:10:03,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-15 15:10:03,174 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2022-03-15 15:10:03,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:03,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1531443157, now seen corresponding path program 1 times [2022-03-15 15:10:03,174 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:03,174 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241980950] [2022-03-15 15:10:03,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:03,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 15:10:03,239 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 15:10:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 15:10:03,349 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 15:10:03,349 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 15:10:03,350 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (36 of 37 remaining) [2022-03-15 15:10:03,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 37 remaining) [2022-03-15 15:10:03,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 37 remaining) [2022-03-15 15:10:03,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 37 remaining) [2022-03-15 15:10:03,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 37 remaining) [2022-03-15 15:10:03,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 37 remaining) [2022-03-15 15:10:03,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (30 of 37 remaining) [2022-03-15 15:10:03,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (29 of 37 remaining) [2022-03-15 15:10:03,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 37 remaining) [2022-03-15 15:10:03,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (27 of 37 remaining) [2022-03-15 15:10:03,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 37 remaining) [2022-03-15 15:10:03,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (25 of 37 remaining) [2022-03-15 15:10:03,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (24 of 37 remaining) [2022-03-15 15:10:03,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (23 of 37 remaining) [2022-03-15 15:10:03,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (22 of 37 remaining) [2022-03-15 15:10:03,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (21 of 37 remaining) [2022-03-15 15:10:03,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (20 of 37 remaining) [2022-03-15 15:10:03,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (19 of 37 remaining) [2022-03-15 15:10:03,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (18 of 37 remaining) [2022-03-15 15:10:03,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (17 of 37 remaining) [2022-03-15 15:10:03,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (16 of 37 remaining) [2022-03-15 15:10:03,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (15 of 37 remaining) [2022-03-15 15:10:03,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (14 of 37 remaining) [2022-03-15 15:10:03,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (13 of 37 remaining) [2022-03-15 15:10:03,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (12 of 37 remaining) [2022-03-15 15:10:03,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (11 of 37 remaining) [2022-03-15 15:10:03,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (10 of 37 remaining) [2022-03-15 15:10:03,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (9 of 37 remaining) [2022-03-15 15:10:03,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (8 of 37 remaining) [2022-03-15 15:10:03,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 37 remaining) [2022-03-15 15:10:03,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 37 remaining) [2022-03-15 15:10:03,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 37 remaining) [2022-03-15 15:10:03,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 37 remaining) [2022-03-15 15:10:03,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 37 remaining) [2022-03-15 15:10:03,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (2 of 37 remaining) [2022-03-15 15:10:03,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (1 of 37 remaining) [2022-03-15 15:10:03,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (0 of 37 remaining) [2022-03-15 15:10:03,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-15 15:10:03,359 INFO L732 BasicCegarLoop]: Path program histogram: [9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:03,364 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 15:10:03,364 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 15:10:03,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 03:10:03 BasicIcfg [2022-03-15 15:10:03,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 15:10:03,472 INFO L158 Benchmark]: Toolchain (without parser) took 56213.85ms. Allocated memory was 186.6MB in the beginning and 515.9MB in the end (delta: 329.3MB). Free memory was 135.8MB in the beginning and 465.1MB in the end (delta: -329.3MB). Peak memory consumption was 297.3MB. Max. memory is 8.0GB. [2022-03-15 15:10:03,472 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 186.6MB. Free memory is still 154.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 15:10:03,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.75ms. Allocated memory is still 186.6MB. Free memory was 135.5MB in the beginning and 135.4MB in the end (delta: 157.4kB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2022-03-15 15:10:03,472 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.73ms. Allocated memory is still 186.6MB. Free memory was 135.4MB in the beginning and 131.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-03-15 15:10:03,472 INFO L158 Benchmark]: Boogie Preprocessor took 43.30ms. Allocated memory is still 186.6MB. Free memory was 131.7MB in the beginning and 128.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 15:10:03,472 INFO L158 Benchmark]: RCFGBuilder took 506.27ms. Allocated memory is still 186.6MB. Free memory was 128.6MB in the beginning and 102.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-03-15 15:10:03,472 INFO L158 Benchmark]: TraceAbstraction took 54989.34ms. Allocated memory was 186.6MB in the beginning and 515.9MB in the end (delta: 329.3MB). Free memory was 101.8MB in the beginning and 465.1MB in the end (delta: -363.3MB). Peak memory consumption was 263.3MB. Max. memory is 8.0GB. [2022-03-15 15:10:03,473 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.10ms. Allocated memory is still 186.6MB. Free memory is still 154.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 604.75ms. Allocated memory is still 186.6MB. Free memory was 135.5MB in the beginning and 135.4MB in the end (delta: 157.4kB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.73ms. Allocated memory is still 186.6MB. Free memory was 135.4MB in the beginning and 131.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.30ms. Allocated memory is still 186.6MB. Free memory was 131.7MB in the beginning and 128.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 506.27ms. Allocated memory is still 186.6MB. Free memory was 128.6MB in the beginning and 102.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 54989.34ms. Allocated memory was 186.6MB in the beginning and 515.9MB in the end (delta: 329.3MB). Free memory was 101.8MB in the beginning and 465.1MB in the end (delta: -363.3MB). Peak memory consumption was 263.3MB. 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 - DataRaceFoundResult [Line: 1259]: Data race detected Data race detected The following path leads to a data race: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A, *B; VAL [A={0:0}, B={0:0}] [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={3:0}, B={0:0}] [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}] [L1243] 0 pthread_t t1; VAL [A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, t1={13:0}] [L1244] 0 struct s *p = malloc(sizeof(struct s)); VAL [A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, malloc(sizeof(struct s))={-2:0}, p={-2:0}, t1={13:0}] [L1245] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [\old(x)=9, A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, p={-2:0}, x=9] [L1229] 0 p -> next = ((void *)0) VAL [\old(x)=9, A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, p={-2:0}, x=9] [L1245] RET 0 init(p,9) [L1246] 0 A = malloc(sizeof(struct s)) VAL [A={-3:0}, A = malloc(sizeof(struct s))=108, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, malloc(sizeof(struct s))={-3:0}, p={-2:0}, t1={13:0}] [L1247] 0 init(A,3) VAL [A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1247] CALL 0 init(A,3) [L1228] 0 p -> datum = x VAL [\old(x)=3, A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-3:0}, p={-3:0}, x=3] [L1229] 0 p -> next = ((void *)0) VAL [\old(x)=3, A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-3:0}, p={-3:0}, x=3] [L1247] RET 0 init(A,3) [L1248] EXPR 0 A->next VAL [A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1248] 0 A->next = p VAL [A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1249] 0 B = malloc(sizeof(struct s)) VAL [A={-3:0}, A_mutex={3:0}, B={11:0}, B = malloc(sizeof(struct s))=121, B_mutex={4:0}, malloc(sizeof(struct s))={11:0}, p={-2:0}, t1={13:0}] [L1250] 0 init(B,5) VAL [A={-3:0}, A_mutex={3:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1250] CALL 0 init(B,5) [L1228] 0 p -> datum = x VAL [\old(x)=5, A={-3:0}, A_mutex={3:0}, B={11:0}, B_mutex={4:0}, p={11:0}, p={11:0}, x=5] [L1229] 0 p -> next = ((void *)0) VAL [\old(x)=5, A={-3:0}, A_mutex={3:0}, B={11:0}, B_mutex={4:0}, p={11:0}, p={11:0}, x=5] [L1250] RET 0 init(B,5) [L1251] EXPR 0 B->next VAL [A={-3:0}, A_mutex={3:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1251] 0 B->next = p VAL [A={-3:0}, A_mutex={3:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1252] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=-1, t1={13:0}] [L1254] EXPR 0 A->next VAL [A={-3:0}, A->next={-2:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1254] 0 p = A->next VAL [A={-3:0}, A->next={-2:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1255] EXPR 0 p->datum VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, p->datum=9, t1={13:0}] [L1255] 0 printf("%d\n", p->datum) VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, p->datum=9, t1={13:0}] [L1258] EXPR 0 B->next VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B->next={-2:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1258] 0 p = B->next VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B->next={-2:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1235] EXPR 1 A->next VAL [A={-3:0}, A->next={-2:0}, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1235] EXPR 1 A->next->datum VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1235] 1 A->next->datum++ VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1259] EXPR 0 p->datum VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, p->datum=9, t1={13:0}] [L1235] 1 A->next->datum++ VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A->next->datum++=107, A->next->datum++=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1259] 0 printf("%d\n", p->datum) VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A->next->datum++=107, A->next->datum++=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, p->datum=9, t1={13:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: B->next = p [1251] * C: p -> next = ((void *)0) [1229] * C: A->next = p [1248] * C: B->next = p [1251] * C: B->next = p [1251] * C: B->next = p [1251] * C: A->next = p [1248] * C: p -> datum = x [1228] * C: p -> datum = x [1228] * C: p -> datum = x [1228] * C: A = malloc(sizeof(struct s)) [1246] * C: p -> datum = x [1228] * C: p -> next = ((void *)0) [1229] * C: p -> next = ((void *)0) [1229] * C: A->next = p [1248] * C: p -> next = ((void *)0) [1229] * C: A->next->datum++ [1235] * C: B = malloc(sizeof(struct s)) [1249] * C: A->next = p [1248] and C: printf("%d\n", p->datum) [1259] - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1246]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1247]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1249]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1250]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1254]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1254]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1255]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1258]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1258]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1252]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 358 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 54.8s, OverallIterations: 37, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.1s, AutomataDifference: 40.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27789 SdHoareTripleChecker+Valid, 26.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27789 mSDsluCounter, 70423 SdHoareTripleChecker+Invalid, 22.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60220 mSDsCounter, 8881 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55904 IncrementalHoareTripleChecker+Invalid, 64785 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8881 mSolverCounterUnsat, 10341 mSDtfsCounter, 55904 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1349 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 1077 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13496 ImplicationChecksByTransitivity, 15.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4286occurred in iteration=12, InterpolantAutomatonStates: 857, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 36 MinimizatonAttempts, 23070 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 6401 NumberOfCodeBlocks, 6401 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6156 ConstructedInterpolants, 0 QuantifiedInterpolants, 73650 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-03-15 15:10:03,586 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...