/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.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_2b-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:09:00,914 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:09:00,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:09:00,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:09:00,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:09:00,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:09:00,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:09:00,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:09:00,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:09:00,982 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:09:00,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:09:00,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:09:00,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:09:00,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:09:00,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:09:00,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:09:00,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:09:00,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:09:00,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:09:00,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:09:00,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:09:00,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:09:00,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:09:00,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:09:00,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:09:00,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:09:00,993 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:09:00,993 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:09:00,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:09:00,994 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:09:00,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:09:00,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:09:00,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:09:00,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:09:00,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:09:00,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:09:00,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:09:00,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:09:00,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:09:00,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:09:00,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:09:01,003 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 20:09:01,018 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:09:01,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:09:01,019 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:09:01,019 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:09:01,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:09:01,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:09:01,020 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:09:01,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:09:01,020 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:09:01,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:09:01,020 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:09:01,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:09:01,020 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:09:01,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:09:01,020 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:09:01,020 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:09:01,021 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:09:01,021 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:09:01,021 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:09:01,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:09:01,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:09:01,021 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:09:01,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:09:01,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:09:01,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:09:01,021 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:09:01,021 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:09:01,021 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:09:01,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:09:01,022 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:09:01,022 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:09:01,022 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:09:01,022 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-03-15 20:09:01,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:09:01,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:09:01,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:09:01,231 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 20:09:01,232 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 20:09:01,233 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2b-container_of-global.i [2022-03-15 20:09:01,276 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2f8d9b1c/11faa8c1fc214a0b8967afcbf25c1415/FLAG80ee6b9b4 [2022-03-15 20:09:01,694 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 20:09:01,694 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2b-container_of-global.i [2022-03-15 20:09:01,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2f8d9b1c/11faa8c1fc214a0b8967afcbf25c1415/FLAG80ee6b9b4 [2022-03-15 20:09:02,011 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2f8d9b1c/11faa8c1fc214a0b8967afcbf25c1415 [2022-03-15 20:09:02,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:09:02,014 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 20:09:02,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 20:09:02,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 20:09:02,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 20:09:02,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:09:02" (1/1) ... [2022-03-15 20:09:02,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@465495bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:09:02, skipping insertion in model container [2022-03-15 20:09:02,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:09:02" (1/1) ... [2022-03-15 20:09:02,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 20:09:02,049 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 20:09:02,635 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_2b-container_of-global.i[76084,76097] [2022-03-15 20:09:02,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:09:02,683 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 20:09:02,721 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_2b-container_of-global.i[76084,76097] [2022-03-15 20:09:02,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:09:02,827 INFO L208 MainTranslator]: Completed translation [2022-03-15 20:09:02,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:09:02 WrapperNode [2022-03-15 20:09:02,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 20:09:02,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:09:02,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:09:02,828 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:09:02,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:09:02" (1/1) ... [2022-03-15 20:09:02,862 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:09:02" (1/1) ... [2022-03-15 20:09:02,899 INFO L137 Inliner]: procedures = 481, calls = 45, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 206 [2022-03-15 20:09:02,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:09:02,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:09:02,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:09:02,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:09:02,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:09:02" (1/1) ... [2022-03-15 20:09:02,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:09:02" (1/1) ... [2022-03-15 20:09:02,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:09:02" (1/1) ... [2022-03-15 20:09:02,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:09:02" (1/1) ... [2022-03-15 20:09:02,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:09:02" (1/1) ... [2022-03-15 20:09:02,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:09:02" (1/1) ... [2022-03-15 20:09:02,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:09:02" (1/1) ... [2022-03-15 20:09:02,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:09:02,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:09:02,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:09:02,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:09:02,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:09:02" (1/1) ... [2022-03-15 20:09:02,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:09:02,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:09:02,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 20:09:02,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 20:09:03,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 20:09:03,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 20:09:03,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 20:09:03,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-03-15 20:09:03,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:09:03,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:09:03,019 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-03-15 20:09:03,019 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-03-15 20:09:03,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 20:09:03,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 20:09:03,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 20:09:03,020 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 20:09:03,174 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:09:03,175 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:09:03,433 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:09:03,440 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:09:03,440 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 20:09:03,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:09:03 BoogieIcfgContainer [2022-03-15 20:09:03,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:09:03,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:09:03,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:09:03,448 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:09:03,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 08:09:02" (1/3) ... [2022-03-15 20:09:03,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c28ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:09:03, skipping insertion in model container [2022-03-15 20:09:03,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:09:02" (2/3) ... [2022-03-15 20:09:03,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c28ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:09:03, skipping insertion in model container [2022-03-15 20:09:03,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:09:03" (3/3) ... [2022-03-15 20:09:03,450 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2b-container_of-global.i [2022-03-15 20:09:03,453 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:09:03,453 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:09:03,454 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-03-15 20:09:03,454 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:09:03,507 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,507 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,507 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,507 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,508 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,508 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,508 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,508 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,508 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,508 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,508 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,508 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,508 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,509 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,509 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,511 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,511 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,511 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,511 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,511 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,511 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,511 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,511 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,511 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,512 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,512 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,512 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,512 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,512 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,512 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,512 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,512 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,512 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,513 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,513 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,513 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,513 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,513 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,513 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,513 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,513 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,513 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,513 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,513 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,514 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,514 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,514 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,514 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,514 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,514 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,514 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,514 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,514 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,514 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,515 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,515 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,515 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,515 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,515 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,515 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,515 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,516 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,516 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,516 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,516 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,516 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,516 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,516 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,516 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,516 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,516 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,517 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,517 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,517 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,517 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,517 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,517 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,517 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,517 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,517 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,517 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,517 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,518 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,518 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,518 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,518 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,518 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,518 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,518 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,518 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,518 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,518 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,519 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,519 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,519 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,519 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,519 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,519 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,519 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,520 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,520 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,520 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,520 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,520 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,520 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,520 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,520 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,520 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,520 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,521 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,521 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,521 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,521 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,521 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,521 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,521 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,521 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,521 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,521 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,521 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,522 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,522 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,522 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,522 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,522 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,522 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,522 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,522 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,522 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,522 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,522 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,523 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,523 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,523 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,526 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,527 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,527 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,527 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,527 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,528 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,528 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,528 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,528 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,528 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,528 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,528 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,528 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,528 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,529 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,529 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,529 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,529 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,529 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,529 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,530 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,530 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,530 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,530 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,530 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,530 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,530 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,530 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,531 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,531 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,531 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,531 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,531 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,531 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,531 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,531 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,531 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,531 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,531 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,531 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,532 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,532 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,532 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,532 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,532 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,532 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,532 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,533 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,533 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,533 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,533 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,533 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,533 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,533 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,533 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,533 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,533 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,534 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,534 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,534 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,534 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,534 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,534 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,534 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,534 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,534 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,535 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,535 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,535 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,535 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,536 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,536 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,536 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,536 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,536 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,536 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,536 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,537 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,537 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,537 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,537 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,537 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,537 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,537 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,538 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,538 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,540 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,541 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,541 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,545 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,546 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,546 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,546 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,546 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,546 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,546 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,546 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,546 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,547 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,547 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,547 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,547 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,547 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,547 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,547 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,547 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,547 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,547 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,548 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,548 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,548 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,548 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,548 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,548 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,548 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,549 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,549 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,555 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,555 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,555 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,555 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,556 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,556 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,556 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,556 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,556 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,556 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,556 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,556 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,556 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,556 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,556 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,556 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,556 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,557 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,557 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,557 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,557 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,557 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,557 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,557 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,557 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,557 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,557 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,557 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,557 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,558 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,558 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,558 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,558 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,558 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,558 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,558 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,558 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,558 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,558 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,558 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,559 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,559 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,559 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,559 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,559 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,559 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,559 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,559 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,559 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,564 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,565 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,565 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,565 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,565 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,565 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,565 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,565 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,566 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,566 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,566 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,568 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,568 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,568 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,568 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,568 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,568 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,568 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,568 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,568 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,568 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,568 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:09:03,572 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 20:09:03,613 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:09:03,619 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:09:03,619 INFO L340 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-03-15 20:09:03,639 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:09:03,657 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 315 places, 317 transitions, 650 flow [2022-03-15 20:09:03,659 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 315 places, 317 transitions, 650 flow [2022-03-15 20:09:03,660 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 315 places, 317 transitions, 650 flow [2022-03-15 20:09:03,804 INFO L129 PetriNetUnfolder]: 10/394 cut-off events. [2022-03-15 20:09:03,804 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 20:09:03,808 INFO L84 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 394 events. 10/394 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 794 event pairs, 0 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 226. Up to 4 conditions per place. [2022-03-15 20:09:03,816 INFO L116 LiptonReduction]: Number of co-enabled transitions 15120 [2022-03-15 20:09:31,667 WARN L228 SmtUtils]: Spent 9.71s on a formula simplification. DAG size of input: 217 DAG size of output: 206 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:09:45,063 WARN L228 SmtUtils]: Spent 10.61s on a formula simplification. DAG size of input: 223 DAG size of output: 212 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:09:53,959 WARN L228 SmtUtils]: Spent 5.61s on a formula simplification. DAG size of input: 199 DAG size of output: 188 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:10:04,780 INFO L131 LiptonReduction]: Checked pairs total: 123677 [2022-03-15 20:10:04,780 INFO L133 LiptonReduction]: Total number of compositions: 295 [2022-03-15 20:10:04,786 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 111 transitions, 238 flow [2022-03-15 20:10:05,331 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 23445 states, 23253 states have (on average 2.929084419214725) internal successors, (68110), 23444 states have internal predecessors, (68110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:05,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 23445 states, 23253 states have (on average 2.929084419214725) internal successors, (68110), 23444 states have internal predecessors, (68110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:05,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-03-15 20:10:05,379 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:05,379 INFO L514 BasicCegarLoop]: trace histogram [1] [2022-03-15 20:10:05,380 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-03-15 20:10:05,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:05,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1009, now seen corresponding path program 1 times [2022-03-15 20:10:05,402 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:05,402 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117160033] [2022-03-15 20:10:05,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:05,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:05,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:10:05,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:05,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117160033] [2022-03-15 20:10:05,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117160033] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:05,671 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:05,671 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-03-15 20:10:05,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [480937061] [2022-03-15 20:10:05,673 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:05,674 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:05,678 INFO L252 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2022-03-15 20:10:05,678 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:05,680 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:10:05,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 20:10:05,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:05,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 20:10:05,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 20:10:05,746 INFO L87 Difference]: Start difference. First operand has 23445 states, 23253 states have (on average 2.929084419214725) internal successors, (68110), 23444 states have internal predecessors, (68110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:06,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:06,166 INFO L93 Difference]: Finished difference Result 23438 states and 67478 transitions. [2022-03-15 20:10:06,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 20:10:06,170 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-03-15 20:10:06,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:06,288 INFO L225 Difference]: With dead ends: 23438 [2022-03-15 20:10:06,288 INFO L226 Difference]: Without dead ends: 23436 [2022-03-15 20:10:06,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 20:10:06,291 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:06,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:10:06,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23436 states. [2022-03-15 20:10:06,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23436 to 23436. [2022-03-15 20:10:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23436 states, 23253 states have (on average 2.9017331097062744) internal successors, (67474), 23435 states have internal predecessors, (67474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:07,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23436 states to 23436 states and 67474 transitions. [2022-03-15 20:10:07,146 INFO L78 Accepts]: Start accepts. Automaton has 23436 states and 67474 transitions. Word has length 1 [2022-03-15 20:10:07,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:07,146 INFO L470 AbstractCegarLoop]: Abstraction has 23436 states and 67474 transitions. [2022-03-15 20:10:07,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:07,146 INFO L276 IsEmpty]: Start isEmpty. Operand 23436 states and 67474 transitions. [2022-03-15 20:10:07,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-03-15 20:10:07,147 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:07,147 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-03-15 20:10:07,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:10:07,212 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting my_callbackErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-03-15 20:10:07,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:07,212 INFO L85 PathProgramCache]: Analyzing trace with hash 30684634, now seen corresponding path program 1 times [2022-03-15 20:10:07,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:07,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500031225] [2022-03-15 20:10:07,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:07,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:10:07,417 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:07,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500031225] [2022-03-15 20:10:07,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500031225] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:07,417 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:07,417 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:10:07,418 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [922706747] [2022-03-15 20:10:07,418 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:07,424 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:07,439 INFO L252 McrAutomatonBuilder]: Finished intersection with 5 states and 4 transitions. [2022-03-15 20:10:07,439 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:07,440 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:10:07,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:10:07,441 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:07,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:10:07,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:10:07,442 INFO L87 Difference]: Start difference. First operand 23436 states and 67474 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:07,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:07,862 INFO L93 Difference]: Finished difference Result 21635 states and 62158 transitions. [2022-03-15 20:10:07,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:10:07,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-03-15 20:10:07,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:07,949 INFO L225 Difference]: With dead ends: 21635 [2022-03-15 20:10:07,949 INFO L226 Difference]: Without dead ends: 21635 [2022-03-15 20:10:07,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:10:07,950 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 93 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:07,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 119 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:10:08,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21635 states. [2022-03-15 20:10:08,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21635 to 21612. [2022-03-15 20:10:08,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21612 states, 21493 states have (on average 2.89098776345787) internal successors, (62136), 21611 states have internal predecessors, (62136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:08,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21612 states to 21612 states and 62136 transitions. [2022-03-15 20:10:08,778 INFO L78 Accepts]: Start accepts. Automaton has 21612 states and 62136 transitions. Word has length 4 [2022-03-15 20:10:08,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:08,779 INFO L470 AbstractCegarLoop]: Abstraction has 21612 states and 62136 transitions. [2022-03-15 20:10:08,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 21612 states and 62136 transitions. [2022-03-15 20:10:08,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-03-15 20:10:08,780 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:08,780 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:10:08,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 20:10:08,783 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-03-15 20:10:08,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:08,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1631830054, now seen corresponding path program 1 times [2022-03-15 20:10:08,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:08,786 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88597879] [2022-03-15 20:10:08,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:08,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:08,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:10:08,880 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:08,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88597879] [2022-03-15 20:10:08,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88597879] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:08,880 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:08,880 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:10:08,880 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [333709798] [2022-03-15 20:10:08,880 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:08,881 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:08,882 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2022-03-15 20:10:08,882 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:08,883 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:10:08,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:10:08,883 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:08,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:10:08,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:10:08,884 INFO L87 Difference]: Start difference. First operand 21612 states and 62136 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:09,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:09,251 INFO L93 Difference]: Finished difference Result 21606 states and 62130 transitions. [2022-03-15 20:10:09,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:10:09,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-03-15 20:10:09,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:09,450 INFO L225 Difference]: With dead ends: 21606 [2022-03-15 20:10:09,450 INFO L226 Difference]: Without dead ends: 21606 [2022-03-15 20:10:09,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:10:09,451 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:09,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:10:09,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21606 states. [2022-03-15 20:10:09,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21606 to 21606. [2022-03-15 20:10:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21606 states, 21488 states have (on average 2.891381236038719) internal successors, (62130), 21605 states have internal predecessors, (62130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21606 states to 21606 states and 62130 transitions. [2022-03-15 20:10:10,084 INFO L78 Accepts]: Start accepts. Automaton has 21606 states and 62130 transitions. Word has length 7 [2022-03-15 20:10:10,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:10,085 INFO L470 AbstractCegarLoop]: Abstraction has 21606 states and 62130 transitions. [2022-03-15 20:10:10,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:10,085 INFO L276 IsEmpty]: Start isEmpty. Operand 21606 states and 62130 transitions. [2022-03-15 20:10:10,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-03-15 20:10:10,085 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:10,085 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:10:10,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 20:10:10,091 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-03-15 20:10:10,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:10,092 INFO L85 PathProgramCache]: Analyzing trace with hash -2114810229, now seen corresponding path program 1 times [2022-03-15 20:10:10,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:10,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24889746] [2022-03-15 20:10:10,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:10,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:10:10,253 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:10,253 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24889746] [2022-03-15 20:10:10,253 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24889746] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:10,253 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:10,253 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:10:10,255 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1128024777] [2022-03-15 20:10:10,255 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:10,256 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:10,257 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2022-03-15 20:10:10,257 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:10,257 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:10:10,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:10:10,259 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:10,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:10:10,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:10:10,260 INFO L87 Difference]: Start difference. First operand 21606 states and 62130 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:11,045 INFO L93 Difference]: Finished difference Result 23829 states and 68609 transitions. [2022-03-15 20:10:11,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:10:11,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-03-15 20:10:11,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:11,119 INFO L225 Difference]: With dead ends: 23829 [2022-03-15 20:10:11,119 INFO L226 Difference]: Without dead ends: 23829 [2022-03-15 20:10:11,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:10:11,122 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 88 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:11,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 62 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:10:11,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23829 states. [2022-03-15 20:10:11,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23829 to 23829. [2022-03-15 20:10:11,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23829 states, 23712 states have (on average 2.8934294871794872) internal successors, (68609), 23828 states have internal predecessors, (68609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23829 states to 23829 states and 68609 transitions. [2022-03-15 20:10:11,810 INFO L78 Accepts]: Start accepts. Automaton has 23829 states and 68609 transitions. Word has length 7 [2022-03-15 20:10:11,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:11,811 INFO L470 AbstractCegarLoop]: Abstraction has 23829 states and 68609 transitions. [2022-03-15 20:10:11,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:11,811 INFO L276 IsEmpty]: Start isEmpty. Operand 23829 states and 68609 transitions. [2022-03-15 20:10:11,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 20:10:11,812 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:11,812 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:10:11,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 20:10:11,812 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-03-15 20:10:11,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:11,812 INFO L85 PathProgramCache]: Analyzing trace with hash 594435705, now seen corresponding path program 1 times [2022-03-15 20:10:11,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:11,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462605646] [2022-03-15 20:10:11,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:11,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:11,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:10:11,906 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:11,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462605646] [2022-03-15 20:10:11,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462605646] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:11,906 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:11,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:10:11,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [470115316] [2022-03-15 20:10:11,906 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:11,907 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:11,908 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2022-03-15 20:10:11,908 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:11,908 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:10:11,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:10:11,909 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:11,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:10:11,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:10:11,909 INFO L87 Difference]: Start difference. First operand 23829 states and 68609 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:12,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:12,625 INFO L93 Difference]: Finished difference Result 28259 states and 81568 transitions. [2022-03-15 20:10:12,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:10:12,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-03-15 20:10:12,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:12,720 INFO L225 Difference]: With dead ends: 28259 [2022-03-15 20:10:12,720 INFO L226 Difference]: Without dead ends: 28259 [2022-03-15 20:10:12,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:10:12,721 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 119 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:12,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 70 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 20:10:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28259 states. [2022-03-15 20:10:13,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28259 to 27295. [2022-03-15 20:10:13,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27295 states, 27178 states have (on average 2.8973802340128043) internal successors, (78745), 27294 states have internal predecessors, (78745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27295 states to 27295 states and 78745 transitions. [2022-03-15 20:10:13,541 INFO L78 Accepts]: Start accepts. Automaton has 27295 states and 78745 transitions. Word has length 10 [2022-03-15 20:10:13,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:13,541 INFO L470 AbstractCegarLoop]: Abstraction has 27295 states and 78745 transitions. [2022-03-15 20:10:13,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 27295 states and 78745 transitions. [2022-03-15 20:10:13,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:10:13,543 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:13,543 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:10:13,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 20:10:13,543 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-03-15 20:10:13,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:13,544 INFO L85 PathProgramCache]: Analyzing trace with hash -786532344, now seen corresponding path program 1 times [2022-03-15 20:10:13,546 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:13,546 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921563063] [2022-03-15 20:10:13,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:13,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:10:13,664 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:13,664 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921563063] [2022-03-15 20:10:13,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921563063] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:13,665 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:13,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:10:13,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [355288601] [2022-03-15 20:10:13,665 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:13,666 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:13,668 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2022-03-15 20:10:13,668 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:13,668 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:10:13,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:10:13,669 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:13,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:10:13,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:10:13,669 INFO L87 Difference]: Start difference. First operand 27295 states and 78745 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:14,597 INFO L93 Difference]: Finished difference Result 30384 states and 86890 transitions. [2022-03-15 20:10:14,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:10:14,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-03-15 20:10:14,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:14,681 INFO L225 Difference]: With dead ends: 30384 [2022-03-15 20:10:14,682 INFO L226 Difference]: Without dead ends: 30384 [2022-03-15 20:10:14,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:10:14,682 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 102 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:14,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 56 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:10:14,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30384 states. [2022-03-15 20:10:15,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30384 to 29515. [2022-03-15 20:10:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29515 states, 29398 states have (on average 2.8985985441186477) internal successors, (85213), 29514 states have internal predecessors, (85213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:15,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29515 states to 29515 states and 85213 transitions. [2022-03-15 20:10:15,412 INFO L78 Accepts]: Start accepts. Automaton has 29515 states and 85213 transitions. Word has length 11 [2022-03-15 20:10:15,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:15,413 INFO L470 AbstractCegarLoop]: Abstraction has 29515 states and 85213 transitions. [2022-03-15 20:10:15,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:15,414 INFO L276 IsEmpty]: Start isEmpty. Operand 29515 states and 85213 transitions. [2022-03-15 20:10:15,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:10:15,419 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:15,419 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:10:15,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 20:10:15,419 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-03-15 20:10:15,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:15,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1202421243, now seen corresponding path program 1 times [2022-03-15 20:10:15,421 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:15,421 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203107687] [2022-03-15 20:10:15,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:15,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:10:15,526 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:15,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203107687] [2022-03-15 20:10:15,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203107687] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:15,526 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:15,527 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:10:15,527 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [580742186] [2022-03-15 20:10:15,527 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:15,528 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:15,529 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions. [2022-03-15 20:10:15,529 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:15,529 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:10:15,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:10:15,530 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:15,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:10:15,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:10:15,530 INFO L87 Difference]: Start difference. First operand 29515 states and 85213 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:16,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:16,558 INFO L93 Difference]: Finished difference Result 34216 states and 98928 transitions. [2022-03-15 20:10:16,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:10:16,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-03-15 20:10:16,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:16,660 INFO L225 Difference]: With dead ends: 34216 [2022-03-15 20:10:16,660 INFO L226 Difference]: Without dead ends: 34216 [2022-03-15 20:10:16,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:10:16,662 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 131 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:16,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 70 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:10:16,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34216 states. [2022-03-15 20:10:17,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34216 to 33009. [2022-03-15 20:10:17,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33009 states, 32892 states have (on average 2.9002188982123314) internal successors, (95394), 33008 states have internal predecessors, (95394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:17,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33009 states to 33009 states and 95394 transitions. [2022-03-15 20:10:17,513 INFO L78 Accepts]: Start accepts. Automaton has 33009 states and 95394 transitions. Word has length 12 [2022-03-15 20:10:17,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:17,514 INFO L470 AbstractCegarLoop]: Abstraction has 33009 states and 95394 transitions. [2022-03-15 20:10:17,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:17,514 INFO L276 IsEmpty]: Start isEmpty. Operand 33009 states and 95394 transitions. [2022-03-15 20:10:17,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:10:17,515 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:17,515 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:10:17,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 20:10:17,515 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-03-15 20:10:17,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:17,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1038974528, now seen corresponding path program 1 times [2022-03-15 20:10:17,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:17,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012745106] [2022-03-15 20:10:17,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:17,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:10:17,601 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:17,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012745106] [2022-03-15 20:10:17,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012745106] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:17,601 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:17,601 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:10:17,601 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1237538080] [2022-03-15 20:10:17,601 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:17,602 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:17,603 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2022-03-15 20:10:17,604 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:17,604 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:10:17,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:10:17,604 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:17,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:10:17,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:10:17,604 INFO L87 Difference]: Start difference. First operand 33009 states and 95394 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:18,433 INFO L93 Difference]: Finished difference Result 35223 states and 101846 transitions. [2022-03-15 20:10:18,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:10:18,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-03-15 20:10:18,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:18,535 INFO L225 Difference]: With dead ends: 35223 [2022-03-15 20:10:18,536 INFO L226 Difference]: Without dead ends: 35223 [2022-03-15 20:10:18,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:10:18,536 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 88 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:18,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 62 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:10:18,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35223 states. [2022-03-15 20:10:19,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35223 to 35223. [2022-03-15 20:10:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35223 states, 35107 states have (on average 2.9010168912182754) internal successors, (101846), 35222 states have internal predecessors, (101846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:19,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35223 states to 35223 states and 101846 transitions. [2022-03-15 20:10:19,330 INFO L78 Accepts]: Start accepts. Automaton has 35223 states and 101846 transitions. Word has length 13 [2022-03-15 20:10:19,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:19,330 INFO L470 AbstractCegarLoop]: Abstraction has 35223 states and 101846 transitions. [2022-03-15 20:10:19,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:19,330 INFO L276 IsEmpty]: Start isEmpty. Operand 35223 states and 101846 transitions. [2022-03-15 20:10:19,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:10:19,332 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:19,332 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:10:19,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 20:10:19,332 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-03-15 20:10:19,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:19,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1106450226, now seen corresponding path program 1 times [2022-03-15 20:10:19,333 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:19,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886025707] [2022-03-15 20:10:19,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:19,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:10:19,483 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:19,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886025707] [2022-03-15 20:10:19,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886025707] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:19,483 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:19,483 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:10:19,483 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [717772968] [2022-03-15 20:10:19,484 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:19,485 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:19,488 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 47 transitions. [2022-03-15 20:10:19,488 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:20,011 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:10:20,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:10:20,012 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:20,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:10:20,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:10:20,012 INFO L87 Difference]: Start difference. First operand 35223 states and 101846 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:21,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:21,875 INFO L93 Difference]: Finished difference Result 37922 states and 108968 transitions. [2022-03-15 20:10:21,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:10:21,876 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 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 15 [2022-03-15 20:10:21,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:21,969 INFO L225 Difference]: With dead ends: 37922 [2022-03-15 20:10:21,969 INFO L226 Difference]: Without dead ends: 37922 [2022-03-15 20:10:21,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 12 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:10:21,970 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 518 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 2255 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:21,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [518 Valid, 148 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2255 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 20:10:22,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37922 states. [2022-03-15 20:10:22,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37922 to 35411. [2022-03-15 20:10:22,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35411 states, 35295 states have (on average 2.9016574585635357) internal successors, (102414), 35410 states have internal predecessors, (102414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:22,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35411 states to 35411 states and 102414 transitions. [2022-03-15 20:10:22,766 INFO L78 Accepts]: Start accepts. Automaton has 35411 states and 102414 transitions. Word has length 15 [2022-03-15 20:10:22,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:22,767 INFO L470 AbstractCegarLoop]: Abstraction has 35411 states and 102414 transitions. [2022-03-15 20:10:22,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 35411 states and 102414 transitions. [2022-03-15 20:10:22,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:10:22,768 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:22,769 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:10:22,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 20:10:22,769 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-03-15 20:10:22,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:22,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1106431998, now seen corresponding path program 1 times [2022-03-15 20:10:22,770 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:22,770 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108694075] [2022-03-15 20:10:22,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:22,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:22,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:10:22,813 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:22,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108694075] [2022-03-15 20:10:22,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108694075] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:22,813 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:22,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:10:22,814 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1988022438] [2022-03-15 20:10:22,814 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:22,815 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:22,819 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 47 transitions. [2022-03-15 20:10:22,819 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:22,868 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:10:22,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:10:22,868 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:22,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:10:22,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:10:22,869 INFO L87 Difference]: Start difference. First operand 35411 states and 102414 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:23,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:23,040 INFO L93 Difference]: Finished difference Result 9519 states and 26731 transitions. [2022-03-15 20:10:23,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:10:23,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 15 [2022-03-15 20:10:23,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:23,062 INFO L225 Difference]: With dead ends: 9519 [2022-03-15 20:10:23,062 INFO L226 Difference]: Without dead ends: 9519 [2022-03-15 20:10:23,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:10:23,063 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 42 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:23,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 158 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:10:23,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9519 states. [2022-03-15 20:10:23,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9519 to 9519. [2022-03-15 20:10:23,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9519 states, 9482 states have (on average 2.8191309850242563) internal successors, (26731), 9518 states have internal predecessors, (26731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:23,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9519 states to 9519 states and 26731 transitions. [2022-03-15 20:10:23,359 INFO L78 Accepts]: Start accepts. Automaton has 9519 states and 26731 transitions. Word has length 15 [2022-03-15 20:10:23,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:23,359 INFO L470 AbstractCegarLoop]: Abstraction has 9519 states and 26731 transitions. [2022-03-15 20:10:23,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:23,359 INFO L276 IsEmpty]: Start isEmpty. Operand 9519 states and 26731 transitions. [2022-03-15 20:10:23,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:10:23,360 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:23,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:10:23,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 20:10:23,361 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-03-15 20:10:23,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:23,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1784224467, now seen corresponding path program 1 times [2022-03-15 20:10:23,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:23,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125215512] [2022-03-15 20:10:23,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:23,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:10:23,487 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:23,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125215512] [2022-03-15 20:10:23,487 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125215512] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:23,487 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:23,487 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:10:23,487 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1987917888] [2022-03-15 20:10:23,487 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:23,488 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:23,490 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 15 transitions. [2022-03-15 20:10:23,490 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:23,490 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:10:23,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:10:23,490 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:23,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:10:23,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:10:23,491 INFO L87 Difference]: Start difference. First operand 9519 states and 26731 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:24,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:24,637 INFO L93 Difference]: Finished difference Result 12652 states and 34994 transitions. [2022-03-15 20:10:24,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:10:24,638 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-03-15 20:10:24,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:24,666 INFO L225 Difference]: With dead ends: 12652 [2022-03-15 20:10:24,667 INFO L226 Difference]: Without dead ends: 12652 [2022-03-15 20:10:24,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:10:24,667 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 379 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:24,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 95 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1306 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 20:10:24,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12652 states. [2022-03-15 20:10:24,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12652 to 9615. [2022-03-15 20:10:24,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9615 states, 9578 states have (on average 2.8205262058884943) internal successors, (27015), 9614 states have internal predecessors, (27015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9615 states to 9615 states and 27015 transitions. [2022-03-15 20:10:24,958 INFO L78 Accepts]: Start accepts. Automaton has 9615 states and 27015 transitions. Word has length 15 [2022-03-15 20:10:24,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:24,958 INFO L470 AbstractCegarLoop]: Abstraction has 9615 states and 27015 transitions. [2022-03-15 20:10:24,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 9615 states and 27015 transitions. [2022-03-15 20:10:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:10:24,960 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:24,960 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:10:24,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 20:10:24,960 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-03-15 20:10:24,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:24,960 INFO L85 PathProgramCache]: Analyzing trace with hash 422431565, now seen corresponding path program 2 times [2022-03-15 20:10:24,961 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:24,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047669462] [2022-03-15 20:10:24,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:24,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:10:25,139 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:25,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047669462] [2022-03-15 20:10:25,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047669462] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:25,139 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:25,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 20:10:25,140 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [701161359] [2022-03-15 20:10:25,140 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:25,141 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:25,144 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 49 transitions. [2022-03-15 20:10:25,144 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:25,450 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [866135#(and (not (= ~my_dev~0.base |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|))), 866133#(and (not (= ~my_dev~0.base |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (= (select (select |#race| |~#t1~0.base|) (+ 2 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0)), 866132#(and (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (not (= |~#t1~0.base| my_callbackThread1of1ForFork0_~data~0.base))), 866134#(and (not (= ~my_dev~0.base |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0)), 866137#(not (= |~#t1~0.base| my_callbackThread1of1ForFork0_~data~0.base)), 866136#(not (= ~my_dev~0.base |~#t1~0.base|)), 866131#(and (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (not (= |~#t1~0.base| my_callbackThread1of1ForFork0_~data~0.base)) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0))] [2022-03-15 20:10:25,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 20:10:25,450 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:25,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 20:10:25,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:10:25,451 INFO L87 Difference]: Start difference. First operand 9615 states and 27015 transitions. Second operand has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:27,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:27,561 INFO L93 Difference]: Finished difference Result 12064 states and 33266 transitions. [2022-03-15 20:10:27,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:10:27,561 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 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 15 [2022-03-15 20:10:27,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:27,585 INFO L225 Difference]: With dead ends: 12064 [2022-03-15 20:10:27,585 INFO L226 Difference]: Without dead ends: 12064 [2022-03-15 20:10:27,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=262, Invalid=730, Unknown=0, NotChecked=0, Total=992 [2022-03-15 20:10:27,586 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 608 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 2950 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 3177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 2950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:27,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [608 Valid, 94 Invalid, 3177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 2950 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 20:10:27,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12064 states. [2022-03-15 20:10:27,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12064 to 9139. [2022-03-15 20:10:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9139 states, 9102 states have (on average 2.8137771918259724) internal successors, (25611), 9138 states have internal predecessors, (25611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9139 states to 9139 states and 25611 transitions. [2022-03-15 20:10:27,747 INFO L78 Accepts]: Start accepts. Automaton has 9139 states and 25611 transitions. Word has length 15 [2022-03-15 20:10:27,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:27,748 INFO L470 AbstractCegarLoop]: Abstraction has 9139 states and 25611 transitions. [2022-03-15 20:10:27,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 9139 states and 25611 transitions. [2022-03-15 20:10:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:10:27,749 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:27,749 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:10:27,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 20:10:27,749 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-03-15 20:10:27,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:27,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1363482209, now seen corresponding path program 1 times [2022-03-15 20:10:27,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:27,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539101577] [2022-03-15 20:10:27,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:27,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:10:27,902 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:27,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539101577] [2022-03-15 20:10:27,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539101577] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:27,902 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:27,902 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 20:10:27,902 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1606931530] [2022-03-15 20:10:27,902 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:27,903 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:27,906 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 47 transitions. [2022-03-15 20:10:27,906 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:28,016 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:10:28,017 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:10:28,020 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:10:28,020 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:10:28,068 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:10:28,069 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:10:28,072 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:10:28,072 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:10:28,122 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:10:28,123 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:10:28,125 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:10:28,126 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:10:28,282 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [896525#(not (= |~#t1~0.base| my_callbackThread1of1ForFork1_~data~0.base)), 896523#(and (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (not (= my_callbackThread1of1ForFork1_~__mptr~0.base |~#t1~0.base|)) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0)), 896522#(and (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (not (= my_callbackThread1of1ForFork1_~__mptr~0.base |~#t1~0.base|)) (= (select (select |#race| |~#t1~0.base|) (+ 2 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0)), 896519#(and (not (= |~#t1~0.base| my_callbackThread1of1ForFork1_~data~0.base)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (= (select (select |#race| |~#t1~0.base|) (+ 2 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0)), 896526#(not (= my_callbackThread1of1ForFork1_~__mptr~0.base |~#t1~0.base|)), 896520#(and (not (= |~#t1~0.base| my_callbackThread1of1ForFork1_~data~0.base)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0)), 896521#(and (not (= |~#t1~0.base| my_callbackThread1of1ForFork1_~data~0.base)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|))), 896524#(and (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (not (= my_callbackThread1of1ForFork1_~__mptr~0.base |~#t1~0.base|)))] [2022-03-15 20:10:28,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 20:10:28,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:28,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 20:10:28,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-03-15 20:10:28,283 INFO L87 Difference]: Start difference. First operand 9139 states and 25611 transitions. Second operand has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:30,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:30,556 INFO L93 Difference]: Finished difference Result 14031 states and 38936 transitions. [2022-03-15 20:10:30,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:10:30,556 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 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 15 [2022-03-15 20:10:30,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:30,588 INFO L225 Difference]: With dead ends: 14031 [2022-03-15 20:10:30,588 INFO L226 Difference]: Without dead ends: 14031 [2022-03-15 20:10:30,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:10:30,589 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 667 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 3390 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 3662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 3390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:30,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [667 Valid, 91 Invalid, 3662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 3390 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 20:10:30,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14031 states. [2022-03-15 20:10:30,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14031 to 12262. [2022-03-15 20:10:30,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12262 states, 12225 states have (on average 2.8776278118609406) internal successors, (35179), 12261 states have internal predecessors, (35179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12262 states to 12262 states and 35179 transitions. [2022-03-15 20:10:30,795 INFO L78 Accepts]: Start accepts. Automaton has 12262 states and 35179 transitions. Word has length 15 [2022-03-15 20:10:30,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:30,795 INFO L470 AbstractCegarLoop]: Abstraction has 12262 states and 35179 transitions. [2022-03-15 20:10:30,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:30,796 INFO L276 IsEmpty]: Start isEmpty. Operand 12262 states and 35179 transitions. [2022-03-15 20:10:30,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:10:30,797 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:30,797 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:10:30,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 20:10:30,797 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-03-15 20:10:30,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:30,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2082123454, now seen corresponding path program 1 times [2022-03-15 20:10:30,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:30,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719173941] [2022-03-15 20:10:30,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:30,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:30,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:10:30,936 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:30,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719173941] [2022-03-15 20:10:30,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719173941] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:30,937 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:30,937 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 20:10:30,937 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [394331827] [2022-03-15 20:10:30,937 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:30,938 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:30,940 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 23 transitions. [2022-03-15 20:10:30,940 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:30,978 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:10:30,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:10:30,979 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:30,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:10:30,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:10:30,979 INFO L87 Difference]: Start difference. First operand 12262 states and 35179 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:31,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:31,847 INFO L93 Difference]: Finished difference Result 13592 states and 38989 transitions. [2022-03-15 20:10:31,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 20:10:31,848 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 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 15 [2022-03-15 20:10:31,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:31,877 INFO L225 Difference]: With dead ends: 13592 [2022-03-15 20:10:31,877 INFO L226 Difference]: Without dead ends: 13592 [2022-03-15 20:10:31,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-03-15 20:10:31,877 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 365 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:31,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 126 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:10:31,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13592 states. [2022-03-15 20:10:32,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13592 to 12354. [2022-03-15 20:10:32,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12354 states, 12317 states have (on average 2.882601282779898) internal successors, (35505), 12353 states have internal predecessors, (35505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12354 states to 12354 states and 35505 transitions. [2022-03-15 20:10:32,097 INFO L78 Accepts]: Start accepts. Automaton has 12354 states and 35505 transitions. Word has length 15 [2022-03-15 20:10:32,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:32,097 INFO L470 AbstractCegarLoop]: Abstraction has 12354 states and 35505 transitions. [2022-03-15 20:10:32,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:32,098 INFO L276 IsEmpty]: Start isEmpty. Operand 12354 states and 35505 transitions. [2022-03-15 20:10:32,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:10:32,099 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:32,099 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:10:32,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-15 20:10:32,099 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-03-15 20:10:32,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:32,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1867575399, now seen corresponding path program 1 times [2022-03-15 20:10:32,103 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:32,103 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140726168] [2022-03-15 20:10:32,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:32,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:10:32,170 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:32,170 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140726168] [2022-03-15 20:10:32,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140726168] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:32,170 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:32,170 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:10:32,170 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [259984708] [2022-03-15 20:10:32,171 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:32,172 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:32,173 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 16 transitions. [2022-03-15 20:10:32,173 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:32,173 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:10:32,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:10:32,173 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:32,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:10:32,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:10:32,174 INFO L87 Difference]: Start difference. First operand 12354 states and 35505 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:32,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:32,669 INFO L93 Difference]: Finished difference Result 14369 states and 41321 transitions. [2022-03-15 20:10:32,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:10:32,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-03-15 20:10:32,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:32,699 INFO L225 Difference]: With dead ends: 14369 [2022-03-15 20:10:32,699 INFO L226 Difference]: Without dead ends: 14369 [2022-03-15 20:10:32,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:10:32,700 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 72 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:32,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 60 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:10:32,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14369 states. [2022-03-15 20:10:32,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14369 to 13587. [2022-03-15 20:10:32,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13587 states, 13550 states have (on average 2.882287822878229) internal successors, (39055), 13586 states have internal predecessors, (39055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:32,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13587 states to 13587 states and 39055 transitions. [2022-03-15 20:10:32,968 INFO L78 Accepts]: Start accepts. Automaton has 13587 states and 39055 transitions. Word has length 16 [2022-03-15 20:10:32,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:32,968 INFO L470 AbstractCegarLoop]: Abstraction has 13587 states and 39055 transitions. [2022-03-15 20:10:32,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:32,969 INFO L276 IsEmpty]: Start isEmpty. Operand 13587 states and 39055 transitions. [2022-03-15 20:10:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:10:32,970 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:32,970 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:10:32,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-15 20:10:32,970 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-03-15 20:10:32,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:32,971 INFO L85 PathProgramCache]: Analyzing trace with hash 40882622, now seen corresponding path program 1 times [2022-03-15 20:10:32,971 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:32,972 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548479507] [2022-03-15 20:10:32,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:32,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:10:33,009 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 20:10:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:10:33,043 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 20:10:33,044 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 20:10:33,044 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2022-03-15 20:10:33,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2022-03-15 20:10:33,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2022-03-15 20:10:33,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2022-03-15 20:10:33,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2022-03-15 20:10:33,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2022-03-15 20:10:33,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2022-03-15 20:10:33,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2022-03-15 20:10:33,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2022-03-15 20:10:33,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2022-03-15 20:10:33,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2022-03-15 20:10:33,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining) [2022-03-15 20:10:33,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining) [2022-03-15 20:10:33,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2022-03-15 20:10:33,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (12 of 27 remaining) [2022-03-15 20:10:33,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (11 of 27 remaining) [2022-03-15 20:10:33,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining) [2022-03-15 20:10:33,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining) [2022-03-15 20:10:33,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2022-03-15 20:10:33,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2022-03-15 20:10:33,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2022-03-15 20:10:33,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2022-03-15 20:10:33,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2022-03-15 20:10:33,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2022-03-15 20:10:33,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2022-03-15 20:10:33,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2022-03-15 20:10:33,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2022-03-15 20:10:33,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-15 20:10:33,049 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:10:33,053 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 20:10:33,053 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:10:33,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 08:10:33 BasicIcfg [2022-03-15 20:10:33,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:10:33,079 INFO L158 Benchmark]: Toolchain (without parser) took 91065.62ms. Allocated memory was 179.3MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 125.6MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-03-15 20:10:33,079 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory was 145.1MB in the beginning and 145.0MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:10:33,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 812.20ms. Allocated memory was 179.3MB in the beginning and 226.5MB in the end (delta: 47.2MB). Free memory was 125.4MB in the beginning and 158.3MB in the end (delta: -32.9MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-15 20:10:33,080 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.79ms. Allocated memory is still 226.5MB. Free memory was 158.3MB in the beginning and 154.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-03-15 20:10:33,080 INFO L158 Benchmark]: Boogie Preprocessor took 55.98ms. Allocated memory is still 226.5MB. Free memory was 154.1MB in the beginning and 150.5MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 20:10:33,080 INFO L158 Benchmark]: RCFGBuilder took 485.93ms. Allocated memory is still 226.5MB. Free memory was 150.5MB in the beginning and 122.1MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-03-15 20:10:33,080 INFO L158 Benchmark]: TraceAbstraction took 89635.68ms. Allocated memory was 226.5MB in the beginning and 6.0GB in the end (delta: 5.7GB). Free memory was 121.6MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-03-15 20:10:33,081 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory was 145.1MB in the beginning and 145.0MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 812.20ms. Allocated memory was 179.3MB in the beginning and 226.5MB in the end (delta: 47.2MB). Free memory was 125.4MB in the beginning and 158.3MB in the end (delta: -32.9MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.79ms. Allocated memory is still 226.5MB. Free memory was 158.3MB in the beginning and 154.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.98ms. Allocated memory is still 226.5MB. Free memory was 154.1MB in the beginning and 150.5MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 485.93ms. Allocated memory is still 226.5MB. Free memory was 150.5MB in the beginning and 122.1MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 89635.68ms. Allocated memory was 226.5MB in the beginning and 6.0GB in the end (delta: 5.7GB). Free memory was 121.6MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 61.1s, 315 PlacesBefore, 114 PlacesAfterwards, 317 TransitionsBefore, 111 TransitionsAfterwards, 15120 CoEnabledTransitionPairs, 10 FixpointIterations, 170 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 20 TrivialYvCompositions, 29 ConcurrentYvCompositions, 5 ChoiceCompositions, 295 TotalNumberOfCompositions, 123677 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13611, positive: 11726, positive conditional: 0, positive unconditional: 11726, negative: 1885, negative conditional: 0, negative unconditional: 1885, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6078, positive: 5938, positive conditional: 0, positive unconditional: 5938, negative: 140, negative conditional: 0, negative unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 13611, positive: 5788, positive conditional: 0, positive unconditional: 5788, negative: 1745, negative conditional: 0, negative unconditional: 1745, unknown: 6078, unknown conditional: 0, unknown unconditional: 6078] , Statistics on independence cache: Total cache size (in pairs): 425, Positive cache size: 335, Positive conditional cache size: 0, Positive unconditional cache size: 335, Negative cache size: 90, Negative conditional cache size: 0, Negative unconditional cache size: 90 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 1710]: Data race detected Data race detected The following path leads to a data race: [L1694] 0 pthread_t t1,t2; [L1706] 0 struct device *my_dev; [L1744] CALL, EXPR 0 my_drv_init() [L1738] 0 return 0; [L1744] RET, EXPR 0 my_drv_init() [L1744] 0 int ret = my_drv_init(); [L1745] COND TRUE 0 ret==0 [L1746] 0 int probe_ret; [L1747] 0 struct my_data data; [L1748] CALL 0 my_drv_probe(&data) [L1716] 0 data->shared.a = 0 [L1717] 0 data->shared.b = 0 [L1718] EXPR 0 data->shared.a [L1718] EXPR 0 data->shared.a==0 [L1718] CALL 0 ldv_assert(data->shared.a==0) [L1693] COND FALSE 0 !(!expression) [L1718] RET 0 ldv_assert(data->shared.a==0) [L1719] EXPR 0 data->shared.b [L1719] EXPR 0 data->shared.b==0 [L1719] CALL 0 ldv_assert(data->shared.b==0) [L1693] COND FALSE 0 !(!expression) [L1719] RET 0 ldv_assert(data->shared.b==0) [L1720] 0 int res = __VERIFIER_nondet_int(); [L1721] COND FALSE 0 !(\read(res)) [L1723] 0 my_dev = &data->dev [L1724] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, data={5:0}, data={5:0}, my_dev={5:24}, pthread_create(&t1, ((void *)0), my_callback, ((void *)0))=-1, res=0, t1={3:0}, t2={4:0}] [L1708] 1 struct my_data *data; [L1709] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, my_dev={5:24}, t1={3:0}, t2={4:0}] [L1709] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1710] 1 data->shared.a = 1 VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.a = 1=1154, my_dev={5:24}, t1={3:0}, t2={4:0}] [L1725] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data={5:0}, data={5:0}, data->shared.a = 1=1154, my_dev={5:24}, pthread_create(&t2, ((void *)0), my_callback, ((void *)0))=0, res=0, t1={3:0}, t2={4:0}] [L1708] 2 struct my_data *data; [L1709] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.a = 1=1154, my_dev={5:24}, t1={3:0}, t2={4:0}] [L1709] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1710] 2 data->shared.a = 1 VAL [__mptr={5:24}, arg={0:0}, arg={0:0}, data={5:0}, data->shared.a = 1=1160, my_dev={5:24}, t1={3:0}, t2={4:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: data->shared.a==0 [1718] * C: data->shared.a==0 [1718] * C: data->shared.a = 0 [1716] * C: data->shared.a = 0 [1716] * C: data->shared.b = 0 [1717] * C: data->shared.b = 0 [1717] * C: data->shared.b==0 [1719] * C: data->shared.b = 0 [1717] * C: data->shared.a = 0 [1716] * C: data->shared.b==0 [1719] * C: data->shared.b==0 [1719] * C: const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [1709] * C: data->shared.b = 0 [1717] * C: data->shared.a==0 [1718] * C: data->shared.a = 0 [1716] * C: data->shared.a==0 [1718] * C: my_dev = &data->dev [1723] * C: data->shared.b==0 [1719] and C: data->shared.a = 1 [1710] - UnprovableResult [Line: 1716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1717]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1755]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1733]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1756]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1734]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1757]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1751]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1758]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1725]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1724]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 347 locations, 27 error locations. Started 1 CEGAR loops. OverallTime: 89.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 61.7s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3272 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3272 mSDsluCounter, 1408 SdHoareTripleChecker+Invalid, 9.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2218 mSDsCounter, 811 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15264 IncrementalHoareTripleChecker+Invalid, 16075 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 811 mSolverCounterUnsat, 940 mSDtfsCounter, 15264 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 50 SyntacticMatches, 14 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35411occurred in iteration=9, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 15325 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 1844 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-03-15 20:10:33,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...