/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/ldv-races/race-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-09 01:46:42,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-09 01:46:42,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-09 01:46:43,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-09 01:46:43,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-09 01:46:43,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-09 01:46:43,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-09 01:46:43,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-09 01:46:43,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-09 01:46:43,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-09 01:46:43,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-09 01:46:43,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-09 01:46:43,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-09 01:46:43,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-09 01:46:43,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-09 01:46:43,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-09 01:46:43,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-09 01:46:43,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-09 01:46:43,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-09 01:46:43,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-09 01:46:43,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-09 01:46:43,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-09 01:46:43,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-09 01:46:43,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-09 01:46:43,037 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-09 01:46:43,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-09 01:46:43,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-09 01:46:43,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-09 01:46:43,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-09 01:46:43,039 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-09 01:46:43,039 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-09 01:46:43,040 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-09 01:46:43,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-09 01:46:43,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-09 01:46:43,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-09 01:46:43,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-09 01:46:43,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-09 01:46:43,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-09 01:46:43,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-09 01:46:43,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-09 01:46:43,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-09 01:46:43,049 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-02-09 01:46:43,077 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-09 01:46:43,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-09 01:46:43,078 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-09 01:46:43,078 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-09 01:46:43,078 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-09 01:46:43,079 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-09 01:46:43,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-09 01:46:43,082 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-09 01:46:43,082 INFO L138 SettingsManager]: * Use SBE=true [2022-02-09 01:46:43,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-09 01:46:43,082 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-09 01:46:43,082 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-09 01:46:43,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-09 01:46:43,083 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-09 01:46:43,083 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-09 01:46:43,083 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-09 01:46:43,083 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-09 01:46:43,083 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-09 01:46:43,083 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-09 01:46:43,083 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-09 01:46:43,083 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-09 01:46:43,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-09 01:46:43,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-09 01:46:43,084 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-09 01:46:43,084 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-09 01:46:43,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-09 01:46:43,084 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-09 01:46:43,084 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-09 01:46:43,084 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-09 01:46:43,084 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-09 01:46:43,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-09 01:46:43,084 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-09 01:46:43,085 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-09 01:46:43,085 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-02-09 01:46:43,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-09 01:46:43,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-09 01:46:43,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-09 01:46:43,285 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-09 01:46:43,285 INFO L275 PluginConnector]: CDTParser initialized [2022-02-09 01:46:43,286 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2022-02-09 01:46:43,335 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c65eda29b/70a1bc942c254665b37c4963616f55e8/FLAG438f4b98a [2022-02-09 01:46:43,797 INFO L306 CDTParser]: Found 1 translation units. [2022-02-09 01:46:43,797 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2022-02-09 01:46:43,815 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c65eda29b/70a1bc942c254665b37c4963616f55e8/FLAG438f4b98a [2022-02-09 01:46:43,825 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c65eda29b/70a1bc942c254665b37c4963616f55e8 [2022-02-09 01:46:43,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-09 01:46:43,828 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-09 01:46:43,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-09 01:46:43,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-09 01:46:43,832 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-09 01:46:43,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 01:46:43" (1/1) ... [2022-02-09 01:46:43,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1432ddaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:46:43, skipping insertion in model container [2022-02-09 01:46:43,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 01:46:43" (1/1) ... [2022-02-09 01:46:43,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-09 01:46:43,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-09 01:46:44,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i[76084,76097] [2022-02-09 01:46:44,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-09 01:46:44,431 INFO L203 MainTranslator]: Completed pre-run [2022-02-09 01:46:44,464 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i[76084,76097] [2022-02-09 01:46:44,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-09 01:46:44,541 INFO L208 MainTranslator]: Completed translation [2022-02-09 01:46:44,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:46:44 WrapperNode [2022-02-09 01:46:44,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-09 01:46:44,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-09 01:46:44,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-09 01:46:44,542 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-09 01:46:44,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:46:44" (1/1) ... [2022-02-09 01:46:44,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:46:44" (1/1) ... [2022-02-09 01:46:44,634 INFO L137 Inliner]: procedures = 482, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 206 [2022-02-09 01:46:44,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-09 01:46:44,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-09 01:46:44,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-09 01:46:44,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-09 01:46:44,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:46:44" (1/1) ... [2022-02-09 01:46:44,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:46:44" (1/1) ... [2022-02-09 01:46:44,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:46:44" (1/1) ... [2022-02-09 01:46:44,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:46:44" (1/1) ... [2022-02-09 01:46:44,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:46:44" (1/1) ... [2022-02-09 01:46:44,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:46:44" (1/1) ... [2022-02-09 01:46:44,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:46:44" (1/1) ... [2022-02-09 01:46:44,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-09 01:46:44,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-09 01:46:44,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-09 01:46:44,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-09 01:46:44,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:46:44" (1/1) ... [2022-02-09 01:46:44,694 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-09 01:46:44,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:46:44,715 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-09 01:46:44,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-09 01:46:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-09 01:46:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-09 01:46:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-09 01:46:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-09 01:46:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-09 01:46:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-09 01:46:44,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-09 01:46:44,746 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-02-09 01:46:44,746 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-02-09 01:46:44,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-09 01:46:44,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-09 01:46:44,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-09 01:46:44,748 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-09 01:46:45,008 INFO L234 CfgBuilder]: Building ICFG [2022-02-09 01:46:45,009 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-09 01:46:45,356 INFO L275 CfgBuilder]: Performing block encoding [2022-02-09 01:46:45,363 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-09 01:46:45,363 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-09 01:46:45,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 01:46:45 BoogieIcfgContainer [2022-02-09 01:46:45,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-09 01:46:45,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-09 01:46:45,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-09 01:46:45,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-09 01:46:45,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.02 01:46:43" (1/3) ... [2022-02-09 01:46:45,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553119fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 01:46:45, skipping insertion in model container [2022-02-09 01:46:45,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:46:44" (2/3) ... [2022-02-09 01:46:45,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553119fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 01:46:45, skipping insertion in model container [2022-02-09 01:46:45,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 01:46:45" (3/3) ... [2022-02-09 01:46:45,383 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2022-02-09 01:46:45,386 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-09 01:46:45,386 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-09 01:46:45,386 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-02-09 01:46:45,386 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-09 01:46:45,436 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,436 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,436 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,436 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,436 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,436 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,436 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,437 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,437 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,437 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,437 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,437 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,437 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,437 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,437 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,437 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,437 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,437 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,437 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,438 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,438 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,438 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,438 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,438 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,438 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,438 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,438 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,438 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,439 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,439 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,439 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,439 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,439 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,439 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,439 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,439 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,439 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,439 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,440 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,440 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,440 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,440 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,440 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,440 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,440 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,440 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,440 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,440 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,440 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,440 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,441 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,441 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,441 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,441 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,441 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,441 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,441 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,441 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,441 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,441 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,441 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,441 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,442 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,442 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,442 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,442 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,442 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,442 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,442 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,442 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,442 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,443 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,443 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,443 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,443 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,443 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,443 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,443 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,443 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,443 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,443 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,444 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,444 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,444 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,444 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,444 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,444 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,444 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,444 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,444 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,444 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,445 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,445 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,445 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,445 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,445 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,445 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,445 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,445 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,445 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,446 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,446 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,446 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,446 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,446 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,446 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,447 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,447 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,447 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,447 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,447 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,447 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,448 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,448 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,448 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,448 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,448 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,448 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,448 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,448 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,448 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,448 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,449 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,449 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,449 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,449 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,449 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,449 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,449 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,449 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,449 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,449 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,450 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,450 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,450 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,450 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,450 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,450 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,450 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,450 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,451 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,451 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,451 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,451 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,451 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,452 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,452 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,452 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,452 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,452 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,452 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,452 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,452 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,453 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,453 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,453 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,453 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,453 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,453 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,453 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,453 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,453 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,454 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,454 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,454 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,454 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,454 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,454 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,454 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,454 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,455 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,455 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,455 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,455 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,464 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,464 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,464 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,465 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,465 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,465 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,465 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,465 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,465 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,465 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,465 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,466 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,466 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,466 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,466 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,467 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,467 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,467 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,467 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,467 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,467 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,467 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,467 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,467 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,467 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,468 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,468 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,468 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,468 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,468 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,468 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,468 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,468 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,468 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,468 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,468 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,468 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,469 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,469 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,469 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,469 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,469 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,469 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,469 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,469 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,469 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,469 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,469 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,469 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,469 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,470 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,470 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,470 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,470 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,470 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,470 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,470 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,470 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,470 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,471 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,471 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,471 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,471 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,471 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,471 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,471 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,471 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,471 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,471 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,471 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,471 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,472 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,472 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,472 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,472 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,472 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,472 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,472 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,472 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,472 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,472 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,472 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,473 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,473 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,473 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,473 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,473 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,473 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,473 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,473 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,473 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,473 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,474 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,474 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,474 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,474 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,474 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,474 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,474 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,474 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,474 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,475 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,475 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,475 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,475 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,475 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,475 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,475 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,475 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,475 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,475 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,475 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,475 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,475 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,476 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,476 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,476 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,476 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,476 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,476 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,476 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,476 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,476 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,476 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,476 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,476 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,477 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,477 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,477 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,477 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,477 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,477 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,477 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,477 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,477 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,477 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,478 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,478 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,478 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,478 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,478 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,478 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,478 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,478 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,478 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,478 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,478 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,478 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,479 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,479 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,481 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,481 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,481 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,482 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,482 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,482 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,482 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,482 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,482 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,482 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,482 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,482 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,486 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,487 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,487 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,487 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,487 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,487 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,487 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,487 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,487 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,487 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,487 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,487 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:46:45,491 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-02-09 01:46:45,553 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-09 01:46:45,558 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 [2022-02-09 01:46:45,559 INFO L340 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-02-09 01:46:45,574 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 321 places, 323 transitions, 662 flow [2022-02-09 01:46:48,167 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 124065 states, 123873 states have (on average 2.9572384619731498) internal successors, (366322), 124064 states have internal predecessors, (366322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:46:48,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 124065 states, 123873 states have (on average 2.9572384619731498) internal successors, (366322), 124064 states have internal predecessors, (366322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:46:48,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-09 01:46:48,386 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:46:48,387 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] [2022-02-09 01:46:48,387 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:46:48,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:46:48,391 INFO L85 PathProgramCache]: Analyzing trace with hash 32690800, now seen corresponding path program 1 times [2022-02-09 01:46:48,397 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:46:48,398 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569870150] [2022-02-09 01:46:48,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:46:48,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:46:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:46:48,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:46:48,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:46:48,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569870150] [2022-02-09 01:46:48,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569870150] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:46:48,801 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:46:48,801 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:46:48,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436619984] [2022-02-09 01:46:48,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:46:48,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:46:48,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:46:48,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:46:48,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:46:49,056 INFO L87 Difference]: Start difference. First operand has 124065 states, 123873 states have (on average 2.9572384619731498) internal successors, (366322), 124064 states have internal predecessors, (366322), 0 states have call successors, (0), 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 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:46:50,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:46:50,589 INFO L93 Difference]: Finished difference Result 121017 states and 354299 transitions. [2022-02-09 01:46:50,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:46:50,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-09 01:46:50,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:46:51,227 INFO L225 Difference]: With dead ends: 121017 [2022-02-09 01:46:51,227 INFO L226 Difference]: Without dead ends: 120435 [2022-02-09 01:46:51,228 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-02-09 01:46:51,230 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 2 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-09 01:46:51,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 485 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-09 01:46:51,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120435 states. [2022-02-09 01:46:54,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120435 to 120435. [2022-02-09 01:46:55,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120435 states, 120198 states have (on average 2.9332018835587945) internal successors, (352565), 120434 states have internal predecessors, (352565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:46:55,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120435 states to 120435 states and 352565 transitions. [2022-02-09 01:46:55,932 INFO L78 Accepts]: Start accepts. Automaton has 120435 states and 352565 transitions. Word has length 43 [2022-02-09 01:46:55,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:46:55,935 INFO L470 AbstractCegarLoop]: Abstraction has 120435 states and 352565 transitions. [2022-02-09 01:46:55,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:46:55,936 INFO L276 IsEmpty]: Start isEmpty. Operand 120435 states and 352565 transitions. [2022-02-09 01:46:55,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-09 01:46:55,947 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:46:55,948 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] [2022-02-09 01:46:55,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-09 01:46:55,948 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:46:55,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:46:55,952 INFO L85 PathProgramCache]: Analyzing trace with hash 696272735, now seen corresponding path program 1 times [2022-02-09 01:46:55,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:46:55,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457752663] [2022-02-09 01:46:55,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:46:55,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:46:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:46:56,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:46:56,129 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:46:56,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457752663] [2022-02-09 01:46:56,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457752663] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:46:56,129 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:46:56,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:46:56,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366821622] [2022-02-09 01:46:56,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:46:56,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:46:56,131 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:46:56,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:46:56,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:46:56,132 INFO L87 Difference]: Start difference. First operand 120435 states and 352565 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:46:57,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:46:57,081 INFO L93 Difference]: Finished difference Result 120434 states and 352564 transitions. [2022-02-09 01:46:57,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:46:57,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-09 01:46:57,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:46:57,546 INFO L225 Difference]: With dead ends: 120434 [2022-02-09 01:46:57,546 INFO L226 Difference]: Without dead ends: 120434 [2022-02-09 01:46:57,546 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-02-09 01:46:57,547 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 2 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-09 01:46:57,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 658 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-09 01:46:58,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120434 states. [2022-02-09 01:47:00,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120434 to 120434. [2022-02-09 01:47:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120434 states, 120198 states have (on average 2.9331935639528113) internal successors, (352564), 120433 states have internal predecessors, (352564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:01,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120434 states to 120434 states and 352564 transitions. [2022-02-09 01:47:01,156 INFO L78 Accepts]: Start accepts. Automaton has 120434 states and 352564 transitions. Word has length 51 [2022-02-09 01:47:01,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:47:01,156 INFO L470 AbstractCegarLoop]: Abstraction has 120434 states and 352564 transitions. [2022-02-09 01:47:01,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:01,156 INFO L276 IsEmpty]: Start isEmpty. Operand 120434 states and 352564 transitions. [2022-02-09 01:47:01,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-09 01:47:01,157 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:47:01,157 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-02-09 01:47:01,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-09 01:47:01,158 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:47:01,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:47:01,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1775371588, now seen corresponding path program 1 times [2022-02-09 01:47:01,158 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:47:01,158 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954726389] [2022-02-09 01:47:01,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:47:01,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:47:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:47:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:47:01,309 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:47:01,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954726389] [2022-02-09 01:47:01,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954726389] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:47:01,309 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:47:01,309 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:47:01,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628309451] [2022-02-09 01:47:01,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:47:01,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:47:01,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:47:01,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:47:01,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:47:01,310 INFO L87 Difference]: Start difference. First operand 120434 states and 352564 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-02-09 01:47:02,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:47:02,376 INFO L93 Difference]: Finished difference Result 120438 states and 352568 transitions. [2022-02-09 01:47:02,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:47:02,377 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-02-09 01:47:02,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:47:03,094 INFO L225 Difference]: With dead ends: 120438 [2022-02-09 01:47:03,094 INFO L226 Difference]: Without dead ends: 120438 [2022-02-09 01:47:03,095 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-02-09 01:47:03,096 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 252 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-09 01:47:03,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 432 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-09 01:47:03,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120438 states. [2022-02-09 01:47:05,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120438 to 120433. [2022-02-09 01:47:06,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120433 states, 120198 states have (on average 2.9331852443468276) internal successors, (352563), 120432 states have internal predecessors, (352563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120433 states to 120433 states and 352563 transitions. [2022-02-09 01:47:06,543 INFO L78 Accepts]: Start accepts. Automaton has 120433 states and 352563 transitions. Word has length 58 [2022-02-09 01:47:06,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:47:06,543 INFO L470 AbstractCegarLoop]: Abstraction has 120433 states and 352563 transitions. [2022-02-09 01:47:06,543 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-02-09 01:47:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 120433 states and 352563 transitions. [2022-02-09 01:47:06,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-09 01:47:06,546 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:47:06,546 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] [2022-02-09 01:47:06,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-09 01:47:06,546 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:47:06,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:47:06,547 INFO L85 PathProgramCache]: Analyzing trace with hash 279398854, now seen corresponding path program 1 times [2022-02-09 01:47:06,547 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:47:06,547 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925437505] [2022-02-09 01:47:06,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:47:06,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:47:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:47:06,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:47:06,639 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:47:06,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925437505] [2022-02-09 01:47:06,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925437505] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:47:06,640 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:47:06,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:47:06,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981893275] [2022-02-09 01:47:06,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:47:06,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:47:06,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:47:06,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:47:06,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:47:06,641 INFO L87 Difference]: Start difference. First operand 120433 states and 352563 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:47:07,766 INFO L93 Difference]: Finished difference Result 120437 states and 352567 transitions. [2022-02-09 01:47:07,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:47:07,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2022-02-09 01:47:07,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:47:08,176 INFO L225 Difference]: With dead ends: 120437 [2022-02-09 01:47:08,176 INFO L226 Difference]: Without dead ends: 120437 [2022-02-09 01:47:08,176 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-02-09 01:47:08,177 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 74 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-09 01:47:08,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 771 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-09 01:47:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120437 states. [2022-02-09 01:47:11,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120437 to 120432. [2022-02-09 01:47:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120432 states, 120198 states have (on average 2.9331769247408443) internal successors, (352562), 120431 states have internal predecessors, (352562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120432 states to 120432 states and 352562 transitions. [2022-02-09 01:47:12,073 INFO L78 Accepts]: Start accepts. Automaton has 120432 states and 352562 transitions. Word has length 71 [2022-02-09 01:47:12,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:47:12,073 INFO L470 AbstractCegarLoop]: Abstraction has 120432 states and 352562 transitions. [2022-02-09 01:47:12,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:12,073 INFO L276 IsEmpty]: Start isEmpty. Operand 120432 states and 352562 transitions. [2022-02-09 01:47:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-09 01:47:12,078 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:47:12,078 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] [2022-02-09 01:47:12,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-09 01:47:12,079 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:47:12,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:47:12,081 INFO L85 PathProgramCache]: Analyzing trace with hash -636362002, now seen corresponding path program 1 times [2022-02-09 01:47:12,081 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:47:12,081 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197259997] [2022-02-09 01:47:12,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:47:12,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:47:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:47:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:47:12,143 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:47:12,143 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197259997] [2022-02-09 01:47:12,143 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197259997] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:47:12,143 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:47:12,143 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-09 01:47:12,143 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984822949] [2022-02-09 01:47:12,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:47:12,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-09 01:47:12,143 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:47:12,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-09 01:47:12,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 01:47:12,144 INFO L87 Difference]: Start difference. First operand 120432 states and 352562 transitions. Second operand has 3 states, 2 states have (on average 43.0) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:12,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:47:12,945 INFO L93 Difference]: Finished difference Result 120431 states and 352561 transitions. [2022-02-09 01:47:12,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 01:47:12,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 43.0) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2022-02-09 01:47:12,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:47:13,385 INFO L225 Difference]: With dead ends: 120431 [2022-02-09 01:47:13,385 INFO L226 Difference]: Without dead ends: 120431 [2022-02-09 01:47:13,386 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-02-09 01:47:13,387 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 578 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-02-09 01:47:13,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 578 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:47:13,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120431 states. [2022-02-09 01:47:16,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120431 to 120431. [2022-02-09 01:47:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120431 states, 120198 states have (on average 2.9331686051348607) internal successors, (352561), 120430 states have internal predecessors, (352561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120431 states to 120431 states and 352561 transitions. [2022-02-09 01:47:16,949 INFO L78 Accepts]: Start accepts. Automaton has 120431 states and 352561 transitions. Word has length 86 [2022-02-09 01:47:16,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:47:16,949 INFO L470 AbstractCegarLoop]: Abstraction has 120431 states and 352561 transitions. [2022-02-09 01:47:16,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 43.0) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:16,950 INFO L276 IsEmpty]: Start isEmpty. Operand 120431 states and 352561 transitions. [2022-02-09 01:47:16,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-09 01:47:16,950 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:47:16,950 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] [2022-02-09 01:47:16,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-09 01:47:16,951 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting my_callbackErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:47:16,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:47:16,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1240258334, now seen corresponding path program 1 times [2022-02-09 01:47:16,951 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:47:16,951 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780094523] [2022-02-09 01:47:16,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:47:16,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:47:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:47:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:47:17,041 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:47:17,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780094523] [2022-02-09 01:47:17,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780094523] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:47:17,042 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:47:17,042 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-09 01:47:17,042 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021005510] [2022-02-09 01:47:17,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:47:17,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-09 01:47:17,042 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:47:17,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-09 01:47:17,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 01:47:17,043 INFO L87 Difference]: Start difference. First operand 120431 states and 352561 transitions. Second operand has 3 states, 2 states have (on average 47.5) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:17,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:47:17,855 INFO L93 Difference]: Finished difference Result 114372 states and 334553 transitions. [2022-02-09 01:47:17,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 01:47:17,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 47.5) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2022-02-09 01:47:17,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:47:18,237 INFO L225 Difference]: With dead ends: 114372 [2022-02-09 01:47:18,238 INFO L226 Difference]: Without dead ends: 114372 [2022-02-09 01:47:18,238 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-02-09 01:47:18,239 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 202 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:47:18,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 557 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:47:18,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114372 states. [2022-02-09 01:47:21,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114372 to 114331. [2022-02-09 01:47:21,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114331 states, 114180 states have (on average 2.9296987213172185) internal successors, (334513), 114330 states have internal predecessors, (334513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:21,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114331 states to 114331 states and 334513 transitions. [2022-02-09 01:47:21,806 INFO L78 Accepts]: Start accepts. Automaton has 114331 states and 334513 transitions. Word has length 95 [2022-02-09 01:47:21,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:47:21,806 INFO L470 AbstractCegarLoop]: Abstraction has 114331 states and 334513 transitions. [2022-02-09 01:47:21,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 47.5) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:21,807 INFO L276 IsEmpty]: Start isEmpty. Operand 114331 states and 334513 transitions. [2022-02-09 01:47:21,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-09 01:47:21,808 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:47:21,808 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] [2022-02-09 01:47:21,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-09 01:47:21,808 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:47:21,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:47:21,809 INFO L85 PathProgramCache]: Analyzing trace with hash -612768174, now seen corresponding path program 1 times [2022-02-09 01:47:21,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:47:21,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393277015] [2022-02-09 01:47:21,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:47:21,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:47:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:47:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:47:22,389 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:47:22,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393277015] [2022-02-09 01:47:22,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393277015] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:47:22,390 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:47:22,390 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:47:22,390 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943182032] [2022-02-09 01:47:22,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:47:22,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:47:22,390 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:47:22,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:47:22,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:47:22,391 INFO L87 Difference]: Start difference. First operand 114331 states and 334513 transitions. Second operand has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:23,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:47:23,289 INFO L93 Difference]: Finished difference Result 120824 states and 353614 transitions. [2022-02-09 01:47:23,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:47:23,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-02-09 01:47:23,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:47:24,092 INFO L225 Difference]: With dead ends: 120824 [2022-02-09 01:47:24,092 INFO L226 Difference]: Without dead ends: 120824 [2022-02-09 01:47:24,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:47:24,093 INFO L933 BasicCegarLoop]: 441 mSDtfsCounter, 203 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-09 01:47:24,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 768 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-09 01:47:24,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120824 states. [2022-02-09 01:47:26,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120824 to 119501. [2022-02-09 01:47:26,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119501 states, 119351 states have (on average 2.9301891060820604) internal successors, (349721), 119500 states have internal predecessors, (349721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:27,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119501 states to 119501 states and 349721 transitions. [2022-02-09 01:47:27,265 INFO L78 Accepts]: Start accepts. Automaton has 119501 states and 349721 transitions. Word has length 98 [2022-02-09 01:47:27,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:47:27,265 INFO L470 AbstractCegarLoop]: Abstraction has 119501 states and 349721 transitions. [2022-02-09 01:47:27,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:27,265 INFO L276 IsEmpty]: Start isEmpty. Operand 119501 states and 349721 transitions. [2022-02-09 01:47:27,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-02-09 01:47:27,266 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:47:27,266 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-02-09 01:47:27,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-09 01:47:27,266 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:47:27,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:47:27,267 INFO L85 PathProgramCache]: Analyzing trace with hash 603592172, now seen corresponding path program 1 times [2022-02-09 01:47:27,267 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:47:27,267 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663708351] [2022-02-09 01:47:27,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:47:27,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:47:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:47:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:47:27,745 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:47:27,745 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663708351] [2022-02-09 01:47:27,745 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663708351] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:47:27,745 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:47:27,745 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:47:27,745 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233728226] [2022-02-09 01:47:27,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:47:27,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-09 01:47:27,746 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:47:27,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-09 01:47:27,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-09 01:47:27,747 INFO L87 Difference]: Start difference. First operand 119501 states and 349721 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 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-02-09 01:47:28,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:47:28,306 INFO L93 Difference]: Finished difference Result 119529 states and 349748 transitions. [2022-02-09 01:47:28,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:47:28,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 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-02-09 01:47:28,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:47:28,909 INFO L225 Difference]: With dead ends: 119529 [2022-02-09 01:47:28,910 INFO L226 Difference]: Without dead ends: 119529 [2022-02-09 01:47:28,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-09 01:47:28,910 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 86 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:47:28,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 1151 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:47:29,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119529 states. [2022-02-09 01:47:31,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119529 to 119489. [2022-02-09 01:47:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119489 states, 119340 states have (on average 2.9303586391821685) internal successors, (349709), 119488 states have internal predecessors, (349709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:31,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119489 states to 119489 states and 349709 transitions. [2022-02-09 01:47:31,946 INFO L78 Accepts]: Start accepts. Automaton has 119489 states and 349709 transitions. Word has length 100 [2022-02-09 01:47:31,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:47:31,947 INFO L470 AbstractCegarLoop]: Abstraction has 119489 states and 349709 transitions. [2022-02-09 01:47:31,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 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-02-09 01:47:31,947 INFO L276 IsEmpty]: Start isEmpty. Operand 119489 states and 349709 transitions. [2022-02-09 01:47:31,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-09 01:47:31,948 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:47:31,948 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-02-09 01:47:31,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-09 01:47:31,948 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:47:31,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:47:31,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1714875301, now seen corresponding path program 1 times [2022-02-09 01:47:31,949 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:47:31,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040255420] [2022-02-09 01:47:31,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:47:31,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:47:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:47:32,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-02-09 01:47:32,073 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:47:32,073 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040255420] [2022-02-09 01:47:32,073 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040255420] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:47:32,073 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:47:32,073 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:47:32,074 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362728611] [2022-02-09 01:47:32,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:47:32,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:47:32,075 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:47:32,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:47:32,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:47:32,075 INFO L87 Difference]: Start difference. First operand 119489 states and 349709 transitions. Second operand has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 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-02-09 01:47:33,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:47:33,626 INFO L93 Difference]: Finished difference Result 125982 states and 368810 transitions. [2022-02-09 01:47:33,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:47:33,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 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-02-09 01:47:33,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:47:34,271 INFO L225 Difference]: With dead ends: 125982 [2022-02-09 01:47:34,271 INFO L226 Difference]: Without dead ends: 125982 [2022-02-09 01:47:34,271 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-02-09 01:47:34,272 INFO L933 BasicCegarLoop]: 441 mSDtfsCounter, 201 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-09 01:47:34,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 1156 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-09 01:47:34,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125982 states. [2022-02-09 01:47:36,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125982 to 124659. [2022-02-09 01:47:37,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124659 states, 124511 states have (on average 2.9308012946647284) internal successors, (364917), 124658 states have internal predecessors, (364917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:37,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124659 states to 124659 states and 364917 transitions. [2022-02-09 01:47:37,894 INFO L78 Accepts]: Start accepts. Automaton has 124659 states and 364917 transitions. Word has length 106 [2022-02-09 01:47:37,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:47:37,894 INFO L470 AbstractCegarLoop]: Abstraction has 124659 states and 364917 transitions. [2022-02-09 01:47:37,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 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-02-09 01:47:37,895 INFO L276 IsEmpty]: Start isEmpty. Operand 124659 states and 364917 transitions. [2022-02-09 01:47:37,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-09 01:47:37,896 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:47:37,896 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-02-09 01:47:37,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-09 01:47:37,897 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:47:37,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:47:37,898 INFO L85 PathProgramCache]: Analyzing trace with hash -779597833, now seen corresponding path program 1 times [2022-02-09 01:47:37,898 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:47:37,898 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469141541] [2022-02-09 01:47:37,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:47:37,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:47:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:47:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:47:38,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:47:38,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469141541] [2022-02-09 01:47:38,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469141541] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:47:38,037 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:47:38,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:47:38,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75252027] [2022-02-09 01:47:38,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:47:38,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:47:38,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:47:38,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:47:38,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:47:38,038 INFO L87 Difference]: Start difference. First operand 124659 states and 364917 transitions. Second operand has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 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-02-09 01:47:39,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:47:39,425 INFO L93 Difference]: Finished difference Result 138537 states and 405898 transitions. [2022-02-09 01:47:39,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:47:39,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 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-02-09 01:47:39,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:47:39,910 INFO L225 Difference]: With dead ends: 138537 [2022-02-09 01:47:39,910 INFO L226 Difference]: Without dead ends: 138537 [2022-02-09 01:47:39,911 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-02-09 01:47:39,911 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 358 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-09 01:47:39,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 1117 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-09 01:47:40,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138537 states. [2022-02-09 01:47:43,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138537 to 135484. [2022-02-09 01:47:43,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135484 states, 135336 states have (on average 2.932516108056984) internal successors, (396875), 135483 states have internal predecessors, (396875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135484 states to 135484 states and 396875 transitions. [2022-02-09 01:47:43,722 INFO L78 Accepts]: Start accepts. Automaton has 135484 states and 396875 transitions. Word has length 106 [2022-02-09 01:47:43,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:47:43,722 INFO L470 AbstractCegarLoop]: Abstraction has 135484 states and 396875 transitions. [2022-02-09 01:47:43,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 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-02-09 01:47:43,723 INFO L276 IsEmpty]: Start isEmpty. Operand 135484 states and 396875 transitions. [2022-02-09 01:47:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-02-09 01:47:43,725 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:47:43,725 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] [2022-02-09 01:47:43,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-09 01:47:43,726 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:47:43,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:47:43,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1673365422, now seen corresponding path program 1 times [2022-02-09 01:47:43,726 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:47:43,726 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700608061] [2022-02-09 01:47:43,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:47:43,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:47:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:47:43,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:47:43,820 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:47:43,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700608061] [2022-02-09 01:47:43,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700608061] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:47:43,821 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:47:43,821 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:47:43,821 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742071922] [2022-02-09 01:47:43,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:47:43,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:47:43,821 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:47:43,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:47:43,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:47:43,822 INFO L87 Difference]: Start difference. First operand 135484 states and 396875 transitions. Second operand has 6 states, 5 states have (on average 22.4) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:45,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:47:45,920 INFO L93 Difference]: Finished difference Result 149693 states and 438782 transitions. [2022-02-09 01:47:45,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:47:45,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.4) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2022-02-09 01:47:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:47:46,451 INFO L225 Difference]: With dead ends: 149693 [2022-02-09 01:47:46,451 INFO L226 Difference]: Without dead ends: 149693 [2022-02-09 01:47:46,451 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-02-09 01:47:46,453 INFO L933 BasicCegarLoop]: 572 mSDtfsCounter, 361 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-09 01:47:46,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 1287 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-09 01:47:47,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149693 states. [2022-02-09 01:47:49,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149693 to 146336. [2022-02-09 01:47:50,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146336 states, 146188 states have (on average 2.933640244069281) internal successors, (428863), 146335 states have internal predecessors, (428863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:50,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146336 states to 146336 states and 428863 transitions. [2022-02-09 01:47:50,886 INFO L78 Accepts]: Start accepts. Automaton has 146336 states and 428863 transitions. Word has length 112 [2022-02-09 01:47:50,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:47:50,886 INFO L470 AbstractCegarLoop]: Abstraction has 146336 states and 428863 transitions. [2022-02-09 01:47:50,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.4) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:50,887 INFO L276 IsEmpty]: Start isEmpty. Operand 146336 states and 428863 transitions. [2022-02-09 01:47:50,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-02-09 01:47:50,890 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:47:50,890 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] [2022-02-09 01:47:50,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-09 01:47:50,890 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:47:50,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:47:50,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1586943791, now seen corresponding path program 1 times [2022-02-09 01:47:50,891 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:47:50,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332330850] [2022-02-09 01:47:50,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:47:50,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:47:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:47:51,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:47:51,008 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:47:51,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332330850] [2022-02-09 01:47:51,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332330850] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:47:51,008 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:47:51,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:47:51,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935838087] [2022-02-09 01:47:51,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:47:51,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:47:51,009 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:47:51,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:47:51,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:47:51,010 INFO L87 Difference]: Start difference. First operand 146336 states and 428863 transitions. Second operand has 6 states, 5 states have (on average 22.6) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:52,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:47:52,906 INFO L93 Difference]: Finished difference Result 186976 states and 548457 transitions. [2022-02-09 01:47:52,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:47:52,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.6) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2022-02-09 01:47:52,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:47:53,611 INFO L225 Difference]: With dead ends: 186976 [2022-02-09 01:47:53,611 INFO L226 Difference]: Without dead ends: 186976 [2022-02-09 01:47:53,611 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-02-09 01:47:53,612 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 286 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-09 01:47:53,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 902 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-09 01:47:53,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186976 states. [2022-02-09 01:47:57,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186976 to 151482. [2022-02-09 01:47:57,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151482 states, 151336 states have (on average 2.9338756145266163) internal successors, (444001), 151481 states have internal predecessors, (444001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:58,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151482 states to 151482 states and 444001 transitions. [2022-02-09 01:47:58,355 INFO L78 Accepts]: Start accepts. Automaton has 151482 states and 444001 transitions. Word has length 113 [2022-02-09 01:47:58,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:47:58,356 INFO L470 AbstractCegarLoop]: Abstraction has 151482 states and 444001 transitions. [2022-02-09 01:47:58,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.6) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:47:58,356 INFO L276 IsEmpty]: Start isEmpty. Operand 151482 states and 444001 transitions. [2022-02-09 01:47:58,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-02-09 01:47:58,360 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:47:58,360 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] [2022-02-09 01:47:58,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-09 01:47:58,360 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting my_callbackErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:47:58,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:47:58,361 INFO L85 PathProgramCache]: Analyzing trace with hash 16510216, now seen corresponding path program 1 times [2022-02-09 01:47:58,361 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:47:58,361 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717226608] [2022-02-09 01:47:58,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:47:58,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:47:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:47:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:47:58,449 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:47:58,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717226608] [2022-02-09 01:47:58,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717226608] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:47:58,449 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:47:58,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:47:58,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424254065] [2022-02-09 01:47:58,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:47:58,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:47:58,450 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:47:58,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:47:58,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:47:58,450 INFO L87 Difference]: Start difference. First operand 151482 states and 444001 transitions. Second operand has 6 states, 5 states have (on average 22.6) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:00,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:48:00,191 INFO L93 Difference]: Finished difference Result 172414 states and 505916 transitions. [2022-02-09 01:48:00,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:48:00,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.6) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2022-02-09 01:48:00,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:48:01,083 INFO L225 Difference]: With dead ends: 172414 [2022-02-09 01:48:01,084 INFO L226 Difference]: Without dead ends: 172414 [2022-02-09 01:48:01,084 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-02-09 01:48:01,084 INFO L933 BasicCegarLoop]: 574 mSDtfsCounter, 362 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-09 01:48:01,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [362 Valid, 1408 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-09 01:48:01,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172414 states. [2022-02-09 01:48:04,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172414 to 162286. [2022-02-09 01:48:04,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162286 states, 162140 states have (on average 2.9353274947576167) internal successors, (475934), 162285 states have internal predecessors, (475934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162286 states to 162286 states and 475934 transitions. [2022-02-09 01:48:05,942 INFO L78 Accepts]: Start accepts. Automaton has 162286 states and 475934 transitions. Word has length 113 [2022-02-09 01:48:05,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:48:05,942 INFO L470 AbstractCegarLoop]: Abstraction has 162286 states and 475934 transitions. [2022-02-09 01:48:05,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.6) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 162286 states and 475934 transitions. [2022-02-09 01:48:05,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-02-09 01:48:05,949 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:48:05,949 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] [2022-02-09 01:48:05,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-09 01:48:05,950 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:48:05,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:48:05,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1043410569, now seen corresponding path program 1 times [2022-02-09 01:48:05,950 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:48:05,950 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957053148] [2022-02-09 01:48:05,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:48:05,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:48:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:48:06,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:48:06,032 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:48:06,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957053148] [2022-02-09 01:48:06,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957053148] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:48:06,032 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:48:06,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:48:06,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93793935] [2022-02-09 01:48:06,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:48:06,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:48:06,032 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:48:06,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:48:06,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:48:06,033 INFO L87 Difference]: Start difference. First operand 162286 states and 475934 transitions. Second operand has 6 states, 5 states have (on average 23.4) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:07,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:48:07,567 INFO L93 Difference]: Finished difference Result 169997 states and 496439 transitions. [2022-02-09 01:48:07,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:48:07,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.4) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2022-02-09 01:48:07,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:48:08,180 INFO L225 Difference]: With dead ends: 169997 [2022-02-09 01:48:08,180 INFO L226 Difference]: Without dead ends: 169997 [2022-02-09 01:48:08,180 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-02-09 01:48:08,181 INFO L933 BasicCegarLoop]: 470 mSDtfsCounter, 238 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-09 01:48:08,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 1215 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-09 01:48:08,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169997 states. [2022-02-09 01:48:12,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169997 to 167821. [2022-02-09 01:48:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167821 states, 167675 states have (on average 2.935553898911585) internal successors, (492219), 167820 states have internal predecessors, (492219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167821 states to 167821 states and 492219 transitions. [2022-02-09 01:48:13,227 INFO L78 Accepts]: Start accepts. Automaton has 167821 states and 492219 transitions. Word has length 117 [2022-02-09 01:48:13,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:48:13,228 INFO L470 AbstractCegarLoop]: Abstraction has 167821 states and 492219 transitions. [2022-02-09 01:48:13,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.4) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 167821 states and 492219 transitions. [2022-02-09 01:48:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-02-09 01:48:13,236 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:48:13,236 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] [2022-02-09 01:48:13,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-09 01:48:13,237 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting my_callbackErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:48:13,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:48:13,237 INFO L85 PathProgramCache]: Analyzing trace with hash -744162765, now seen corresponding path program 1 times [2022-02-09 01:48:13,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:48:13,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424964230] [2022-02-09 01:48:13,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:48:13,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:48:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:48:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:48:13,328 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:48:13,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424964230] [2022-02-09 01:48:13,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424964230] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:48:13,328 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:48:13,328 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:48:13,328 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918055901] [2022-02-09 01:48:13,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:48:13,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:48:13,329 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:48:13,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:48:13,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:48:13,329 INFO L87 Difference]: Start difference. First operand 167821 states and 492219 transitions. Second operand has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:15,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:48:15,393 INFO L93 Difference]: Finished difference Result 190532 states and 559332 transitions. [2022-02-09 01:48:15,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:48:15,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2022-02-09 01:48:15,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:48:16,408 INFO L225 Difference]: With dead ends: 190532 [2022-02-09 01:48:16,408 INFO L226 Difference]: Without dead ends: 190532 [2022-02-09 01:48:16,410 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-02-09 01:48:16,411 INFO L933 BasicCegarLoop]: 570 mSDtfsCounter, 363 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-09 01:48:16,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 1360 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-09 01:48:16,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190532 states. [2022-02-09 01:48:20,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190532 to 179552. [2022-02-09 01:48:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179552 states, 179409 states have (on average 2.9365918097754293) internal successors, (526851), 179551 states have internal predecessors, (526851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:21,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179552 states to 179552 states and 526851 transitions. [2022-02-09 01:48:21,604 INFO L78 Accepts]: Start accepts. Automaton has 179552 states and 526851 transitions. Word has length 119 [2022-02-09 01:48:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:48:21,605 INFO L470 AbstractCegarLoop]: Abstraction has 179552 states and 526851 transitions. [2022-02-09 01:48:21,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:21,605 INFO L276 IsEmpty]: Start isEmpty. Operand 179552 states and 526851 transitions. [2022-02-09 01:48:21,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-02-09 01:48:21,613 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:48:21,613 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] [2022-02-09 01:48:21,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-09 01:48:21,613 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting my_callbackErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:48:21,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:48:21,613 INFO L85 PathProgramCache]: Analyzing trace with hash -682246177, now seen corresponding path program 1 times [2022-02-09 01:48:21,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:48:21,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538953284] [2022-02-09 01:48:21,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:48:21,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:48:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:48:22,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:48:22,125 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:48:22,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538953284] [2022-02-09 01:48:22,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538953284] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:48:22,126 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:48:22,126 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:48:22,126 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339042702] [2022-02-09 01:48:22,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:48:22,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:48:22,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:48:22,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:48:22,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:48:22,127 INFO L87 Difference]: Start difference. First operand 179552 states and 526851 transitions. Second operand has 6 states, 5 states have (on average 24.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:23,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:48:23,838 INFO L93 Difference]: Finished difference Result 198011 states and 581305 transitions. [2022-02-09 01:48:23,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:48:23,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 24.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-02-09 01:48:23,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:48:24,545 INFO L225 Difference]: With dead ends: 198011 [2022-02-09 01:48:24,546 INFO L226 Difference]: Without dead ends: 195227 [2022-02-09 01:48:24,546 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-02-09 01:48:24,546 INFO L933 BasicCegarLoop]: 576 mSDtfsCounter, 358 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-09 01:48:24,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 1296 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-09 01:48:25,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195227 states. [2022-02-09 01:48:28,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195227 to 187521. [2022-02-09 01:48:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187521 states, 187378 states have (on average 2.935494028114293) internal successors, (550047), 187520 states have internal predecessors, (550047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:29,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187521 states to 187521 states and 550047 transitions. [2022-02-09 01:48:29,996 INFO L78 Accepts]: Start accepts. Automaton has 187521 states and 550047 transitions. Word has length 120 [2022-02-09 01:48:29,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:48:29,996 INFO L470 AbstractCegarLoop]: Abstraction has 187521 states and 550047 transitions. [2022-02-09 01:48:29,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:29,996 INFO L276 IsEmpty]: Start isEmpty. Operand 187521 states and 550047 transitions. [2022-02-09 01:48:30,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-02-09 01:48:30,006 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:48:30,006 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] [2022-02-09 01:48:30,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-09 01:48:30,006 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:48:30,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:48:30,006 INFO L85 PathProgramCache]: Analyzing trace with hash -70337915, now seen corresponding path program 1 times [2022-02-09 01:48:30,007 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:48:30,007 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710181469] [2022-02-09 01:48:30,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:48:30,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:48:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:48:30,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:48:30,693 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:48:30,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710181469] [2022-02-09 01:48:30,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710181469] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:48:30,693 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:48:30,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-09 01:48:30,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922703918] [2022-02-09 01:48:30,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:48:30,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:48:30,694 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:48:30,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:48:30,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:48:30,695 INFO L87 Difference]: Start difference. First operand 187521 states and 550047 transitions. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:32,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:48:32,932 INFO L93 Difference]: Finished difference Result 202665 states and 588886 transitions. [2022-02-09 01:48:32,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 01:48:32,932 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2022-02-09 01:48:32,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:48:33,954 INFO L225 Difference]: With dead ends: 202665 [2022-02-09 01:48:33,955 INFO L226 Difference]: Without dead ends: 202665 [2022-02-09 01:48:33,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:48:33,956 INFO L933 BasicCegarLoop]: 596 mSDtfsCounter, 2278 mSDsluCounter, 1883 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2278 SdHoareTripleChecker+Valid, 2462 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-09 01:48:33,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2278 Valid, 2462 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-09 01:48:34,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202665 states. [2022-02-09 01:48:38,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202665 to 193331. [2022-02-09 01:48:38,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193331 states, 193164 states have (on average 2.9221697624816216) internal successors, (564458), 193330 states have internal predecessors, (564458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193331 states to 193331 states and 564458 transitions. [2022-02-09 01:48:39,693 INFO L78 Accepts]: Start accepts. Automaton has 193331 states and 564458 transitions. Word has length 123 [2022-02-09 01:48:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:48:39,693 INFO L470 AbstractCegarLoop]: Abstraction has 193331 states and 564458 transitions. [2022-02-09 01:48:39,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 193331 states and 564458 transitions. [2022-02-09 01:48:39,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-02-09 01:48:39,702 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:48:39,702 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] [2022-02-09 01:48:39,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-09 01:48:39,703 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:48:39,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:48:39,703 INFO L85 PathProgramCache]: Analyzing trace with hash 38100917, now seen corresponding path program 1 times [2022-02-09 01:48:39,703 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:48:39,703 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129831977] [2022-02-09 01:48:39,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:48:39,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:48:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:48:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:48:40,032 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:48:40,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129831977] [2022-02-09 01:48:40,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129831977] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:48:40,032 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:48:40,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-09 01:48:40,033 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091848544] [2022-02-09 01:48:40,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:48:40,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:48:40,033 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:48:40,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:48:40,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:48:40,034 INFO L87 Difference]: Start difference. First operand 193331 states and 564458 transitions. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:43,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:48:43,777 INFO L93 Difference]: Finished difference Result 361332 states and 1045222 transitions. [2022-02-09 01:48:43,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 01:48:43,778 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2022-02-09 01:48:43,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:48:46,074 INFO L225 Difference]: With dead ends: 361332 [2022-02-09 01:48:46,075 INFO L226 Difference]: Without dead ends: 361332 [2022-02-09 01:48:46,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:48:46,075 INFO L933 BasicCegarLoop]: 557 mSDtfsCounter, 2590 mSDsluCounter, 1935 mSDsCounter, 0 mSdLazyCounter, 1554 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2590 SdHoareTripleChecker+Valid, 2475 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-09 01:48:46,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2590 Valid, 2475 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1554 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-09 01:48:46,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361332 states. [2022-02-09 01:48:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361332 to 196641. [2022-02-09 01:48:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196641 states, 196450 states have (on average 2.9074879104097735) internal successors, (571176), 196640 states have internal predecessors, (571176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196641 states to 196641 states and 571176 transitions. [2022-02-09 01:48:53,439 INFO L78 Accepts]: Start accepts. Automaton has 196641 states and 571176 transitions. Word has length 123 [2022-02-09 01:48:53,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:48:53,439 INFO L470 AbstractCegarLoop]: Abstraction has 196641 states and 571176 transitions. [2022-02-09 01:48:53,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:53,440 INFO L276 IsEmpty]: Start isEmpty. Operand 196641 states and 571176 transitions. [2022-02-09 01:48:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-02-09 01:48:53,449 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:48:53,449 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] [2022-02-09 01:48:53,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-09 01:48:53,449 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:48:53,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:48:53,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1495711357, now seen corresponding path program 2 times [2022-02-09 01:48:53,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:48:53,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116658832] [2022-02-09 01:48:53,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:48:53,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:48:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:48:53,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:48:53,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:48:53,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116658832] [2022-02-09 01:48:53,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116658832] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:48:53,734 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:48:53,734 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-09 01:48:53,734 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645487044] [2022-02-09 01:48:53,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:48:53,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:48:53,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:48:53,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:48:53,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:48:53,736 INFO L87 Difference]: Start difference. First operand 196641 states and 571176 transitions. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:48:56,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:48:56,242 INFO L93 Difference]: Finished difference Result 224795 states and 642007 transitions. [2022-02-09 01:48:56,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 01:48:56,242 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2022-02-09 01:48:56,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:48:57,343 INFO L225 Difference]: With dead ends: 224795 [2022-02-09 01:48:57,343 INFO L226 Difference]: Without dead ends: 224795 [2022-02-09 01:48:57,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:48:57,344 INFO L933 BasicCegarLoop]: 579 mSDtfsCounter, 2347 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2347 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-09 01:48:57,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2347 Valid, 2330 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-09 01:48:57,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224795 states. [2022-02-09 01:49:01,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224795 to 196641. [2022-02-09 01:49:02,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196641 states, 196450 states have (on average 2.9074879104097735) internal successors, (571176), 196640 states have internal predecessors, (571176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:49:03,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196641 states to 196641 states and 571176 transitions. [2022-02-09 01:49:03,215 INFO L78 Accepts]: Start accepts. Automaton has 196641 states and 571176 transitions. Word has length 123 [2022-02-09 01:49:03,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:49:03,216 INFO L470 AbstractCegarLoop]: Abstraction has 196641 states and 571176 transitions. [2022-02-09 01:49:03,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:49:03,216 INFO L276 IsEmpty]: Start isEmpty. Operand 196641 states and 571176 transitions. [2022-02-09 01:49:03,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-02-09 01:49:03,226 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:49:03,226 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] [2022-02-09 01:49:03,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-09 01:49:03,226 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:49:03,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:49:03,227 INFO L85 PathProgramCache]: Analyzing trace with hash -422960289, now seen corresponding path program 3 times [2022-02-09 01:49:03,227 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:49:03,227 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383457265] [2022-02-09 01:49:03,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:49:03,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:49:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:49:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:49:03,475 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:49:03,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383457265] [2022-02-09 01:49:03,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383457265] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:49:03,475 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:49:03,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-09 01:49:03,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247676763] [2022-02-09 01:49:03,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:49:03,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:49:03,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:49:03,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:49:03,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:49:03,476 INFO L87 Difference]: Start difference. First operand 196641 states and 571176 transitions. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:49:07,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:49:07,239 INFO L93 Difference]: Finished difference Result 359207 states and 1041883 transitions. [2022-02-09 01:49:07,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 01:49:07,240 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2022-02-09 01:49:07,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:49:08,630 INFO L225 Difference]: With dead ends: 359207 [2022-02-09 01:49:08,630 INFO L226 Difference]: Without dead ends: 359207 [2022-02-09 01:49:08,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:49:08,631 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 2458 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2458 SdHoareTripleChecker+Valid, 2366 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-09 01:49:08,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2458 Valid, 2366 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-09 01:49:09,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359207 states. [2022-02-09 01:49:15,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359207 to 199951. [2022-02-09 01:49:15,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199951 states, 199760 states have (on average 2.9087605126151383) internal successors, (581054), 199950 states have internal predecessors, (581054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:49:17,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199951 states to 199951 states and 581054 transitions. [2022-02-09 01:49:17,495 INFO L78 Accepts]: Start accepts. Automaton has 199951 states and 581054 transitions. Word has length 123 [2022-02-09 01:49:17,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:49:17,495 INFO L470 AbstractCegarLoop]: Abstraction has 199951 states and 581054 transitions. [2022-02-09 01:49:17,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:49:17,495 INFO L276 IsEmpty]: Start isEmpty. Operand 199951 states and 581054 transitions. [2022-02-09 01:49:17,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-02-09 01:49:17,506 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:49:17,506 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] [2022-02-09 01:49:17,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-09 01:49:17,507 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:49:17,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:49:17,509 INFO L85 PathProgramCache]: Analyzing trace with hash -105773755, now seen corresponding path program 4 times [2022-02-09 01:49:17,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:49:17,509 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123219140] [2022-02-09 01:49:17,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:49:17,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:49:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:49:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:49:18,537 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:49:18,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123219140] [2022-02-09 01:49:18,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123219140] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:49:18,538 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:49:18,538 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-09 01:49:18,538 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458116115] [2022-02-09 01:49:18,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:49:18,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:49:18,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:49:18,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:49:18,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:49:18,539 INFO L87 Difference]: Start difference. First operand 199951 states and 581054 transitions. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:49:22,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:49:22,311 INFO L93 Difference]: Finished difference Result 375991 states and 1081705 transitions. [2022-02-09 01:49:22,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 01:49:22,312 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2022-02-09 01:49:22,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:49:24,094 INFO L225 Difference]: With dead ends: 375991 [2022-02-09 01:49:24,094 INFO L226 Difference]: Without dead ends: 375991 [2022-02-09 01:49:24,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:49:24,095 INFO L933 BasicCegarLoop]: 626 mSDtfsCounter, 2493 mSDsluCounter, 1697 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2493 SdHoareTripleChecker+Valid, 2310 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-09 01:49:24,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2493 Valid, 2310 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-09 01:49:24,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375991 states. [2022-02-09 01:49:30,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375991 to 199951. [2022-02-09 01:49:30,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199951 states, 199760 states have (on average 2.9087605126151383) internal successors, (581054), 199950 states have internal predecessors, (581054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:49:31,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199951 states to 199951 states and 581054 transitions. [2022-02-09 01:49:31,596 INFO L78 Accepts]: Start accepts. Automaton has 199951 states and 581054 transitions. Word has length 123 [2022-02-09 01:49:31,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:49:31,596 INFO L470 AbstractCegarLoop]: Abstraction has 199951 states and 581054 transitions. [2022-02-09 01:49:31,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:49:31,596 INFO L276 IsEmpty]: Start isEmpty. Operand 199951 states and 581054 transitions. [2022-02-09 01:49:31,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-02-09 01:49:31,606 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:49:31,606 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] [2022-02-09 01:49:31,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-09 01:49:31,606 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:49:31,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:49:31,607 INFO L85 PathProgramCache]: Analyzing trace with hash 516370105, now seen corresponding path program 5 times [2022-02-09 01:49:31,607 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:49:31,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669120125] [2022-02-09 01:49:31,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:49:31,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:49:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:49:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:49:31,867 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:49:31,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669120125] [2022-02-09 01:49:31,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669120125] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:49:31,867 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:49:31,867 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-09 01:49:31,867 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091196633] [2022-02-09 01:49:31,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:49:31,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:49:31,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:49:31,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:49:31,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:49:31,870 INFO L87 Difference]: Start difference. First operand 199951 states and 581054 transitions. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:49:35,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:49:35,753 INFO L93 Difference]: Finished difference Result 412953 states and 1175475 transitions. [2022-02-09 01:49:35,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 01:49:35,753 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2022-02-09 01:49:35,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:49:37,736 INFO L225 Difference]: With dead ends: 412953 [2022-02-09 01:49:37,736 INFO L226 Difference]: Without dead ends: 412953 [2022-02-09 01:49:37,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:49:37,737 INFO L933 BasicCegarLoop]: 674 mSDtfsCounter, 2637 mSDsluCounter, 2112 mSDsCounter, 0 mSdLazyCounter, 1645 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2637 SdHoareTripleChecker+Valid, 2766 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:49:37,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2637 Valid, 2766 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1645 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-09 01:49:38,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412953 states. [2022-02-09 01:49:44,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412953 to 200026. [2022-02-09 01:49:45,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200026 states, 199835 states have (on average 2.9087897515450245) internal successors, (581278), 200025 states have internal predecessors, (581278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:49:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200026 states to 200026 states and 581278 transitions. [2022-02-09 01:49:46,214 INFO L78 Accepts]: Start accepts. Automaton has 200026 states and 581278 transitions. Word has length 123 [2022-02-09 01:49:46,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:49:46,214 INFO L470 AbstractCegarLoop]: Abstraction has 200026 states and 581278 transitions. [2022-02-09 01:49:46,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:49:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 200026 states and 581278 transitions. [2022-02-09 01:49:46,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-02-09 01:49:46,225 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:49:46,225 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] [2022-02-09 01:49:46,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-09 01:49:46,225 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:49:46,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:49:46,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1973980545, now seen corresponding path program 6 times [2022-02-09 01:49:46,226 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:49:46,226 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455976123] [2022-02-09 01:49:46,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:49:46,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:49:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:49:46,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:49:46,874 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:49:46,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455976123] [2022-02-09 01:49:46,874 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455976123] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:49:46,875 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:49:46,875 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-09 01:49:46,875 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498024517] [2022-02-09 01:49:46,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:49:46,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:49:46,875 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:49:46,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:49:46,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:49:46,876 INFO L87 Difference]: Start difference. First operand 200026 states and 581278 transitions. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:49:49,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:49:49,393 INFO L93 Difference]: Finished difference Result 251112 states and 710012 transitions. [2022-02-09 01:49:49,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 01:49:49,393 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2022-02-09 01:49:49,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:49:50,247 INFO L225 Difference]: With dead ends: 251112 [2022-02-09 01:49:50,247 INFO L226 Difference]: Without dead ends: 251112 [2022-02-09 01:49:50,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:49:50,248 INFO L933 BasicCegarLoop]: 645 mSDtfsCounter, 2295 mSDsluCounter, 1839 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2295 SdHoareTripleChecker+Valid, 2468 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-09 01:49:50,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2295 Valid, 2468 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-09 01:49:50,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251112 states. [2022-02-09 01:49:55,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251112 to 199951. [2022-02-09 01:49:55,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199951 states, 199760 states have (on average 2.9087605126151383) internal successors, (581054), 199950 states have internal predecessors, (581054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:49:56,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199951 states to 199951 states and 581054 transitions. [2022-02-09 01:49:56,485 INFO L78 Accepts]: Start accepts. Automaton has 199951 states and 581054 transitions. Word has length 123 [2022-02-09 01:49:56,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:49:56,486 INFO L470 AbstractCegarLoop]: Abstraction has 199951 states and 581054 transitions. [2022-02-09 01:49:56,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:49:56,486 INFO L276 IsEmpty]: Start isEmpty. Operand 199951 states and 581054 transitions. [2022-02-09 01:49:56,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-02-09 01:49:56,497 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:49:56,497 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] [2022-02-09 01:49:56,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-09 01:49:56,497 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:49:56,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:49:56,498 INFO L85 PathProgramCache]: Analyzing trace with hash 2006491061, now seen corresponding path program 7 times [2022-02-09 01:49:56,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:49:56,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451151666] [2022-02-09 01:49:56,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:49:56,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:49:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:49:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:49:56,765 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:49:56,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451151666] [2022-02-09 01:49:56,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451151666] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:49:56,766 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:49:56,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-09 01:49:56,766 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695707416] [2022-02-09 01:49:56,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:49:56,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:49:56,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:49:56,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:49:56,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:49:56,767 INFO L87 Difference]: Start difference. First operand 199951 states and 581054 transitions. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:49:59,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:49:59,307 INFO L93 Difference]: Finished difference Result 214829 states and 619217 transitions. [2022-02-09 01:49:59,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 01:49:59,308 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2022-02-09 01:49:59,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:50:00,100 INFO L225 Difference]: With dead ends: 214829 [2022-02-09 01:50:00,100 INFO L226 Difference]: Without dead ends: 214829 [2022-02-09 01:50:00,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:50:00,101 INFO L933 BasicCegarLoop]: 584 mSDtfsCounter, 2334 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2334 SdHoareTripleChecker+Valid, 2424 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-09 01:50:00,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2334 Valid, 2424 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-09 01:50:00,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214829 states. [2022-02-09 01:50:04,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214829 to 199951. [2022-02-09 01:50:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199951 states, 199760 states have (on average 2.9087605126151383) internal successors, (581054), 199950 states have internal predecessors, (581054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:50:06,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199951 states to 199951 states and 581054 transitions. [2022-02-09 01:50:06,942 INFO L78 Accepts]: Start accepts. Automaton has 199951 states and 581054 transitions. Word has length 123 [2022-02-09 01:50:06,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:50:06,942 INFO L470 AbstractCegarLoop]: Abstraction has 199951 states and 581054 transitions. [2022-02-09 01:50:06,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:50:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 199951 states and 581054 transitions. [2022-02-09 01:50:06,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-02-09 01:50:06,957 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:50:06,962 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] [2022-02-09 01:50:06,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-09 01:50:06,962 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:50:06,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:50:06,962 INFO L85 PathProgramCache]: Analyzing trace with hash 133777265, now seen corresponding path program 8 times [2022-02-09 01:50:06,963 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:50:06,963 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103405665] [2022-02-09 01:50:06,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:50:06,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:50:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:50:07,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:50:07,339 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:50:07,339 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103405665] [2022-02-09 01:50:07,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103405665] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:50:07,339 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:50:07,339 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-09 01:50:07,339 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249777160] [2022-02-09 01:50:07,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:50:07,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:50:07,339 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:50:07,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:50:07,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:50:07,340 INFO L87 Difference]: Start difference. First operand 199951 states and 581054 transitions. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:50:11,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:50:11,637 INFO L93 Difference]: Finished difference Result 365545 states and 1057726 transitions. [2022-02-09 01:50:11,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 01:50:11,637 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2022-02-09 01:50:11,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:50:13,037 INFO L225 Difference]: With dead ends: 365545 [2022-02-09 01:50:13,037 INFO L226 Difference]: Without dead ends: 365545 [2022-02-09 01:50:13,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:50:13,038 INFO L933 BasicCegarLoop]: 642 mSDtfsCounter, 2313 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2313 SdHoareTripleChecker+Valid, 2279 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:50:13,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2313 Valid, 2279 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-09 01:50:13,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365545 states. [2022-02-09 01:50:19,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365545 to 200026. [2022-02-09 01:50:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200026 states, 199835 states have (on average 2.9087897515450245) internal successors, (581278), 200025 states have internal predecessors, (581278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:50:20,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200026 states to 200026 states and 581278 transitions. [2022-02-09 01:50:20,663 INFO L78 Accepts]: Start accepts. Automaton has 200026 states and 581278 transitions. Word has length 123 [2022-02-09 01:50:20,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:50:20,663 INFO L470 AbstractCegarLoop]: Abstraction has 200026 states and 581278 transitions. [2022-02-09 01:50:20,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:50:20,664 INFO L276 IsEmpty]: Start isEmpty. Operand 200026 states and 581278 transitions. [2022-02-09 01:50:20,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-02-09 01:50:20,674 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:50:20,674 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] [2022-02-09 01:50:20,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-09 01:50:20,674 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:50:20,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:50:20,674 INFO L85 PathProgramCache]: Analyzing trace with hash 450963799, now seen corresponding path program 9 times [2022-02-09 01:50:20,674 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:50:20,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408977901] [2022-02-09 01:50:20,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:50:20,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:50:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:50:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:50:20,916 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:50:20,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408977901] [2022-02-09 01:50:20,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408977901] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:50:20,916 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:50:20,916 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-09 01:50:20,916 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344758101] [2022-02-09 01:50:20,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:50:20,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:50:20,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:50:20,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:50:20,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:50:20,917 INFO L87 Difference]: Start difference. First operand 200026 states and 581278 transitions. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:50:23,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:50:23,663 INFO L93 Difference]: Finished difference Result 231984 states and 660042 transitions. [2022-02-09 01:50:23,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 01:50:23,663 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2022-02-09 01:50:23,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:50:24,477 INFO L225 Difference]: With dead ends: 231984 [2022-02-09 01:50:24,477 INFO L226 Difference]: Without dead ends: 231984 [2022-02-09 01:50:24,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:50:24,478 INFO L933 BasicCegarLoop]: 620 mSDtfsCounter, 2258 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2258 SdHoareTripleChecker+Valid, 2172 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-09 01:50:24,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2258 Valid, 2172 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-09 01:50:25,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231984 states. [2022-02-09 01:50:29,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231984 to 199951. [2022-02-09 01:50:30,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199951 states, 199760 states have (on average 2.9087605126151383) internal successors, (581054), 199950 states have internal predecessors, (581054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:50:31,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199951 states to 199951 states and 581054 transitions. [2022-02-09 01:50:31,671 INFO L78 Accepts]: Start accepts. Automaton has 199951 states and 581054 transitions. Word has length 123 [2022-02-09 01:50:31,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:50:31,672 INFO L470 AbstractCegarLoop]: Abstraction has 199951 states and 581054 transitions. [2022-02-09 01:50:31,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:50:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 199951 states and 581054 transitions. [2022-02-09 01:50:31,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-02-09 01:50:31,696 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:50:31,697 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] [2022-02-09 01:50:31,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-09 01:50:31,697 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:50:31,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:50:31,698 INFO L85 PathProgramCache]: Analyzing trace with hash 376523867, now seen corresponding path program 10 times [2022-02-09 01:50:31,698 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:50:31,698 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411907973] [2022-02-09 01:50:31,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:50:31,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:50:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:50:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:50:32,558 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:50:32,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411907973] [2022-02-09 01:50:32,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411907973] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:50:32,558 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:50:32,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-09 01:50:32,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819460687] [2022-02-09 01:50:32,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:50:32,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:50:32,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:50:32,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:50:32,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:50:32,559 INFO L87 Difference]: Start difference. First operand 199951 states and 581054 transitions. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:50:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:50:35,407 INFO L93 Difference]: Finished difference Result 260201 states and 733877 transitions. [2022-02-09 01:50:35,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 01:50:35,407 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2022-02-09 01:50:35,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:50:36,361 INFO L225 Difference]: With dead ends: 260201 [2022-02-09 01:50:36,362 INFO L226 Difference]: Without dead ends: 260201 [2022-02-09 01:50:36,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:50:36,362 INFO L933 BasicCegarLoop]: 704 mSDtfsCounter, 2304 mSDsluCounter, 1890 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2304 SdHoareTripleChecker+Valid, 2579 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-09 01:50:36,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2304 Valid, 2579 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-09 01:50:37,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260201 states. [2022-02-09 01:50:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260201 to 196791. [2022-02-09 01:50:41,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196791 states, 196600 states have (on average 2.9075483214649034) internal successors, (571624), 196790 states have internal predecessors, (571624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:50:42,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196791 states to 196791 states and 571624 transitions. [2022-02-09 01:50:42,721 INFO L78 Accepts]: Start accepts. Automaton has 196791 states and 571624 transitions. Word has length 123 [2022-02-09 01:50:42,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:50:42,721 INFO L470 AbstractCegarLoop]: Abstraction has 196791 states and 571624 transitions. [2022-02-09 01:50:42,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:50:42,722 INFO L276 IsEmpty]: Start isEmpty. Operand 196791 states and 571624 transitions. [2022-02-09 01:50:42,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-02-09 01:50:42,730 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:50:42,730 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] [2022-02-09 01:50:42,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-09 01:50:42,731 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:50:42,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:50:42,731 INFO L85 PathProgramCache]: Analyzing trace with hash 693710401, now seen corresponding path program 11 times [2022-02-09 01:50:42,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:50:42,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668121006] [2022-02-09 01:50:42,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:50:42,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:50:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:50:42,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:50:42,962 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:50:42,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668121006] [2022-02-09 01:50:42,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668121006] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:50:42,962 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:50:42,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-09 01:50:42,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794930277] [2022-02-09 01:50:42,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:50:42,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:50:42,963 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:50:42,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:50:42,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:50:42,963 INFO L87 Difference]: Start difference. First operand 196791 states and 571624 transitions. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:50:45,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:50:45,909 INFO L93 Difference]: Finished difference Result 276985 states and 773699 transitions. [2022-02-09 01:50:45,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 01:50:45,909 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2022-02-09 01:50:45,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:50:46,866 INFO L225 Difference]: With dead ends: 276985 [2022-02-09 01:50:46,866 INFO L226 Difference]: Without dead ends: 276985 [2022-02-09 01:50:46,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:50:46,867 INFO L933 BasicCegarLoop]: 689 mSDtfsCounter, 2420 mSDsluCounter, 2197 mSDsCounter, 0 mSdLazyCounter, 1714 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2420 SdHoareTripleChecker+Valid, 2866 SdHoareTripleChecker+Invalid, 1720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-09 01:50:46,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2420 Valid, 2866 Invalid, 1720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1714 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-09 01:50:47,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276985 states. [2022-02-09 01:50:52,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276985 to 196716. [2022-02-09 01:50:52,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196716 states, 196525 states have (on average 2.9075181274646993) internal successors, (571400), 196715 states have internal predecessors, (571400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:50:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196716 states to 196716 states and 571400 transitions. [2022-02-09 01:50:53,897 INFO L78 Accepts]: Start accepts. Automaton has 196716 states and 571400 transitions. Word has length 123 [2022-02-09 01:50:53,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:50:53,897 INFO L470 AbstractCegarLoop]: Abstraction has 196716 states and 571400 transitions. [2022-02-09 01:50:53,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:50:53,897 INFO L276 IsEmpty]: Start isEmpty. Operand 196716 states and 571400 transitions. [2022-02-09 01:50:53,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-02-09 01:50:53,907 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:50:53,907 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] [2022-02-09 01:50:53,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-09 01:50:53,907 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:50:53,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:50:53,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1315854261, now seen corresponding path program 12 times [2022-02-09 01:50:53,907 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:50:53,907 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413004643] [2022-02-09 01:50:53,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:50:53,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:50:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:50:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:50:54,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:50:54,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413004643] [2022-02-09 01:50:54,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413004643] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:50:54,734 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:50:54,734 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-09 01:50:54,734 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160923616] [2022-02-09 01:50:54,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:50:54,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:50:54,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:50:54,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:50:54,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:50:54,735 INFO L87 Difference]: Start difference. First operand 196716 states and 571400 transitions. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:50:58,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:50:58,043 INFO L93 Difference]: Finished difference Result 265711 states and 744158 transitions. [2022-02-09 01:50:58,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 01:50:58,044 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2022-02-09 01:50:58,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:50:59,011 INFO L225 Difference]: With dead ends: 265711 [2022-02-09 01:50:59,011 INFO L226 Difference]: Without dead ends: 265711 [2022-02-09 01:50:59,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:50:59,012 INFO L933 BasicCegarLoop]: 679 mSDtfsCounter, 2381 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2381 SdHoareTripleChecker+Valid, 2770 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:50:59,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2381 Valid, 2770 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-09 01:50:59,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265711 states. [2022-02-09 01:51:03,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265711 to 193481. [2022-02-09 01:51:04,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193481 states, 193290 states have (on average 2.906234155931502) internal successors, (561746), 193480 states have internal predecessors, (561746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:05,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193481 states to 193481 states and 561746 transitions. [2022-02-09 01:51:05,282 INFO L78 Accepts]: Start accepts. Automaton has 193481 states and 561746 transitions. Word has length 123 [2022-02-09 01:51:05,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:51:05,283 INFO L470 AbstractCegarLoop]: Abstraction has 193481 states and 561746 transitions. [2022-02-09 01:51:05,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:05,283 INFO L276 IsEmpty]: Start isEmpty. Operand 193481 states and 561746 transitions. [2022-02-09 01:51:05,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-02-09 01:51:05,291 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:51:05,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] [2022-02-09 01:51:05,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-09 01:51:05,292 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:51:05,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:51:05,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1521502595, now seen corresponding path program 13 times [2022-02-09 01:51:05,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:51:05,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544256238] [2022-02-09 01:51:05,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:51:05,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:51:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:51:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:51:05,523 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:51:05,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544256238] [2022-02-09 01:51:05,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544256238] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:51:05,523 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:51:05,523 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-09 01:51:05,523 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88228011] [2022-02-09 01:51:05,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:51:05,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 01:51:05,523 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:51:05,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 01:51:05,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-02-09 01:51:05,524 INFO L87 Difference]: Start difference. First operand 193481 states and 561746 transitions. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:07,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:51:07,206 INFO L93 Difference]: Finished difference Result 103870 states and 278695 transitions. [2022-02-09 01:51:07,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 01:51:07,206 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2022-02-09 01:51:07,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:51:07,491 INFO L225 Difference]: With dead ends: 103870 [2022-02-09 01:51:07,492 INFO L226 Difference]: Without dead ends: 103870 [2022-02-09 01:51:07,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:51:07,492 INFO L933 BasicCegarLoop]: 650 mSDtfsCounter, 2005 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2005 SdHoareTripleChecker+Valid, 2827 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-09 01:51:07,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2005 Valid, 2827 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-09 01:51:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103870 states. [2022-02-09 01:51:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103870 to 68800. [2022-02-09 01:51:09,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68800 states, 68694 states have (on average 2.7730078318339304) internal successors, (190489), 68799 states have internal predecessors, (190489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68800 states to 68800 states and 190489 transitions. [2022-02-09 01:51:09,352 INFO L78 Accepts]: Start accepts. Automaton has 68800 states and 190489 transitions. Word has length 123 [2022-02-09 01:51:09,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:51:09,352 INFO L470 AbstractCegarLoop]: Abstraction has 68800 states and 190489 transitions. [2022-02-09 01:51:09,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 68800 states and 190489 transitions. [2022-02-09 01:51:09,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-02-09 01:51:09,361 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:51:09,361 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] [2022-02-09 01:51:09,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-02-09 01:51:09,361 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:51:09,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:51:09,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2016091303, now seen corresponding path program 1 times [2022-02-09 01:51:09,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:51:09,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433596014] [2022-02-09 01:51:09,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:51:09,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:51:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:51:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:51:09,450 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:51:09,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433596014] [2022-02-09 01:51:09,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433596014] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:51:09,450 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:51:09,450 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:51:09,450 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223971386] [2022-02-09 01:51:09,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:51:09,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:51:09,450 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:51:09,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:51:09,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:51:09,451 INFO L87 Difference]: Start difference. First operand 68800 states and 190489 transitions. Second operand has 6 states, 5 states have (on average 25.2) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:10,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:51:10,488 INFO L93 Difference]: Finished difference Result 75616 states and 209258 transitions. [2022-02-09 01:51:10,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:51:10,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 25.2) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2022-02-09 01:51:10,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:51:10,656 INFO L225 Difference]: With dead ends: 75616 [2022-02-09 01:51:10,656 INFO L226 Difference]: Without dead ends: 74522 [2022-02-09 01:51:10,657 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-02-09 01:51:10,657 INFO L933 BasicCegarLoop]: 439 mSDtfsCounter, 226 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-09 01:51:10,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 1177 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-09 01:51:10,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74522 states. [2022-02-09 01:51:12,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74522 to 69622. [2022-02-09 01:51:12,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69622 states, 69522 states have (on average 2.7710940421737003) internal successors, (192652), 69621 states have internal predecessors, (192652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69622 states to 69622 states and 192652 transitions. [2022-02-09 01:51:12,320 INFO L78 Accepts]: Start accepts. Automaton has 69622 states and 192652 transitions. Word has length 126 [2022-02-09 01:51:12,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:51:12,320 INFO L470 AbstractCegarLoop]: Abstraction has 69622 states and 192652 transitions. [2022-02-09 01:51:12,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.2) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:12,320 INFO L276 IsEmpty]: Start isEmpty. Operand 69622 states and 192652 transitions. [2022-02-09 01:51:12,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-02-09 01:51:12,330 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:51:12,330 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] [2022-02-09 01:51:12,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-02-09 01:51:12,330 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:51:12,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:51:12,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1427916807, now seen corresponding path program 1 times [2022-02-09 01:51:12,330 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:51:12,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905480713] [2022-02-09 01:51:12,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:51:12,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:51:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:51:12,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:51:12,393 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:51:12,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905480713] [2022-02-09 01:51:12,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905480713] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:51:12,394 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:51:12,394 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:51:12,394 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577309459] [2022-02-09 01:51:12,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:51:12,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-09 01:51:12,394 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:51:12,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-09 01:51:12,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-09 01:51:12,395 INFO L87 Difference]: Start difference. First operand 69622 states and 192652 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:12,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:51:12,473 INFO L93 Difference]: Finished difference Result 17071 states and 46269 transitions. [2022-02-09 01:51:12,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:51:12,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2022-02-09 01:51:12,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:51:12,725 INFO L225 Difference]: With dead ends: 17071 [2022-02-09 01:51:12,726 INFO L226 Difference]: Without dead ends: 17071 [2022-02-09 01:51:12,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-09 01:51:12,745 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 310 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:51:12,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [310 Valid, 1199 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:51:12,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17071 states. [2022-02-09 01:51:12,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17071 to 17071. [2022-02-09 01:51:12,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17071 states, 17051 states have (on average 2.7135651867925636) internal successors, (46269), 17070 states have internal predecessors, (46269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:12,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17071 states to 17071 states and 46269 transitions. [2022-02-09 01:51:12,981 INFO L78 Accepts]: Start accepts. Automaton has 17071 states and 46269 transitions. Word has length 126 [2022-02-09 01:51:12,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:51:12,981 INFO L470 AbstractCegarLoop]: Abstraction has 17071 states and 46269 transitions. [2022-02-09 01:51:12,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:12,981 INFO L276 IsEmpty]: Start isEmpty. Operand 17071 states and 46269 transitions. [2022-02-09 01:51:12,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-02-09 01:51:12,987 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:51:12,987 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] [2022-02-09 01:51:12,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-02-09 01:51:12,987 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting my_callbackErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:51:12,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:51:12,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1674896954, now seen corresponding path program 1 times [2022-02-09 01:51:12,988 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:51:12,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487669329] [2022-02-09 01:51:12,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:51:12,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:51:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:51:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:51:13,062 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:51:13,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487669329] [2022-02-09 01:51:13,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487669329] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:51:13,062 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:51:13,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:51:13,062 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522046250] [2022-02-09 01:51:13,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:51:13,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:51:13,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:51:13,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:51:13,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:51:13,064 INFO L87 Difference]: Start difference. First operand 17071 states and 46269 transitions. Second operand has 6 states, 5 states have (on average 25.2) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:13,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:51:13,361 INFO L93 Difference]: Finished difference Result 17385 states and 47036 transitions. [2022-02-09 01:51:13,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:51:13,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 25.2) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2022-02-09 01:51:13,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:51:13,389 INFO L225 Difference]: With dead ends: 17385 [2022-02-09 01:51:13,389 INFO L226 Difference]: Without dead ends: 17356 [2022-02-09 01:51:13,390 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-02-09 01:51:13,390 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 130 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-09 01:51:13,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 683 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-09 01:51:13,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17356 states. [2022-02-09 01:51:13,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17356 to 17156. [2022-02-09 01:51:13,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17156 states, 17136 states have (on average 2.710901027077498) internal successors, (46454), 17155 states have internal predecessors, (46454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:13,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17156 states to 17156 states and 46454 transitions. [2022-02-09 01:51:13,807 INFO L78 Accepts]: Start accepts. Automaton has 17156 states and 46454 transitions. Word has length 126 [2022-02-09 01:51:13,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:51:13,807 INFO L470 AbstractCegarLoop]: Abstraction has 17156 states and 46454 transitions. [2022-02-09 01:51:13,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.2) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:13,807 INFO L276 IsEmpty]: Start isEmpty. Operand 17156 states and 46454 transitions. [2022-02-09 01:51:13,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-02-09 01:51:13,816 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:51:13,816 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] [2022-02-09 01:51:13,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-02-09 01:51:13,816 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:51:13,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:51:13,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1075659748, now seen corresponding path program 1 times [2022-02-09 01:51:13,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:51:13,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125396082] [2022-02-09 01:51:13,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:51:13,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:51:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:51:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:51:14,230 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:51:14,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125396082] [2022-02-09 01:51:14,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125396082] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:51:14,230 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:51:14,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-09 01:51:14,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010618428] [2022-02-09 01:51:14,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:51:14,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-09 01:51:14,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:51:14,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-09 01:51:14,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-02-09 01:51:14,231 INFO L87 Difference]: Start difference. First operand 17156 states and 46454 transitions. Second operand has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:14,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:51:14,748 INFO L93 Difference]: Finished difference Result 17056 states and 46184 transitions. [2022-02-09 01:51:14,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-09 01:51:14,748 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2022-02-09 01:51:14,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:51:14,776 INFO L225 Difference]: With dead ends: 17056 [2022-02-09 01:51:14,776 INFO L226 Difference]: Without dead ends: 17056 [2022-02-09 01:51:14,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=347, Unknown=0, NotChecked=0, Total=506 [2022-02-09 01:51:14,777 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 939 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-09 01:51:14,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [939 Valid, 1090 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-09 01:51:14,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17056 states. [2022-02-09 01:51:15,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17056 to 16826. [2022-02-09 01:51:15,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16826 states, 16810 states have (on average 2.711481261154075) internal successors, (45580), 16825 states have internal predecessors, (45580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16826 states to 16826 states and 45580 transitions. [2022-02-09 01:51:15,087 INFO L78 Accepts]: Start accepts. Automaton has 16826 states and 45580 transitions. Word has length 128 [2022-02-09 01:51:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:51:15,087 INFO L470 AbstractCegarLoop]: Abstraction has 16826 states and 45580 transitions. [2022-02-09 01:51:15,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:15,087 INFO L276 IsEmpty]: Start isEmpty. Operand 16826 states and 45580 transitions. [2022-02-09 01:51:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-02-09 01:51:15,093 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:51:15,094 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] [2022-02-09 01:51:15,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-02-09 01:51:15,094 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:51:15,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:51:15,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1402481070, now seen corresponding path program 1 times [2022-02-09 01:51:15,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:51:15,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605134643] [2022-02-09 01:51:15,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:51:15,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:51:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:51:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:51:15,469 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:51:15,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605134643] [2022-02-09 01:51:15,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605134643] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:51:15,470 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:51:15,470 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-09 01:51:15,470 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990505934] [2022-02-09 01:51:15,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:51:15,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-09 01:51:15,470 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:51:15,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-09 01:51:15,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-02-09 01:51:15,470 INFO L87 Difference]: Start difference. First operand 16826 states and 45580 transitions. Second operand has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:16,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:51:16,735 INFO L93 Difference]: Finished difference Result 18222 states and 48441 transitions. [2022-02-09 01:51:16,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 01:51:16,735 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2022-02-09 01:51:16,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:51:16,768 INFO L225 Difference]: With dead ends: 18222 [2022-02-09 01:51:16,768 INFO L226 Difference]: Without dead ends: 18222 [2022-02-09 01:51:16,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:51:16,770 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 1137 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-09 01:51:16,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1137 Valid, 1650 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-09 01:51:16,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18222 states. [2022-02-09 01:51:16,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18222 to 16988. [2022-02-09 01:51:17,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16988 states, 16972 states have (on average 2.7121140702333255) internal successors, (46030), 16987 states have internal predecessors, (46030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:17,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16988 states to 16988 states and 46030 transitions. [2022-02-09 01:51:17,046 INFO L78 Accepts]: Start accepts. Automaton has 16988 states and 46030 transitions. Word has length 128 [2022-02-09 01:51:17,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:51:17,046 INFO L470 AbstractCegarLoop]: Abstraction has 16988 states and 46030 transitions. [2022-02-09 01:51:17,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:17,046 INFO L276 IsEmpty]: Start isEmpty. Operand 16988 states and 46030 transitions. [2022-02-09 01:51:17,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-02-09 01:51:17,052 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:51:17,052 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] [2022-02-09 01:51:17,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-02-09 01:51:17,052 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:51:17,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:51:17,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1402213230, now seen corresponding path program 2 times [2022-02-09 01:51:17,053 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:51:17,053 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121778939] [2022-02-09 01:51:17,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:51:17,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:51:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:51:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:51:17,548 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:51:17,548 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121778939] [2022-02-09 01:51:17,548 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121778939] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:51:17,549 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:51:17,549 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-09 01:51:17,549 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808738345] [2022-02-09 01:51:17,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:51:17,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-09 01:51:17,549 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:51:17,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-09 01:51:17,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-02-09 01:51:17,550 INFO L87 Difference]: Start difference. First operand 16988 states and 46030 transitions. Second operand has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:18,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:51:18,507 INFO L93 Difference]: Finished difference Result 18162 states and 48283 transitions. [2022-02-09 01:51:18,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 01:51:18,507 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2022-02-09 01:51:18,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:51:18,539 INFO L225 Difference]: With dead ends: 18162 [2022-02-09 01:51:18,539 INFO L226 Difference]: Without dead ends: 18162 [2022-02-09 01:51:18,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:51:18,539 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 955 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-09 01:51:18,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [955 Valid, 1491 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-09 01:51:18,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18162 states. [2022-02-09 01:51:18,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18162 to 17042. [2022-02-09 01:51:18,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17042 states, 17026 states have (on average 2.7123223305532713) internal successors, (46180), 17041 states have internal predecessors, (46180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:18,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17042 states to 17042 states and 46180 transitions. [2022-02-09 01:51:18,949 INFO L78 Accepts]: Start accepts. Automaton has 17042 states and 46180 transitions. Word has length 128 [2022-02-09 01:51:18,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:51:18,950 INFO L470 AbstractCegarLoop]: Abstraction has 17042 states and 46180 transitions. [2022-02-09 01:51:18,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:18,950 INFO L276 IsEmpty]: Start isEmpty. Operand 17042 states and 46180 transitions. [2022-02-09 01:51:18,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-02-09 01:51:18,957 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:51:18,957 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] [2022-02-09 01:51:18,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-02-09 01:51:18,957 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:51:18,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:51:18,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2065807716, now seen corresponding path program 3 times [2022-02-09 01:51:18,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:51:18,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684558392] [2022-02-09 01:51:18,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:51:18,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:51:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:51:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:51:19,325 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:51:19,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684558392] [2022-02-09 01:51:19,325 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684558392] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:51:19,326 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:51:19,326 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-09 01:51:19,326 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620802686] [2022-02-09 01:51:19,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:51:19,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-09 01:51:19,326 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:51:19,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-09 01:51:19,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-02-09 01:51:19,327 INFO L87 Difference]: Start difference. First operand 17042 states and 46180 transitions. Second operand has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:20,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:51:20,538 INFO L93 Difference]: Finished difference Result 19091 states and 50627 transitions. [2022-02-09 01:51:20,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 01:51:20,539 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2022-02-09 01:51:20,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:51:20,573 INFO L225 Difference]: With dead ends: 19091 [2022-02-09 01:51:20,573 INFO L226 Difference]: Without dead ends: 19091 [2022-02-09 01:51:20,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:51:20,574 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 853 mSDsluCounter, 1636 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-09 01:51:20,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [853 Valid, 1976 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1798 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-09 01:51:20,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19091 states. [2022-02-09 01:51:20,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19091 to 17218. [2022-02-09 01:51:20,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17218 states, 17202 states have (on average 2.713172886873619) internal successors, (46672), 17217 states have internal predecessors, (46672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17218 states to 17218 states and 46672 transitions. [2022-02-09 01:51:20,916 INFO L78 Accepts]: Start accepts. Automaton has 17218 states and 46672 transitions. Word has length 128 [2022-02-09 01:51:20,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:51:20,916 INFO L470 AbstractCegarLoop]: Abstraction has 17218 states and 46672 transitions. [2022-02-09 01:51:20,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 17218 states and 46672 transitions. [2022-02-09 01:51:20,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-02-09 01:51:20,923 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:51:20,923 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] [2022-02-09 01:51:20,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-02-09 01:51:20,923 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:51:20,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:51:20,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2066075556, now seen corresponding path program 4 times [2022-02-09 01:51:20,924 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:51:20,924 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335948621] [2022-02-09 01:51:20,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:51:20,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:51:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:51:21,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:51:21,377 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:51:21,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335948621] [2022-02-09 01:51:21,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335948621] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:51:21,378 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:51:21,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-09 01:51:21,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579019914] [2022-02-09 01:51:21,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:51:21,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-09 01:51:21,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:51:21,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-09 01:51:21,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-02-09 01:51:21,379 INFO L87 Difference]: Start difference. First operand 17218 states and 46672 transitions. Second operand has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:22,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:51:22,278 INFO L93 Difference]: Finished difference Result 19071 states and 50581 transitions. [2022-02-09 01:51:22,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 01:51:22,279 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2022-02-09 01:51:22,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:51:22,311 INFO L225 Difference]: With dead ends: 19071 [2022-02-09 01:51:22,311 INFO L226 Difference]: Without dead ends: 19071 [2022-02-09 01:51:22,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:51:22,312 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 921 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-09 01:51:22,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [921 Valid, 1214 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-09 01:51:22,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19071 states. [2022-02-09 01:51:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19071 to 17056. [2022-02-09 01:51:22,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17056 states, 17040 states have (on average 2.7125586854460093) internal successors, (46222), 17055 states have internal predecessors, (46222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17056 states to 17056 states and 46222 transitions. [2022-02-09 01:51:22,608 INFO L78 Accepts]: Start accepts. Automaton has 17056 states and 46222 transitions. Word has length 128 [2022-02-09 01:51:22,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:51:22,608 INFO L470 AbstractCegarLoop]: Abstraction has 17056 states and 46222 transitions. [2022-02-09 01:51:22,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:22,608 INFO L276 IsEmpty]: Start isEmpty. Operand 17056 states and 46222 transitions. [2022-02-09 01:51:22,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-02-09 01:51:22,615 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:51:22,615 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] [2022-02-09 01:51:22,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-02-09 01:51:22,615 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:51:22,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:51:22,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1604492602, now seen corresponding path program 5 times [2022-02-09 01:51:22,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:51:22,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650574688] [2022-02-09 01:51:22,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:51:22,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:51:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:51:22,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:51:22,938 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:51:22,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650574688] [2022-02-09 01:51:22,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650574688] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:51:22,938 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:51:22,939 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-09 01:51:22,939 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641067330] [2022-02-09 01:51:22,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:51:22,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-09 01:51:22,939 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:51:22,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-09 01:51:22,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-02-09 01:51:22,940 INFO L87 Difference]: Start difference. First operand 17056 states and 46222 transitions. Second operand has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:24,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:51:24,095 INFO L93 Difference]: Finished difference Result 18733 states and 49707 transitions. [2022-02-09 01:51:24,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-09 01:51:24,095 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2022-02-09 01:51:24,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:51:24,128 INFO L225 Difference]: With dead ends: 18733 [2022-02-09 01:51:24,128 INFO L226 Difference]: Without dead ends: 18733 [2022-02-09 01:51:24,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=440, Unknown=0, NotChecked=0, Total=650 [2022-02-09 01:51:24,129 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 913 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-09 01:51:24,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [913 Valid, 1564 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-09 01:51:24,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18733 states. [2022-02-09 01:51:24,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18733 to 17192. [2022-02-09 01:51:24,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17192 states, 17176 states have (on average 2.713437354448067) internal successors, (46606), 17191 states have internal predecessors, (46606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:24,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17192 states to 17192 states and 46606 transitions. [2022-02-09 01:51:24,434 INFO L78 Accepts]: Start accepts. Automaton has 17192 states and 46606 transitions. Word has length 128 [2022-02-09 01:51:24,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:51:24,434 INFO L470 AbstractCegarLoop]: Abstraction has 17192 states and 46606 transitions. [2022-02-09 01:51:24,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:24,435 INFO L276 IsEmpty]: Start isEmpty. Operand 17192 states and 46606 transitions. [2022-02-09 01:51:24,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-02-09 01:51:24,441 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:51:24,441 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] [2022-02-09 01:51:24,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-02-09 01:51:24,442 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:51:24,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:51:24,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1604224762, now seen corresponding path program 6 times [2022-02-09 01:51:24,442 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:51:24,442 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22845194] [2022-02-09 01:51:24,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:51:24,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:51:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:51:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:51:24,799 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:51:24,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22845194] [2022-02-09 01:51:24,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22845194] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:51:24,799 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:51:24,799 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-09 01:51:24,799 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004157875] [2022-02-09 01:51:24,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:51:24,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-09 01:51:24,800 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:51:24,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-09 01:51:24,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-02-09 01:51:24,800 INFO L87 Difference]: Start difference. First operand 17192 states and 46606 transitions. Second operand has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:25,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:51:25,951 INFO L93 Difference]: Finished difference Result 18907 states and 50163 transitions. [2022-02-09 01:51:25,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 01:51:25,951 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2022-02-09 01:51:25,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:51:25,990 INFO L225 Difference]: With dead ends: 18907 [2022-02-09 01:51:25,990 INFO L226 Difference]: Without dead ends: 18907 [2022-02-09 01:51:25,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:51:25,991 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 893 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-09 01:51:25,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [893 Valid, 1619 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-09 01:51:26,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18907 states. [2022-02-09 01:51:26,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18907 to 17138. [2022-02-09 01:51:26,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17138 states, 17122 states have (on average 2.7132344352295292) internal successors, (46456), 17137 states have internal predecessors, (46456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17138 states to 17138 states and 46456 transitions. [2022-02-09 01:51:26,298 INFO L78 Accepts]: Start accepts. Automaton has 17138 states and 46456 transitions. Word has length 128 [2022-02-09 01:51:26,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:51:26,298 INFO L470 AbstractCegarLoop]: Abstraction has 17138 states and 46456 transitions. [2022-02-09 01:51:26,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand 17138 states and 46456 transitions. [2022-02-09 01:51:26,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-02-09 01:51:26,305 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:51:26,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] [2022-02-09 01:51:26,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-02-09 01:51:26,305 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:51:26,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:51:26,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1932607644, now seen corresponding path program 7 times [2022-02-09 01:51:26,306 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:51:26,306 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394089685] [2022-02-09 01:51:26,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:51:26,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:51:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:51:26,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:51:26,662 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:51:26,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394089685] [2022-02-09 01:51:26,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394089685] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:51:26,662 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:51:26,662 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-09 01:51:26,662 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237627731] [2022-02-09 01:51:26,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:51:26,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-09 01:51:26,662 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:51:26,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-09 01:51:26,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-02-09 01:51:26,663 INFO L87 Difference]: Start difference. First operand 17138 states and 46456 transitions. Second operand has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:51:27,674 INFO L93 Difference]: Finished difference Result 18626 states and 49438 transitions. [2022-02-09 01:51:27,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 01:51:27,674 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2022-02-09 01:51:27,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:51:27,709 INFO L225 Difference]: With dead ends: 18626 [2022-02-09 01:51:27,710 INFO L226 Difference]: Without dead ends: 18626 [2022-02-09 01:51:27,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:51:27,710 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 1064 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1064 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-09 01:51:27,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1064 Valid, 1514 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-09 01:51:27,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18626 states. [2022-02-09 01:51:27,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18626 to 17098. [2022-02-09 01:51:27,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17098 states, 17082 states have (on average 2.7132654255941926) internal successors, (46348), 17097 states have internal predecessors, (46348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:28,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17098 states to 17098 states and 46348 transitions. [2022-02-09 01:51:28,016 INFO L78 Accepts]: Start accepts. Automaton has 17098 states and 46348 transitions. Word has length 128 [2022-02-09 01:51:28,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:51:28,016 INFO L470 AbstractCegarLoop]: Abstraction has 17098 states and 46348 transitions. [2022-02-09 01:51:28,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:28,016 INFO L276 IsEmpty]: Start isEmpty. Operand 17098 states and 46348 transitions. [2022-02-09 01:51:28,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-02-09 01:51:28,023 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:51:28,023 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] [2022-02-09 01:51:28,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-02-09 01:51:28,023 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:51:28,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:51:28,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1924380312, now seen corresponding path program 8 times [2022-02-09 01:51:28,023 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:51:28,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960967082] [2022-02-09 01:51:28,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:51:28,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:51:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:51:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:51:28,378 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:51:28,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960967082] [2022-02-09 01:51:28,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960967082] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:51:28,378 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:51:28,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-09 01:51:28,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929323713] [2022-02-09 01:51:28,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:51:28,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-09 01:51:28,379 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:51:28,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-09 01:51:28,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-02-09 01:51:28,379 INFO L87 Difference]: Start difference. First operand 17098 states and 46348 transitions. Second operand has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:51:29,273 INFO L93 Difference]: Finished difference Result 18793 states and 49836 transitions. [2022-02-09 01:51:29,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 01:51:29,274 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2022-02-09 01:51:29,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:51:29,307 INFO L225 Difference]: With dead ends: 18793 [2022-02-09 01:51:29,308 INFO L226 Difference]: Without dead ends: 18793 [2022-02-09 01:51:29,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=406, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:51:29,308 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 914 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-09 01:51:29,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [914 Valid, 1222 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-09 01:51:29,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18793 states. [2022-02-09 01:51:29,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18793 to 17199. [2022-02-09 01:51:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17199 states, 17183 states have (on average 2.7136122912180642) internal successors, (46628), 17198 states have internal predecessors, (46628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17199 states to 17199 states and 46628 transitions. [2022-02-09 01:51:29,617 INFO L78 Accepts]: Start accepts. Automaton has 17199 states and 46628 transitions. Word has length 128 [2022-02-09 01:51:29,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:51:29,617 INFO L470 AbstractCegarLoop]: Abstraction has 17199 states and 46628 transitions. [2022-02-09 01:51:29,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:29,617 INFO L276 IsEmpty]: Start isEmpty. Operand 17199 states and 46628 transitions. [2022-02-09 01:51:29,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-02-09 01:51:29,624 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:51:29,624 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] [2022-02-09 01:51:29,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-02-09 01:51:29,624 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:51:29,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:51:29,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1924648152, now seen corresponding path program 9 times [2022-02-09 01:51:29,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:51:29,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981270657] [2022-02-09 01:51:29,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:51:29,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:51:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:51:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:51:30,064 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:51:30,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981270657] [2022-02-09 01:51:30,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981270657] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:51:30,064 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:51:30,064 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-09 01:51:30,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488532900] [2022-02-09 01:51:30,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:51:30,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-09 01:51:30,064 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:51:30,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-09 01:51:30,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-02-09 01:51:30,065 INFO L87 Difference]: Start difference. First operand 17199 states and 46628 transitions. Second operand has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:30,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:51:30,991 INFO L93 Difference]: Finished difference Result 18773 states and 49790 transitions. [2022-02-09 01:51:30,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 01:51:30,991 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2022-02-09 01:51:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:51:31,026 INFO L225 Difference]: With dead ends: 18773 [2022-02-09 01:51:31,026 INFO L226 Difference]: Without dead ends: 18773 [2022-02-09 01:51:31,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:51:31,027 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 969 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-09 01:51:31,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [969 Valid, 1242 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-09 01:51:31,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18773 states. [2022-02-09 01:51:31,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18773 to 17037. [2022-02-09 01:51:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17037 states, 17021 states have (on average 2.713001586275777) internal successors, (46178), 17036 states have internal predecessors, (46178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17037 states to 17037 states and 46178 transitions. [2022-02-09 01:51:31,333 INFO L78 Accepts]: Start accepts. Automaton has 17037 states and 46178 transitions. Word has length 128 [2022-02-09 01:51:31,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:51:31,333 INFO L470 AbstractCegarLoop]: Abstraction has 17037 states and 46178 transitions. [2022-02-09 01:51:31,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:31,333 INFO L276 IsEmpty]: Start isEmpty. Operand 17037 states and 46178 transitions. [2022-02-09 01:51:31,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-02-09 01:51:31,340 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:51:31,340 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] [2022-02-09 01:51:31,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-02-09 01:51:31,340 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:51:31,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:51:31,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1745920006, now seen corresponding path program 10 times [2022-02-09 01:51:31,341 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:51:31,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191404997] [2022-02-09 01:51:31,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:51:31,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:51:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:51:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:51:31,686 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:51:31,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191404997] [2022-02-09 01:51:31,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191404997] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:51:31,686 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:51:31,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-09 01:51:31,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589854212] [2022-02-09 01:51:31,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:51:31,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-09 01:51:31,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:51:31,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-09 01:51:31,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-02-09 01:51:31,687 INFO L87 Difference]: Start difference. First operand 17037 states and 46178 transitions. Second operand has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:32,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:51:32,873 INFO L93 Difference]: Finished difference Result 19190 states and 50809 transitions. [2022-02-09 01:51:32,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-09 01:51:32,874 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2022-02-09 01:51:32,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:51:32,905 INFO L225 Difference]: With dead ends: 19190 [2022-02-09 01:51:32,905 INFO L226 Difference]: Without dead ends: 19190 [2022-02-09 01:51:32,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=435, Unknown=0, NotChecked=0, Total=650 [2022-02-09 01:51:32,906 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 944 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 1865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-09 01:51:32,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [944 Valid, 1726 Invalid, 1865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-09 01:51:32,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19190 states. [2022-02-09 01:51:33,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19190 to 17173. [2022-02-09 01:51:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17173 states, 17157 states have (on average 2.713877717549688) internal successors, (46562), 17172 states have internal predecessors, (46562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:33,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17173 states to 17173 states and 46562 transitions. [2022-02-09 01:51:33,249 INFO L78 Accepts]: Start accepts. Automaton has 17173 states and 46562 transitions. Word has length 128 [2022-02-09 01:51:33,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:51:33,249 INFO L470 AbstractCegarLoop]: Abstraction has 17173 states and 46562 transitions. [2022-02-09 01:51:33,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:33,249 INFO L276 IsEmpty]: Start isEmpty. Operand 17173 states and 46562 transitions. [2022-02-09 01:51:33,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-02-09 01:51:33,255 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:51:33,255 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] [2022-02-09 01:51:33,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-02-09 01:51:33,256 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:51:33,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:51:33,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1745652166, now seen corresponding path program 11 times [2022-02-09 01:51:33,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:51:33,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211942942] [2022-02-09 01:51:33,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:51:33,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:51:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:51:33,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:51:33,629 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:51:33,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211942942] [2022-02-09 01:51:33,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211942942] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:51:33,629 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:51:33,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-09 01:51:33,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14623497] [2022-02-09 01:51:33,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:51:33,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-09 01:51:33,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:51:33,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-09 01:51:33,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-02-09 01:51:33,630 INFO L87 Difference]: Start difference. First operand 17173 states and 46562 transitions. Second operand has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:34,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:51:34,798 INFO L93 Difference]: Finished difference Result 19364 states and 51265 transitions. [2022-02-09 01:51:34,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 01:51:34,798 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2022-02-09 01:51:34,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:51:34,831 INFO L225 Difference]: With dead ends: 19364 [2022-02-09 01:51:34,831 INFO L226 Difference]: Without dead ends: 19364 [2022-02-09 01:51:34,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2022-02-09 01:51:34,831 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 800 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-09 01:51:34,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [800 Valid, 1694 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1664 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-09 01:51:34,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19364 states. [2022-02-09 01:51:35,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19364 to 17119. [2022-02-09 01:51:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17119 states, 17103 states have (on average 2.713675963281296) internal successors, (46412), 17118 states have internal predecessors, (46412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:35,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17119 states to 17119 states and 46412 transitions. [2022-02-09 01:51:35,153 INFO L78 Accepts]: Start accepts. Automaton has 17119 states and 46412 transitions. Word has length 128 [2022-02-09 01:51:35,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:51:35,153 INFO L470 AbstractCegarLoop]: Abstraction has 17119 states and 46412 transitions. [2022-02-09 01:51:35,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:51:35,153 INFO L276 IsEmpty]: Start isEmpty. Operand 17119 states and 46412 transitions. [2022-02-09 01:51:35,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-02-09 01:51:35,160 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:51:35,160 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] [2022-02-09 01:51:35,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-02-09 01:51:35,160 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-02-09 01:51:35,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:51:35,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2074035048, now seen corresponding path program 12 times [2022-02-09 01:51:35,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:51:35,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636066870] [2022-02-09 01:51:35,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:51:35,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:51:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:51:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:51:35,536 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:51:35,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636066870] [2022-02-09 01:51:35,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636066870] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:51:35,536 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:51:35,536 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-09 01:51:35,536 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828013570] [2022-02-09 01:51:35,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:51:35,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-09 01:51:35,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:51:35,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-09 01:51:35,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-02-09 01:51:35,537 INFO L87 Difference]: Start difference. First operand 17119 states and 46412 transitions. Second operand has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)