/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-5b77e9fc37942d960732eb3788a90132329d3bc4-5b77e9f [2021-10-19 14:24:24,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-19 14:24:24,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-19 14:24:24,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-19 14:24:24,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-19 14:24:24,571 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-19 14:24:24,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-19 14:24:24,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-19 14:24:24,576 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-19 14:24:24,577 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-19 14:24:24,577 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-19 14:24:24,578 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-19 14:24:24,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-19 14:24:24,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-19 14:24:24,580 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-19 14:24:24,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-19 14:24:24,581 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-19 14:24:24,581 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-19 14:24:24,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-19 14:24:24,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-19 14:24:24,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-19 14:24:24,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-19 14:24:24,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-19 14:24:24,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-19 14:24:24,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-19 14:24:24,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-19 14:24:24,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-19 14:24:24,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-19 14:24:24,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-19 14:24:24,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-19 14:24:24,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-19 14:24:24,604 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-19 14:24:24,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-19 14:24:24,604 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-19 14:24:24,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-19 14:24:24,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-19 14:24:24,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-19 14:24:24,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-19 14:24:24,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-19 14:24:24,606 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-19 14:24:24,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-19 14:24:24,613 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-10-19 14:24:24,640 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-19 14:24:24,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-19 14:24:24,640 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-19 14:24:24,640 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-19 14:24:24,641 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-19 14:24:24,641 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-19 14:24:24,641 INFO L138 SettingsManager]: * Use SBE=true [2021-10-19 14:24:24,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-19 14:24:24,641 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-19 14:24:24,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-19 14:24:24,642 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-19 14:24:24,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-19 14:24:24,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-19 14:24:24,642 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-19 14:24:24,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-19 14:24:24,642 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-19 14:24:24,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-19 14:24:24,642 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-19 14:24:24,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-19 14:24:24,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-19 14:24:24,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-19 14:24:24,642 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-10-19 14:24:24,643 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-19 14:24:24,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-19 14:24:24,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-19 14:24:24,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-19 14:24:24,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-19 14:24:24,643 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-19 14:24:24,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-19 14:24:24,643 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-19 14:24:24,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-19 14:24:24,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2021-10-19 14:24:24,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-19 14:24:24,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-19 14:24:24,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-19 14:24:24,826 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-19 14:24:24,826 INFO L275 PluginConnector]: CDTParser initialized [2021-10-19 14:24:24,827 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.i [2021-10-19 14:24:24,915 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa19ecfe7/da2dc8f74e7340aea4217f0dd81d91a1/FLAG20227f822 [2021-10-19 14:24:25,356 INFO L306 CDTParser]: Found 1 translation units. [2021-10-19 14:24:25,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.i [2021-10-19 14:24:25,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa19ecfe7/da2dc8f74e7340aea4217f0dd81d91a1/FLAG20227f822 [2021-10-19 14:24:25,687 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa19ecfe7/da2dc8f74e7340aea4217f0dd81d91a1 [2021-10-19 14:24:25,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-19 14:24:25,690 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-19 14:24:25,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-19 14:24:25,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-19 14:24:25,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-19 14:24:25,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 02:24:25" (1/1) ... [2021-10-19 14:24:25,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f7239e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:24:25, skipping insertion in model container [2021-10-19 14:24:25,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 02:24:25" (1/1) ... [2021-10-19 14:24:25,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-19 14:24:25,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-19 14:24:26,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-19 14:24:26,144 INFO L203 MainTranslator]: Completed pre-run [2021-10-19 14:24:26,180 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-19 14:24:26,227 INFO L208 MainTranslator]: Completed translation [2021-10-19 14:24:26,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:24:26 WrapperNode [2021-10-19 14:24:26,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-19 14:24:26,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-19 14:24:26,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-19 14:24:26,230 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-19 14:24:26,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:24:26" (1/1) ... [2021-10-19 14:24:26,254 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:24:26" (1/1) ... [2021-10-19 14:24:26,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-19 14:24:26,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-19 14:24:26,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-19 14:24:26,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-19 14:24:26,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:24:26" (1/1) ... [2021-10-19 14:24:26,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:24:26" (1/1) ... [2021-10-19 14:24:26,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:24:26" (1/1) ... [2021-10-19 14:24:26,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:24:26" (1/1) ... [2021-10-19 14:24:26,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:24:26" (1/1) ... [2021-10-19 14:24:26,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:24:26" (1/1) ... [2021-10-19 14:24:26,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:24:26" (1/1) ... [2021-10-19 14:24:26,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-19 14:24:26,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-19 14:24:26,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-19 14:24:26,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-19 14:24:26,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:24:26" (1/1) ... [2021-10-19 14:24:26,347 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-19 14:24:26,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-19 14:24:26,367 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) [2021-10-19 14:24:26,369 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 [2021-10-19 14:24:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-19 14:24:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-19 14:24:26,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-19 14:24:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-19 14:24:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-19 14:24:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-10-19 14:24:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-19 14:24:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-19 14:24:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-10-19 14:24:26,399 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-10-19 14:24:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-19 14:24:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-19 14:24:26,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-19 14:24:26,400 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-19 14:24:26,948 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-19 14:24:26,948 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-19 14:24:26,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 02:24:26 BoogieIcfgContainer [2021-10-19 14:24:26,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-19 14:24:26,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-19 14:24:26,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-19 14:24:26,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-19 14:24:26,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 02:24:25" (1/3) ... [2021-10-19 14:24:26,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78082c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 02:24:26, skipping insertion in model container [2021-10-19 14:24:26,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 02:24:26" (2/3) ... [2021-10-19 14:24:26,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78082c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 02:24:26, skipping insertion in model container [2021-10-19 14:24:26,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 02:24:26" (3/3) ... [2021-10-19 14:24:26,959 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_03-list2_rc.i [2021-10-19 14:24:26,964 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-19 14:24:26,964 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-19 14:24:26,965 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2021-10-19 14:24:26,965 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-19 14:24:27,014 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,014 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,015 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,015 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,015 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,015 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,015 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,015 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,015 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,015 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,016 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,016 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,016 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,016 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,016 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,016 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,017 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,017 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,017 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,017 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,017 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,017 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,018 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,018 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,018 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,018 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,018 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,018 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,019 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,019 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,019 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,019 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,020 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,020 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,020 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,020 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,020 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,020 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,020 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,020 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,020 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,020 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,021 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,021 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,021 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,021 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,021 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,021 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,021 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,021 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,021 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,021 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,021 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,022 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,022 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,022 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,022 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,022 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,022 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,022 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,022 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,023 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,023 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,023 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,023 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,023 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,023 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,023 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,023 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,023 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,023 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,023 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,023 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,024 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,024 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,024 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,024 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,024 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,024 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,025 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,025 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,025 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,025 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,025 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,025 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,025 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,025 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,025 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,025 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,025 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,026 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,026 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,026 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,026 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,026 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,026 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,026 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,026 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,026 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,026 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,026 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,027 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,027 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,027 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,027 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,027 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,027 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,027 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,027 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,027 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,028 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,028 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,028 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,028 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,028 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,028 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,028 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,028 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,029 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,029 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,029 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,029 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,029 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,029 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,029 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,029 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,030 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,030 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,030 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,030 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,030 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,030 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,031 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,031 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,031 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,031 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,031 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,031 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,031 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,031 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,031 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,031 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,032 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,032 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,032 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,032 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,032 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,032 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,032 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,032 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,032 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,032 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,033 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,033 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,033 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,033 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,033 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,033 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,034 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,034 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,034 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,034 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,034 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,034 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,034 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,034 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,034 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,034 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,034 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,034 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,035 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,035 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,035 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,035 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,035 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,035 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,035 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,035 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,035 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,035 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,035 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,035 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,036 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,036 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,036 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,036 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,036 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,036 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,036 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,036 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,036 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,036 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,036 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,037 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,037 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,037 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,037 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,037 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,037 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,037 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,037 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,037 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,037 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,037 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,040 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,040 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,040 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,040 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,040 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,041 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,041 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,041 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,041 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,041 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,041 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,041 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,041 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,041 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,042 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,042 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-19 14:24:27,045 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-19 14:24:27,081 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-19 14:24:27,086 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-19 14:24:27,086 INFO L340 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2021-10-19 14:24:27,101 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 278 places, 274 transitions, 553 flow [2021-10-19 14:24:27,187 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4005 states, 3929 states have (on average 1.9686943242555357) internal successors, (7735), 4004 states have internal predecessors, (7735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 4005 states, 3929 states have (on average 1.9686943242555357) internal successors, (7735), 4004 states have internal predecessors, (7735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:27,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-19 14:24:27,200 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:27,200 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:27,200 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:27,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:27,204 INFO L82 PathProgramCache]: Analyzing trace with hash 534204318, now seen corresponding path program 1 times [2021-10-19 14:24:27,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:27,210 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696559013] [2021-10-19 14:24:27,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:27,211 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:27,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:27,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696559013] [2021-10-19 14:24:27,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696559013] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:27,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:27,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-19 14:24:27,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134531704] [2021-10-19 14:24:27,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-19 14:24:27,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:27,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-19 14:24:27,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-19 14:24:27,550 INFO L87 Difference]: Start difference. First operand has 4005 states, 3929 states have (on average 1.9686943242555357) internal successors, (7735), 4004 states have internal predecessors, (7735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:27,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:27,740 INFO L93 Difference]: Finished difference Result 4002 states and 7732 transitions. [2021-10-19 14:24:27,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-19 14:24:27,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2021-10-19 14:24:27,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:27,764 INFO L225 Difference]: With dead ends: 4002 [2021-10-19 14:24:27,764 INFO L226 Difference]: Without dead ends: 4002 [2021-10-19 14:24:27,765 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.0ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-19 14:24:27,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4002 states. [2021-10-19 14:24:27,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4002 to 4002. [2021-10-19 14:24:27,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4002 states, 3929 states have (on average 1.9679307711885976) internal successors, (7732), 4001 states have internal predecessors, (7732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:27,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4002 states to 4002 states and 7732 transitions. [2021-10-19 14:24:27,954 INFO L78 Accepts]: Start accepts. Automaton has 4002 states and 7732 transitions. Word has length 44 [2021-10-19 14:24:27,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:27,954 INFO L470 AbstractCegarLoop]: Abstraction has 4002 states and 7732 transitions. [2021-10-19 14:24:27,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:27,954 INFO L276 IsEmpty]: Start isEmpty. Operand 4002 states and 7732 transitions. [2021-10-19 14:24:27,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-19 14:24:27,955 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:27,955 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:27,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-19 14:24:27,956 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:27,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:27,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1949566384, now seen corresponding path program 1 times [2021-10-19 14:24:27,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:27,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721345102] [2021-10-19 14:24:27,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:27,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:28,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:28,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:28,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721345102] [2021-10-19 14:24:28,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721345102] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:28,129 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:28,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-19 14:24:28,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403217883] [2021-10-19 14:24:28,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-19 14:24:28,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:28,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-19 14:24:28,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-19 14:24:28,132 INFO L87 Difference]: Start difference. First operand 4002 states and 7732 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:28,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:28,381 INFO L93 Difference]: Finished difference Result 3999 states and 7729 transitions. [2021-10-19 14:24:28,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-19 14:24:28,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-10-19 14:24:28,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:28,395 INFO L225 Difference]: With dead ends: 3999 [2021-10-19 14:24:28,395 INFO L226 Difference]: Without dead ends: 3999 [2021-10-19 14:24:28,395 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.1ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-19 14:24:28,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3999 states. [2021-10-19 14:24:28,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3999 to 3999. [2021-10-19 14:24:28,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3999 states, 3929 states have (on average 1.9671672181216595) internal successors, (7729), 3998 states have internal predecessors, (7729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:28,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3999 states to 3999 states and 7729 transitions. [2021-10-19 14:24:28,474 INFO L78 Accepts]: Start accepts. Automaton has 3999 states and 7729 transitions. Word has length 52 [2021-10-19 14:24:28,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:28,474 INFO L470 AbstractCegarLoop]: Abstraction has 3999 states and 7729 transitions. [2021-10-19 14:24:28,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:28,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3999 states and 7729 transitions. [2021-10-19 14:24:28,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-19 14:24:28,475 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:28,475 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:28,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-19 14:24:28,476 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:28,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:28,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1139171194, now seen corresponding path program 1 times [2021-10-19 14:24:28,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:28,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663150091] [2021-10-19 14:24:28,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:28,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:28,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:28,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663150091] [2021-10-19 14:24:28,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663150091] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:28,509 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:28,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-19 14:24:28,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993505541] [2021-10-19 14:24:28,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-19 14:24:28,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:28,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-19 14:24:28,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-19 14:24:28,510 INFO L87 Difference]: Start difference. First operand 3999 states and 7729 transitions. Second operand has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:28,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:28,538 INFO L93 Difference]: Finished difference Result 3998 states and 7728 transitions. [2021-10-19 14:24:28,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-19 14:24:28,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-10-19 14:24:28,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:28,578 INFO L225 Difference]: With dead ends: 3998 [2021-10-19 14:24:28,578 INFO L226 Difference]: Without dead ends: 3998 [2021-10-19 14:24:28,578 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-19 14:24:28,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3998 states. [2021-10-19 14:24:28,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3998 to 3998. [2021-10-19 14:24:28,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3998 states, 3929 states have (on average 1.96691270043268) internal successors, (7728), 3997 states have internal predecessors, (7728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:28,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3998 states to 3998 states and 7728 transitions. [2021-10-19 14:24:28,647 INFO L78 Accepts]: Start accepts. Automaton has 3998 states and 7728 transitions. Word has length 58 [2021-10-19 14:24:28,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:28,648 INFO L470 AbstractCegarLoop]: Abstraction has 3998 states and 7728 transitions. [2021-10-19 14:24:28,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:28,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3998 states and 7728 transitions. [2021-10-19 14:24:28,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-19 14:24:28,649 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:28,649 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:28,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-19 14:24:28,649 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:28,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:28,649 INFO L82 PathProgramCache]: Analyzing trace with hash -560311575, now seen corresponding path program 1 times [2021-10-19 14:24:28,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:28,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711525464] [2021-10-19 14:24:28,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:28,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:28,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:28,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:28,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711525464] [2021-10-19 14:24:28,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711525464] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:28,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:28,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-19 14:24:28,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082051630] [2021-10-19 14:24:28,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-19 14:24:28,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:28,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-19 14:24:28,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-19 14:24:28,678 INFO L87 Difference]: Start difference. First operand 3998 states and 7728 transitions. Second operand has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:28,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:28,702 INFO L93 Difference]: Finished difference Result 3871 states and 7478 transitions. [2021-10-19 14:24:28,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-19 14:24:28,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2021-10-19 14:24:28,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:28,715 INFO L225 Difference]: With dead ends: 3871 [2021-10-19 14:24:28,715 INFO L226 Difference]: Without dead ends: 3871 [2021-10-19 14:24:28,715 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-19 14:24:28,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3871 states. [2021-10-19 14:24:28,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3871 to 3871. [2021-10-19 14:24:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3871 states, 3819 states have (on average 1.9581042157632889) internal successors, (7478), 3870 states have internal predecessors, (7478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3871 states to 3871 states and 7478 transitions. [2021-10-19 14:24:28,783 INFO L78 Accepts]: Start accepts. Automaton has 3871 states and 7478 transitions. Word has length 62 [2021-10-19 14:24:28,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:28,784 INFO L470 AbstractCegarLoop]: Abstraction has 3871 states and 7478 transitions. [2021-10-19 14:24:28,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:28,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3871 states and 7478 transitions. [2021-10-19 14:24:28,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-10-19 14:24:28,785 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:28,785 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:28,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-19 14:24:28,785 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:28,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:28,785 INFO L82 PathProgramCache]: Analyzing trace with hash -420702480, now seen corresponding path program 1 times [2021-10-19 14:24:28,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:28,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121096141] [2021-10-19 14:24:28,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:28,786 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:28,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:28,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:28,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121096141] [2021-10-19 14:24:28,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121096141] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:28,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:28,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-19 14:24:28,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009964815] [2021-10-19 14:24:28,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-19 14:24:28,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:28,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-19 14:24:28,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-19 14:24:28,868 INFO L87 Difference]: Start difference. First operand 3871 states and 7478 transitions. Second operand has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:29,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:29,047 INFO L93 Difference]: Finished difference Result 3870 states and 7477 transitions. [2021-10-19 14:24:29,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-19 14:24:29,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2021-10-19 14:24:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:29,067 INFO L225 Difference]: With dead ends: 3870 [2021-10-19 14:24:29,068 INFO L226 Difference]: Without dead ends: 3870 [2021-10-19 14:24:29,068 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.3ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-19 14:24:29,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3870 states. [2021-10-19 14:24:29,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3870 to 3870. [2021-10-19 14:24:29,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3870 states, 3819 states have (on average 1.9578423671118095) internal successors, (7477), 3869 states have internal predecessors, (7477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3870 states to 3870 states and 7477 transitions. [2021-10-19 14:24:29,152 INFO L78 Accepts]: Start accepts. Automaton has 3870 states and 7477 transitions. Word has length 91 [2021-10-19 14:24:29,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:29,152 INFO L470 AbstractCegarLoop]: Abstraction has 3870 states and 7477 transitions. [2021-10-19 14:24:29,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3870 states and 7477 transitions. [2021-10-19 14:24:29,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-10-19 14:24:29,156 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:29,156 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:29,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-19 14:24:29,156 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:29,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:29,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1261885141, now seen corresponding path program 1 times [2021-10-19 14:24:29,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:29,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510262806] [2021-10-19 14:24:29,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:29,157 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:29,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:29,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510262806] [2021-10-19 14:24:29,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510262806] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:29,223 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:29,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-19 14:24:29,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831453089] [2021-10-19 14:24:29,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-19 14:24:29,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:29,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-19 14:24:29,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-19 14:24:29,225 INFO L87 Difference]: Start difference. First operand 3870 states and 7477 transitions. Second operand has 3 states, 2 states have (on average 48.5) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:29,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:29,249 INFO L93 Difference]: Finished difference Result 3869 states and 7476 transitions. [2021-10-19 14:24:29,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-19 14:24:29,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 48.5) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2021-10-19 14:24:29,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:29,265 INFO L225 Difference]: With dead ends: 3869 [2021-10-19 14:24:29,265 INFO L226 Difference]: Without dead ends: 3869 [2021-10-19 14:24:29,265 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-19 14:24:29,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3869 states. [2021-10-19 14:24:29,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3869 to 3869. [2021-10-19 14:24:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3869 states, 3819 states have (on average 1.9575805184603299) internal successors, (7476), 3868 states have internal predecessors, (7476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:29,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3869 states to 3869 states and 7476 transitions. [2021-10-19 14:24:29,328 INFO L78 Accepts]: Start accepts. Automaton has 3869 states and 7476 transitions. Word has length 97 [2021-10-19 14:24:29,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:29,328 INFO L470 AbstractCegarLoop]: Abstraction has 3869 states and 7476 transitions. [2021-10-19 14:24:29,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 48.5) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:29,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3869 states and 7476 transitions. [2021-10-19 14:24:29,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-19 14:24:29,334 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:29,334 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:29,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-19 14:24:29,334 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:29,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:29,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1836631181, now seen corresponding path program 1 times [2021-10-19 14:24:29,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:29,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297181692] [2021-10-19 14:24:29,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:29,338 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:29,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:29,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297181692] [2021-10-19 14:24:29,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297181692] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:29,378 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:29,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-19 14:24:29,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25254440] [2021-10-19 14:24:29,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-19 14:24:29,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:29,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-19 14:24:29,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-19 14:24:29,379 INFO L87 Difference]: Start difference. First operand 3869 states and 7476 transitions. Second operand has 3 states, 2 states have (on average 50.5) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:29,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:29,398 INFO L93 Difference]: Finished difference Result 3744 states and 7230 transitions. [2021-10-19 14:24:29,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-19 14:24:29,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 50.5) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2021-10-19 14:24:29,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:29,405 INFO L225 Difference]: With dead ends: 3744 [2021-10-19 14:24:29,405 INFO L226 Difference]: Without dead ends: 3744 [2021-10-19 14:24:29,405 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-19 14:24:29,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2021-10-19 14:24:29,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 3744. [2021-10-19 14:24:29,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3744 states, 3709 states have (on average 1.9493124831490969) internal successors, (7230), 3743 states have internal predecessors, (7230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 7230 transitions. [2021-10-19 14:24:29,486 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 7230 transitions. Word has length 101 [2021-10-19 14:24:29,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:29,486 INFO L470 AbstractCegarLoop]: Abstraction has 3744 states and 7230 transitions. [2021-10-19 14:24:29,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 50.5) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 7230 transitions. [2021-10-19 14:24:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-10-19 14:24:29,487 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:29,487 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:29,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-19 14:24:29,488 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:29,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:29,488 INFO L82 PathProgramCache]: Analyzing trace with hash -568107311, now seen corresponding path program 1 times [2021-10-19 14:24:29,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:29,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582221748] [2021-10-19 14:24:29,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:29,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:29,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:29,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:29,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582221748] [2021-10-19 14:24:29,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582221748] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:29,585 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:29,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-19 14:24:29,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506576816] [2021-10-19 14:24:29,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-19 14:24:29,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:29,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-19 14:24:29,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-19 14:24:29,587 INFO L87 Difference]: Start difference. First operand 3744 states and 7230 transitions. Second operand has 6 states, 5 states have (on average 26.0) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:29,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:29,738 INFO L93 Difference]: Finished difference Result 3743 states and 7229 transitions. [2021-10-19 14:24:29,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-19 14:24:29,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 26.0) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2021-10-19 14:24:29,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:29,746 INFO L225 Difference]: With dead ends: 3743 [2021-10-19 14:24:29,747 INFO L226 Difference]: Without dead ends: 3743 [2021-10-19 14:24:29,747 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.9ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-19 14:24:29,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3743 states. [2021-10-19 14:24:29,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3743 to 3743. [2021-10-19 14:24:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3743 states, 3709 states have (on average 1.949042868697762) internal successors, (7229), 3742 states have internal predecessors, (7229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:29,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 7229 transitions. [2021-10-19 14:24:29,817 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 7229 transitions. Word has length 130 [2021-10-19 14:24:29,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:29,817 INFO L470 AbstractCegarLoop]: Abstraction has 3743 states and 7229 transitions. [2021-10-19 14:24:29,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.0) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:29,817 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 7229 transitions. [2021-10-19 14:24:29,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-10-19 14:24:29,818 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:29,819 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:29,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-19 14:24:29,819 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:29,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:29,819 INFO L82 PathProgramCache]: Analyzing trace with hash 449599800, now seen corresponding path program 1 times [2021-10-19 14:24:29,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:29,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379045727] [2021-10-19 14:24:29,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:29,820 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:29,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:29,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:29,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379045727] [2021-10-19 14:24:29,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379045727] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:29,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:29,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-19 14:24:29,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910914832] [2021-10-19 14:24:29,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-19 14:24:29,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:29,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-19 14:24:29,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-19 14:24:29,915 INFO L87 Difference]: Start difference. First operand 3743 states and 7229 transitions. Second operand has 6 states, 5 states have (on average 29.2) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:30,345 INFO L93 Difference]: Finished difference Result 5628 states and 10910 transitions. [2021-10-19 14:24:30,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-19 14:24:30,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 29.2) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2021-10-19 14:24:30,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:30,357 INFO L225 Difference]: With dead ends: 5628 [2021-10-19 14:24:30,357 INFO L226 Difference]: Without dead ends: 5628 [2021-10-19 14:24:30,357 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.5ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-19 14:24:30,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5628 states. [2021-10-19 14:24:30,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5628 to 3847. [2021-10-19 14:24:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3847 states, 3819 states have (on average 1.9465828750981933) internal successors, (7434), 3846 states have internal predecessors, (7434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:30,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3847 states to 3847 states and 7434 transitions. [2021-10-19 14:24:30,423 INFO L78 Accepts]: Start accepts. Automaton has 3847 states and 7434 transitions. Word has length 146 [2021-10-19 14:24:30,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:30,423 INFO L470 AbstractCegarLoop]: Abstraction has 3847 states and 7434 transitions. [2021-10-19 14:24:30,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.2) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:30,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3847 states and 7434 transitions. [2021-10-19 14:24:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-10-19 14:24:30,425 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:30,425 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:30,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-19 14:24:30,425 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:30,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:30,425 INFO L82 PathProgramCache]: Analyzing trace with hash -2043033092, now seen corresponding path program 1 times [2021-10-19 14:24:30,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:30,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551427354] [2021-10-19 14:24:30,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:30,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:30,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:30,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:30,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551427354] [2021-10-19 14:24:30,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551427354] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:30,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:30,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-19 14:24:30,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727842714] [2021-10-19 14:24:30,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-19 14:24:30,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:30,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-19 14:24:30,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-19 14:24:30,519 INFO L87 Difference]: Start difference. First operand 3847 states and 7434 transitions. Second operand has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:30,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:30,821 INFO L93 Difference]: Finished difference Result 3794 states and 7329 transitions. [2021-10-19 14:24:30,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-19 14:24:30,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2021-10-19 14:24:30,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:30,828 INFO L225 Difference]: With dead ends: 3794 [2021-10-19 14:24:30,828 INFO L226 Difference]: Without dead ends: 3794 [2021-10-19 14:24:30,829 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.2ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-19 14:24:30,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3794 states. [2021-10-19 14:24:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3794 to 3794. [2021-10-19 14:24:30,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3794 states, 3770 states have (on average 1.9440318302387267) internal successors, (7329), 3793 states have internal predecessors, (7329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 7329 transitions. [2021-10-19 14:24:30,885 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 7329 transitions. Word has length 152 [2021-10-19 14:24:30,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:30,886 INFO L470 AbstractCegarLoop]: Abstraction has 3794 states and 7329 transitions. [2021-10-19 14:24:30,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 7329 transitions. [2021-10-19 14:24:30,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-10-19 14:24:30,887 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:30,887 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:30,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-19 14:24:30,887 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:30,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:30,888 INFO L82 PathProgramCache]: Analyzing trace with hash 250463406, now seen corresponding path program 1 times [2021-10-19 14:24:30,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:30,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384179144] [2021-10-19 14:24:30,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:30,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:30,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:30,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:30,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384179144] [2021-10-19 14:24:30,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384179144] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:30,961 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:30,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-19 14:24:30,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806165298] [2021-10-19 14:24:30,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-19 14:24:30,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:30,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-19 14:24:30,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-19 14:24:30,962 INFO L87 Difference]: Start difference. First operand 3794 states and 7329 transitions. Second operand has 6 states, 5 states have (on average 31.2) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:31,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:31,456 INFO L93 Difference]: Finished difference Result 5038 states and 9742 transitions. [2021-10-19 14:24:31,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-19 14:24:31,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 31.2) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2021-10-19 14:24:31,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:31,467 INFO L225 Difference]: With dead ends: 5038 [2021-10-19 14:24:31,467 INFO L226 Difference]: Without dead ends: 4958 [2021-10-19 14:24:31,467 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.4ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-19 14:24:31,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2021-10-19 14:24:31,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4040. [2021-10-19 14:24:31,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4040 states, 4016 states have (on average 1.9434760956175299) internal successors, (7805), 4039 states have internal predecessors, (7805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4040 states to 4040 states and 7805 transitions. [2021-10-19 14:24:31,539 INFO L78 Accepts]: Start accepts. Automaton has 4040 states and 7805 transitions. Word has length 156 [2021-10-19 14:24:31,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:31,539 INFO L470 AbstractCegarLoop]: Abstraction has 4040 states and 7805 transitions. [2021-10-19 14:24:31,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 31.2) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:31,540 INFO L276 IsEmpty]: Start isEmpty. Operand 4040 states and 7805 transitions. [2021-10-19 14:24:31,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-10-19 14:24:31,541 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:31,541 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:31,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-19 14:24:31,541 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:31,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:31,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1478337153, now seen corresponding path program 1 times [2021-10-19 14:24:31,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:31,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770696011] [2021-10-19 14:24:31,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:31,542 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:31,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:31,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770696011] [2021-10-19 14:24:31,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770696011] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:31,622 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:31,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-19 14:24:31,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622939189] [2021-10-19 14:24:31,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-19 14:24:31,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:31,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-19 14:24:31,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-19 14:24:31,623 INFO L87 Difference]: Start difference. First operand 4040 states and 7805 transitions. Second operand has 6 states, 5 states have (on average 32.0) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:31,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:31,850 INFO L93 Difference]: Finished difference Result 4268 states and 8256 transitions. [2021-10-19 14:24:31,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-19 14:24:31,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 32.0) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2021-10-19 14:24:31,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:31,859 INFO L225 Difference]: With dead ends: 4268 [2021-10-19 14:24:31,860 INFO L226 Difference]: Without dead ends: 4268 [2021-10-19 14:24:31,860 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.4ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-19 14:24:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2021-10-19 14:24:31,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4213. [2021-10-19 14:24:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4213 states, 4189 states have (on average 1.9448555741227023) internal successors, (8147), 4212 states have internal predecessors, (8147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4213 states to 4213 states and 8147 transitions. [2021-10-19 14:24:31,923 INFO L78 Accepts]: Start accepts. Automaton has 4213 states and 8147 transitions. Word has length 160 [2021-10-19 14:24:31,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:31,923 INFO L470 AbstractCegarLoop]: Abstraction has 4213 states and 8147 transitions. [2021-10-19 14:24:31,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.0) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:31,924 INFO L276 IsEmpty]: Start isEmpty. Operand 4213 states and 8147 transitions. [2021-10-19 14:24:31,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-10-19 14:24:31,925 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:31,925 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:31,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-19 14:24:31,926 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:31,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:31,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1075034897, now seen corresponding path program 1 times [2021-10-19 14:24:31,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:31,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027447590] [2021-10-19 14:24:31,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:31,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:31,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:31,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:31,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027447590] [2021-10-19 14:24:31,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027447590] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:31,977 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:31,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-19 14:24:31,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746194357] [2021-10-19 14:24:31,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-19 14:24:31,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:31,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-19 14:24:31,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-19 14:24:31,978 INFO L87 Difference]: Start difference. First operand 4213 states and 8147 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:32,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:32,001 INFO L93 Difference]: Finished difference Result 3450 states and 6525 transitions. [2021-10-19 14:24:32,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-19 14:24:32,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2021-10-19 14:24:32,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:32,007 INFO L225 Difference]: With dead ends: 3450 [2021-10-19 14:24:32,007 INFO L226 Difference]: Without dead ends: 3450 [2021-10-19 14:24:32,008 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-19 14:24:32,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2021-10-19 14:24:32,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 3222. [2021-10-19 14:24:32,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3222 states, 3204 states have (on average 1.9091760299625469) internal successors, (6117), 3221 states have internal predecessors, (6117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:32,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 3222 states and 6117 transitions. [2021-10-19 14:24:32,053 INFO L78 Accepts]: Start accepts. Automaton has 3222 states and 6117 transitions. Word has length 168 [2021-10-19 14:24:32,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:32,053 INFO L470 AbstractCegarLoop]: Abstraction has 3222 states and 6117 transitions. [2021-10-19 14:24:32,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:32,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3222 states and 6117 transitions. [2021-10-19 14:24:32,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-10-19 14:24:32,054 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:32,054 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:32,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-19 14:24:32,055 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:32,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:32,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1596973953, now seen corresponding path program 1 times [2021-10-19 14:24:32,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:32,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802563389] [2021-10-19 14:24:32,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:32,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:32,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:32,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:32,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802563389] [2021-10-19 14:24:32,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802563389] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:32,143 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:32,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-19 14:24:32,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859226496] [2021-10-19 14:24:32,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-19 14:24:32,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:32,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-19 14:24:32,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-19 14:24:32,144 INFO L87 Difference]: Start difference. First operand 3222 states and 6117 transitions. Second operand has 6 states, 5 states have (on average 33.6) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:32,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:32,648 INFO L93 Difference]: Finished difference Result 3689 states and 6987 transitions. [2021-10-19 14:24:32,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-19 14:24:32,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 33.6) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2021-10-19 14:24:32,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:32,654 INFO L225 Difference]: With dead ends: 3689 [2021-10-19 14:24:32,654 INFO L226 Difference]: Without dead ends: 3425 [2021-10-19 14:24:32,655 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.6ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-19 14:24:32,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3425 states. [2021-10-19 14:24:32,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3425 to 3002. [2021-10-19 14:24:32,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3002 states, 2987 states have (on average 1.8901908269166388) internal successors, (5646), 3001 states have internal predecessors, (5646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:32,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 5646 transitions. [2021-10-19 14:24:32,750 INFO L78 Accepts]: Start accepts. Automaton has 3002 states and 5646 transitions. Word has length 168 [2021-10-19 14:24:32,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:32,751 INFO L470 AbstractCegarLoop]: Abstraction has 3002 states and 5646 transitions. [2021-10-19 14:24:32,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.6) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:32,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 5646 transitions. [2021-10-19 14:24:32,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-10-19 14:24:32,752 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:32,753 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:32,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-19 14:24:32,754 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:32,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:32,754 INFO L82 PathProgramCache]: Analyzing trace with hash 679956526, now seen corresponding path program 1 times [2021-10-19 14:24:32,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:32,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139993274] [2021-10-19 14:24:32,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:32,755 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:32,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:32,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139993274] [2021-10-19 14:24:32,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139993274] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:32,848 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:32,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-19 14:24:32,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260861168] [2021-10-19 14:24:32,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-19 14:24:32,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:32,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-19 14:24:32,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-19 14:24:32,849 INFO L87 Difference]: Start difference. First operand 3002 states and 5646 transitions. Second operand has 6 states, 5 states have (on average 36.2) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:33,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:33,118 INFO L93 Difference]: Finished difference Result 2946 states and 5536 transitions. [2021-10-19 14:24:33,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-19 14:24:33,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 36.2) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 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 181 [2021-10-19 14:24:33,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:33,124 INFO L225 Difference]: With dead ends: 2946 [2021-10-19 14:24:33,124 INFO L226 Difference]: Without dead ends: 2946 [2021-10-19 14:24:33,125 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.3ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-19 14:24:33,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2021-10-19 14:24:33,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2946. [2021-10-19 14:24:33,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2946 states, 2934 states have (on average 1.8868438991138379) internal successors, (5536), 2945 states have internal predecessors, (5536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:33,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 5536 transitions. [2021-10-19 14:24:33,159 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 5536 transitions. Word has length 181 [2021-10-19 14:24:33,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:33,159 INFO L470 AbstractCegarLoop]: Abstraction has 2946 states and 5536 transitions. [2021-10-19 14:24:33,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 36.2) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:33,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 5536 transitions. [2021-10-19 14:24:33,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-10-19 14:24:33,161 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:33,162 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:33,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-19 14:24:33,162 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:33,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:33,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1299005305, now seen corresponding path program 1 times [2021-10-19 14:24:33,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:33,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130677537] [2021-10-19 14:24:33,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:33,162 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:33,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:33,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:33,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130677537] [2021-10-19 14:24:33,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130677537] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:33,895 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:33,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-10-19 14:24:33,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300618816] [2021-10-19 14:24:33,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-10-19 14:24:33,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:33,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-19 14:24:33,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2021-10-19 14:24:33,896 INFO L87 Difference]: Start difference. First operand 2946 states and 5536 transitions. Second operand has 22 states, 21 states have (on average 9.0) internal successors, (189), 22 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:35,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:35,981 INFO L93 Difference]: Finished difference Result 3153 states and 5928 transitions. [2021-10-19 14:24:35,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-10-19 14:24:35,982 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.0) internal successors, (189), 22 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2021-10-19 14:24:35,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:35,987 INFO L225 Difference]: With dead ends: 3153 [2021-10-19 14:24:35,987 INFO L226 Difference]: Without dead ends: 3153 [2021-10-19 14:24:35,988 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 11 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 944.3ms TimeCoverageRelationStatistics Valid=430, Invalid=2540, Unknown=0, NotChecked=0, Total=2970 [2021-10-19 14:24:35,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2021-10-19 14:24:36,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 3024. [2021-10-19 14:24:36,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3024 states, 3012 states have (on average 1.8907702523240373) internal successors, (5695), 3023 states have internal predecessors, (5695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 3024 states and 5695 transitions. [2021-10-19 14:24:36,025 INFO L78 Accepts]: Start accepts. Automaton has 3024 states and 5695 transitions. Word has length 189 [2021-10-19 14:24:36,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:36,025 INFO L470 AbstractCegarLoop]: Abstraction has 3024 states and 5695 transitions. [2021-10-19 14:24:36,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.0) internal successors, (189), 22 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:36,025 INFO L276 IsEmpty]: Start isEmpty. Operand 3024 states and 5695 transitions. [2021-10-19 14:24:36,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-10-19 14:24:36,027 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:36,027 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:36,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-19 14:24:36,028 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:36,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:36,028 INFO L82 PathProgramCache]: Analyzing trace with hash 743702643, now seen corresponding path program 1 times [2021-10-19 14:24:36,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:36,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178226806] [2021-10-19 14:24:36,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:36,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:36,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:36,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:36,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178226806] [2021-10-19 14:24:36,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178226806] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:36,463 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:36,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-19 14:24:36,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296362554] [2021-10-19 14:24:36,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-19 14:24:36,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:36,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-19 14:24:36,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2021-10-19 14:24:36,464 INFO L87 Difference]: Start difference. First operand 3024 states and 5695 transitions. Second operand has 21 states, 20 states have (on average 9.45) internal successors, (189), 21 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:37,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:37,857 INFO L93 Difference]: Finished difference Result 3367 states and 6353 transitions. [2021-10-19 14:24:37,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-19 14:24:37,857 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 9.45) internal successors, (189), 21 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2021-10-19 14:24:37,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:37,863 INFO L225 Difference]: With dead ends: 3367 [2021-10-19 14:24:37,863 INFO L226 Difference]: Without dead ends: 3367 [2021-10-19 14:24:37,864 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 632.2ms TimeCoverageRelationStatistics Valid=401, Invalid=2149, Unknown=0, NotChecked=0, Total=2550 [2021-10-19 14:24:37,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3367 states. [2021-10-19 14:24:37,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3367 to 2959. [2021-10-19 14:24:37,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2959 states, 2948 states have (on average 1.8867028493894165) internal successors, (5562), 2958 states have internal predecessors, (5562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:37,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 5562 transitions. [2021-10-19 14:24:37,908 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 5562 transitions. Word has length 189 [2021-10-19 14:24:37,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:37,908 INFO L470 AbstractCegarLoop]: Abstraction has 2959 states and 5562 transitions. [2021-10-19 14:24:37,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 9.45) internal successors, (189), 21 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 5562 transitions. [2021-10-19 14:24:37,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-10-19 14:24:37,910 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:37,911 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:37,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-19 14:24:37,911 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:37,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:37,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1273272437, now seen corresponding path program 2 times [2021-10-19 14:24:37,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:37,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117503781] [2021-10-19 14:24:37,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:37,911 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:38,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:38,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:38,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117503781] [2021-10-19 14:24:38,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117503781] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:38,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:38,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-10-19 14:24:38,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194851302] [2021-10-19 14:24:38,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-10-19 14:24:38,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:38,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-19 14:24:38,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2021-10-19 14:24:38,461 INFO L87 Difference]: Start difference. First operand 2959 states and 5562 transitions. Second operand has 22 states, 21 states have (on average 9.0) internal successors, (189), 22 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:39,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:39,921 INFO L93 Difference]: Finished difference Result 3920 states and 7417 transitions. [2021-10-19 14:24:39,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-10-19 14:24:39,922 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.0) internal successors, (189), 22 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2021-10-19 14:24:39,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:39,928 INFO L225 Difference]: With dead ends: 3920 [2021-10-19 14:24:39,928 INFO L226 Difference]: Without dead ends: 3920 [2021-10-19 14:24:39,929 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 11 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 642.4ms TimeCoverageRelationStatistics Valid=334, Invalid=1828, Unknown=0, NotChecked=0, Total=2162 [2021-10-19 14:24:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2021-10-19 14:24:40,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 2959. [2021-10-19 14:24:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2959 states, 2948 states have (on average 1.8867028493894165) internal successors, (5562), 2958 states have internal predecessors, (5562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:40,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 5562 transitions. [2021-10-19 14:24:40,007 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 5562 transitions. Word has length 189 [2021-10-19 14:24:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:40,007 INFO L470 AbstractCegarLoop]: Abstraction has 2959 states and 5562 transitions. [2021-10-19 14:24:40,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.0) internal successors, (189), 22 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:40,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 5562 transitions. [2021-10-19 14:24:40,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-10-19 14:24:40,010 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:40,010 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:40,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-19 14:24:40,010 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:40,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:40,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1245907161, now seen corresponding path program 3 times [2021-10-19 14:24:40,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:40,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061467956] [2021-10-19 14:24:40,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:40,011 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:40,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:40,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:40,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061467956] [2021-10-19 14:24:40,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061467956] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:40,719 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:40,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-10-19 14:24:40,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132248809] [2021-10-19 14:24:40,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-10-19 14:24:40,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:40,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-19 14:24:40,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2021-10-19 14:24:40,720 INFO L87 Difference]: Start difference. First operand 2959 states and 5562 transitions. Second operand has 22 states, 21 states have (on average 9.0) internal successors, (189), 22 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:42,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:42,657 INFO L93 Difference]: Finished difference Result 3973 states and 7523 transitions. [2021-10-19 14:24:42,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-19 14:24:42,657 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.0) internal successors, (189), 22 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2021-10-19 14:24:42,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:42,683 INFO L225 Difference]: With dead ends: 3973 [2021-10-19 14:24:42,683 INFO L226 Difference]: Without dead ends: 3973 [2021-10-19 14:24:42,684 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 11 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 900.0ms TimeCoverageRelationStatistics Valid=366, Invalid=2084, Unknown=0, NotChecked=0, Total=2450 [2021-10-19 14:24:42,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3973 states. [2021-10-19 14:24:42,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3973 to 2959. [2021-10-19 14:24:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2959 states, 2948 states have (on average 1.8867028493894165) internal successors, (5562), 2958 states have internal predecessors, (5562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:42,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 5562 transitions. [2021-10-19 14:24:42,748 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 5562 transitions. Word has length 189 [2021-10-19 14:24:42,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:42,748 INFO L470 AbstractCegarLoop]: Abstraction has 2959 states and 5562 transitions. [2021-10-19 14:24:42,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.0) internal successors, (189), 22 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:42,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 5562 transitions. [2021-10-19 14:24:42,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-10-19 14:24:42,752 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:42,752 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:42,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-19 14:24:42,752 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:42,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:42,753 INFO L82 PathProgramCache]: Analyzing trace with hash 976638669, now seen corresponding path program 4 times [2021-10-19 14:24:42,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:42,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439460329] [2021-10-19 14:24:42,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:42,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:43,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:43,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:43,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439460329] [2021-10-19 14:24:43,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439460329] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:43,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:43,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-10-19 14:24:43,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911370281] [2021-10-19 14:24:43,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-10-19 14:24:43,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:43,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-19 14:24:43,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2021-10-19 14:24:43,527 INFO L87 Difference]: Start difference. First operand 2959 states and 5562 transitions. Second operand has 22 states, 21 states have (on average 9.0) internal successors, (189), 22 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:45,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:45,708 INFO L93 Difference]: Finished difference Result 3996 states and 7569 transitions. [2021-10-19 14:24:45,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-19 14:24:45,708 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.0) internal successors, (189), 22 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2021-10-19 14:24:45,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:45,714 INFO L225 Difference]: With dead ends: 3996 [2021-10-19 14:24:45,715 INFO L226 Difference]: Without dead ends: 3996 [2021-10-19 14:24:45,715 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 11 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 1019.3ms TimeCoverageRelationStatistics Valid=373, Invalid=2177, Unknown=0, NotChecked=0, Total=2550 [2021-10-19 14:24:45,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3996 states. [2021-10-19 14:24:45,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3996 to 2959. [2021-10-19 14:24:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2959 states, 2948 states have (on average 1.8867028493894165) internal successors, (5562), 2958 states have internal predecessors, (5562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:45,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 5562 transitions. [2021-10-19 14:24:45,776 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 5562 transitions. Word has length 189 [2021-10-19 14:24:45,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:45,776 INFO L470 AbstractCegarLoop]: Abstraction has 2959 states and 5562 transitions. [2021-10-19 14:24:45,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.0) internal successors, (189), 22 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:45,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 5562 transitions. [2021-10-19 14:24:45,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-10-19 14:24:45,779 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:45,779 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:45,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-19 14:24:45,779 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:45,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:45,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1457803213, now seen corresponding path program 5 times [2021-10-19 14:24:45,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:45,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915865895] [2021-10-19 14:24:45,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:45,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:46,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:46,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:46,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915865895] [2021-10-19 14:24:46,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915865895] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:46,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:46,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-10-19 14:24:46,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683346487] [2021-10-19 14:24:46,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-10-19 14:24:46,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:46,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-19 14:24:46,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2021-10-19 14:24:46,403 INFO L87 Difference]: Start difference. First operand 2959 states and 5562 transitions. Second operand has 22 states, 21 states have (on average 9.0) internal successors, (189), 22 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:48,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:48,553 INFO L93 Difference]: Finished difference Result 3951 states and 7479 transitions. [2021-10-19 14:24:48,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-19 14:24:48,553 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.0) internal successors, (189), 22 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2021-10-19 14:24:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:48,581 INFO L225 Difference]: With dead ends: 3951 [2021-10-19 14:24:48,581 INFO L226 Difference]: Without dead ends: 3951 [2021-10-19 14:24:48,581 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 3 SyntacticMatches, 11 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 941.1ms TimeCoverageRelationStatistics Valid=385, Invalid=2267, Unknown=0, NotChecked=0, Total=2652 [2021-10-19 14:24:48,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2021-10-19 14:24:48,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 2874. [2021-10-19 14:24:48,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2874 states, 2863 states have (on average 1.8833391547327978) internal successors, (5392), 2873 states have internal predecessors, (5392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:48,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2874 states to 2874 states and 5392 transitions. [2021-10-19 14:24:48,649 INFO L78 Accepts]: Start accepts. Automaton has 2874 states and 5392 transitions. Word has length 189 [2021-10-19 14:24:48,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:48,649 INFO L470 AbstractCegarLoop]: Abstraction has 2874 states and 5392 transitions. [2021-10-19 14:24:48,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.0) internal successors, (189), 22 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:48,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2874 states and 5392 transitions. [2021-10-19 14:24:48,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-10-19 14:24:48,668 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:48,669 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:48,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-19 14:24:48,669 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:48,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:48,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1798850765, now seen corresponding path program 1 times [2021-10-19 14:24:48,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:48,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203052667] [2021-10-19 14:24:48,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:48,670 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:48,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:48,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:48,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203052667] [2021-10-19 14:24:48,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203052667] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:48,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:48,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-19 14:24:48,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202485008] [2021-10-19 14:24:48,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-19 14:24:48,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:48,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-19 14:24:48,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-19 14:24:48,767 INFO L87 Difference]: Start difference. First operand 2874 states and 5392 transitions. Second operand has 6 states, 5 states have (on average 37.8) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:49,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:49,046 INFO L93 Difference]: Finished difference Result 3062 states and 5734 transitions. [2021-10-19 14:24:49,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-19 14:24:49,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 37.8) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2021-10-19 14:24:49,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:49,050 INFO L225 Difference]: With dead ends: 3062 [2021-10-19 14:24:49,050 INFO L226 Difference]: Without dead ends: 2630 [2021-10-19 14:24:49,050 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.0ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-19 14:24:49,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2021-10-19 14:24:49,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2614. [2021-10-19 14:24:49,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2614 states, 2603 states have (on average 1.850557049558202) internal successors, (4817), 2613 states have internal predecessors, (4817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:49,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 4817 transitions. [2021-10-19 14:24:49,086 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 4817 transitions. Word has length 189 [2021-10-19 14:24:49,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:49,086 INFO L470 AbstractCegarLoop]: Abstraction has 2614 states and 4817 transitions. [2021-10-19 14:24:49,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 37.8) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:49,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 4817 transitions. [2021-10-19 14:24:49,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-10-19 14:24:49,090 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:49,091 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:49,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-19 14:24:49,091 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:49,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:49,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1701522626, now seen corresponding path program 1 times [2021-10-19 14:24:49,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:49,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611926733] [2021-10-19 14:24:49,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:49,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:49,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:49,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611926733] [2021-10-19 14:24:49,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611926733] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:49,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:49,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-10-19 14:24:49,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701292032] [2021-10-19 14:24:49,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-10-19 14:24:49,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:49,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-19 14:24:49,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2021-10-19 14:24:49,827 INFO L87 Difference]: Start difference. First operand 2614 states and 4817 transitions. Second operand has 22 states, 21 states have (on average 9.238095238095237) internal successors, (194), 22 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:51,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:51,720 INFO L93 Difference]: Finished difference Result 2847 states and 5256 transitions. [2021-10-19 14:24:51,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-19 14:24:51,721 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.238095238095237) internal successors, (194), 22 states have internal predecessors, (194), 0 states have call successors, (0), 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 194 [2021-10-19 14:24:51,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:51,725 INFO L225 Difference]: With dead ends: 2847 [2021-10-19 14:24:51,725 INFO L226 Difference]: Without dead ends: 2847 [2021-10-19 14:24:51,726 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 14 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 1037.0ms TimeCoverageRelationStatistics Valid=402, Invalid=2354, Unknown=0, NotChecked=0, Total=2756 [2021-10-19 14:24:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2021-10-19 14:24:51,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 2672. [2021-10-19 14:24:51,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2672 states, 2661 states have (on average 1.8538143555054492) internal successors, (4933), 2671 states have internal predecessors, (4933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:51,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2672 states to 2672 states and 4933 transitions. [2021-10-19 14:24:51,757 INFO L78 Accepts]: Start accepts. Automaton has 2672 states and 4933 transitions. Word has length 194 [2021-10-19 14:24:51,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:51,757 INFO L470 AbstractCegarLoop]: Abstraction has 2672 states and 4933 transitions. [2021-10-19 14:24:51,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.238095238095237) internal successors, (194), 22 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:51,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2672 states and 4933 transitions. [2021-10-19 14:24:51,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-10-19 14:24:51,760 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:51,760 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:51,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-19 14:24:51,760 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:51,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:51,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2136091626, now seen corresponding path program 2 times [2021-10-19 14:24:51,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:51,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421588818] [2021-10-19 14:24:51,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:51,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:52,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:52,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421588818] [2021-10-19 14:24:52,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421588818] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:52,311 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:52,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-19 14:24:52,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115615335] [2021-10-19 14:24:52,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-19 14:24:52,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:52,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-19 14:24:52,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-10-19 14:24:52,312 INFO L87 Difference]: Start difference. First operand 2672 states and 4933 transitions. Second operand has 20 states, 19 states have (on average 10.210526315789474) internal successors, (194), 20 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:53,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:53,959 INFO L93 Difference]: Finished difference Result 2870 states and 5302 transitions. [2021-10-19 14:24:53,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-10-19 14:24:53,959 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 10.210526315789474) internal successors, (194), 20 states have internal predecessors, (194), 0 states have call successors, (0), 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 194 [2021-10-19 14:24:53,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:53,962 INFO L225 Difference]: With dead ends: 2870 [2021-10-19 14:24:53,962 INFO L226 Difference]: Without dead ends: 2870 [2021-10-19 14:24:53,963 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 14 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 790.7ms TimeCoverageRelationStatistics Valid=384, Invalid=1968, Unknown=0, NotChecked=0, Total=2352 [2021-10-19 14:24:53,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2870 states. [2021-10-19 14:24:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2870 to 2670. [2021-10-19 14:24:53,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2670 states, 2659 states have (on average 1.8537044001504326) internal successors, (4929), 2669 states have internal predecessors, (4929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:53,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 4929 transitions. [2021-10-19 14:24:53,991 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 4929 transitions. Word has length 194 [2021-10-19 14:24:53,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:53,992 INFO L470 AbstractCegarLoop]: Abstraction has 2670 states and 4929 transitions. [2021-10-19 14:24:53,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 10.210526315789474) internal successors, (194), 20 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:53,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 4929 transitions. [2021-10-19 14:24:53,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-10-19 14:24:53,994 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:53,994 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:53,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-19 14:24:53,995 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:53,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:53,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1245268414, now seen corresponding path program 3 times [2021-10-19 14:24:53,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:53,995 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122450421] [2021-10-19 14:24:53,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:53,995 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:54,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:54,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:54,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122450421] [2021-10-19 14:24:54,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122450421] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:54,560 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:54,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-19 14:24:54,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356045142] [2021-10-19 14:24:54,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-19 14:24:54,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:54,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-19 14:24:54,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-10-19 14:24:54,563 INFO L87 Difference]: Start difference. First operand 2670 states and 4929 transitions. Second operand has 20 states, 19 states have (on average 10.210526315789474) internal successors, (194), 20 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:56,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:56,154 INFO L93 Difference]: Finished difference Result 2746 states and 5065 transitions. [2021-10-19 14:24:56,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-10-19 14:24:56,154 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 10.210526315789474) internal successors, (194), 20 states have internal predecessors, (194), 0 states have call successors, (0), 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 194 [2021-10-19 14:24:56,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:56,157 INFO L225 Difference]: With dead ends: 2746 [2021-10-19 14:24:56,157 INFO L226 Difference]: Without dead ends: 2746 [2021-10-19 14:24:56,159 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 15 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 860.7ms TimeCoverageRelationStatistics Valid=501, Invalid=2579, Unknown=0, NotChecked=0, Total=3080 [2021-10-19 14:24:56,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2021-10-19 14:24:56,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2538. [2021-10-19 14:24:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2527 states have (on average 1.850415512465374) internal successors, (4676), 2537 states have internal predecessors, (4676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 4676 transitions. [2021-10-19 14:24:56,197 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 4676 transitions. Word has length 194 [2021-10-19 14:24:56,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:56,197 INFO L470 AbstractCegarLoop]: Abstraction has 2538 states and 4676 transitions. [2021-10-19 14:24:56,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 10.210526315789474) internal successors, (194), 20 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:56,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 4676 transitions. [2021-10-19 14:24:56,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-10-19 14:24:56,200 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:56,200 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:56,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-19 14:24:56,200 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:56,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:56,200 INFO L82 PathProgramCache]: Analyzing trace with hash 968801853, now seen corresponding path program 1 times [2021-10-19 14:24:56,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:56,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864380068] [2021-10-19 14:24:56,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:56,201 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:56,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:56,660 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864380068] [2021-10-19 14:24:56,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864380068] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:56,660 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:56,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-10-19 14:24:56,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971598893] [2021-10-19 14:24:56,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-10-19 14:24:56,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:56,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-19 14:24:56,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2021-10-19 14:24:56,661 INFO L87 Difference]: Start difference. First operand 2538 states and 4676 transitions. Second operand has 22 states, 21 states have (on average 9.380952380952381) internal successors, (197), 22 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:58,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:24:58,180 INFO L93 Difference]: Finished difference Result 2536 states and 4669 transitions. [2021-10-19 14:24:58,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-19 14:24:58,180 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.380952380952381) internal successors, (197), 22 states have internal predecessors, (197), 0 states have call successors, (0), 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 197 [2021-10-19 14:24:58,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:24:58,183 INFO L225 Difference]: With dead ends: 2536 [2021-10-19 14:24:58,183 INFO L226 Difference]: Without dead ends: 2536 [2021-10-19 14:24:58,184 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 607.9ms TimeCoverageRelationStatistics Valid=344, Invalid=2106, Unknown=0, NotChecked=0, Total=2450 [2021-10-19 14:24:58,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2021-10-19 14:24:58,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2485. [2021-10-19 14:24:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2485 states, 2475 states have (on average 1.8484848484848484) internal successors, (4575), 2484 states have internal predecessors, (4575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 4575 transitions. [2021-10-19 14:24:58,205 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 4575 transitions. Word has length 197 [2021-10-19 14:24:58,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:24:58,206 INFO L470 AbstractCegarLoop]: Abstraction has 2485 states and 4575 transitions. [2021-10-19 14:24:58,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.380952380952381) internal successors, (197), 22 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:24:58,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 4575 transitions. [2021-10-19 14:24:58,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-10-19 14:24:58,208 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:24:58,208 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:24:58,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-19 14:24:58,208 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:24:58,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:24:58,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1104362795, now seen corresponding path program 1 times [2021-10-19 14:24:58,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:24:58,209 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547149950] [2021-10-19 14:24:58,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:24:58,209 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:24:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:24:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:24:58,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:24:58,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547149950] [2021-10-19 14:24:58,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547149950] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:24:58,622 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:24:58,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-10-19 14:24:58,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823075764] [2021-10-19 14:24:58,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-10-19 14:24:58,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:24:58,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-19 14:24:58,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2021-10-19 14:24:58,623 INFO L87 Difference]: Start difference. First operand 2485 states and 4575 transitions. Second operand has 23 states, 22 states have (on average 8.954545454545455) internal successors, (197), 23 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:25:00,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:25:00,304 INFO L93 Difference]: Finished difference Result 3269 states and 6047 transitions. [2021-10-19 14:25:00,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-10-19 14:25:00,304 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 8.954545454545455) internal successors, (197), 23 states have internal predecessors, (197), 0 states have call successors, (0), 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 197 [2021-10-19 14:25:00,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:25:00,308 INFO L225 Difference]: With dead ends: 3269 [2021-10-19 14:25:00,308 INFO L226 Difference]: Without dead ends: 3261 [2021-10-19 14:25:00,309 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 765.8ms TimeCoverageRelationStatistics Valid=561, Invalid=3221, Unknown=0, NotChecked=0, Total=3782 [2021-10-19 14:25:00,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3261 states. [2021-10-19 14:25:00,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3261 to 2551. [2021-10-19 14:25:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2551 states, 2541 states have (on average 1.8520267611176702) internal successors, (4706), 2550 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:25:00,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 4706 transitions. [2021-10-19 14:25:00,334 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 4706 transitions. Word has length 197 [2021-10-19 14:25:00,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:25:00,334 INFO L470 AbstractCegarLoop]: Abstraction has 2551 states and 4706 transitions. [2021-10-19 14:25:00,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 8.954545454545455) internal successors, (197), 23 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:25:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 4706 transitions. [2021-10-19 14:25:00,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-10-19 14:25:00,337 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:25:00,337 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:25:00,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-19 14:25:00,337 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:25:00,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:25:00,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1948493237, now seen corresponding path program 2 times [2021-10-19 14:25:00,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:25:00,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422469817] [2021-10-19 14:25:00,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:25:00,339 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:25:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:25:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:25:01,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:25:01,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422469817] [2021-10-19 14:25:01,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422469817] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:25:01,121 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:25:01,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-19 14:25:01,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142243347] [2021-10-19 14:25:01,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-19 14:25:01,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:25:01,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-19 14:25:01,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2021-10-19 14:25:01,122 INFO L87 Difference]: Start difference. First operand 2551 states and 4706 transitions. Second operand has 25 states, 24 states have (on average 8.208333333333334) internal successors, (197), 25 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:25:03,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:25:03,449 INFO L93 Difference]: Finished difference Result 4122 states and 7662 transitions. [2021-10-19 14:25:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-10-19 14:25:03,450 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 8.208333333333334) internal successors, (197), 25 states have internal predecessors, (197), 0 states have call successors, (0), 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 197 [2021-10-19 14:25:03,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:25:03,454 INFO L225 Difference]: With dead ends: 4122 [2021-10-19 14:25:03,454 INFO L226 Difference]: Without dead ends: 4114 [2021-10-19 14:25:03,455 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 1269.9ms TimeCoverageRelationStatistics Valid=592, Invalid=3698, Unknown=0, NotChecked=0, Total=4290 [2021-10-19 14:25:03,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4114 states. [2021-10-19 14:25:03,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4114 to 2531. [2021-10-19 14:25:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2531 states, 2521 states have (on average 1.8508528361761205) internal successors, (4666), 2530 states have internal predecessors, (4666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:25:03,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 4666 transitions. [2021-10-19 14:25:03,482 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 4666 transitions. Word has length 197 [2021-10-19 14:25:03,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:25:03,483 INFO L470 AbstractCegarLoop]: Abstraction has 2531 states and 4666 transitions. [2021-10-19 14:25:03,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 8.208333333333334) internal successors, (197), 25 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:25:03,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 4666 transitions. [2021-10-19 14:25:03,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-10-19 14:25:03,485 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:25:03,486 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:25:03,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-19 14:25:03,486 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:25:03,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:25:03,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1314487457, now seen corresponding path program 3 times [2021-10-19 14:25:03,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:25:03,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906183195] [2021-10-19 14:25:03,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:25:03,486 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:25:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:25:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:25:04,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:25:04,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906183195] [2021-10-19 14:25:04,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906183195] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:25:04,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:25:04,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-19 14:25:04,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081811106] [2021-10-19 14:25:04,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-19 14:25:04,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:25:04,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-19 14:25:04,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2021-10-19 14:25:04,226 INFO L87 Difference]: Start difference. First operand 2531 states and 4666 transitions. Second operand has 25 states, 24 states have (on average 8.208333333333334) internal successors, (197), 25 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:25:06,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:25:06,418 INFO L93 Difference]: Finished difference Result 4066 states and 7550 transitions. [2021-10-19 14:25:06,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-10-19 14:25:06,418 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 8.208333333333334) internal successors, (197), 25 states have internal predecessors, (197), 0 states have call successors, (0), 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 197 [2021-10-19 14:25:06,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:25:06,422 INFO L225 Difference]: With dead ends: 4066 [2021-10-19 14:25:06,423 INFO L226 Difference]: Without dead ends: 4058 [2021-10-19 14:25:06,424 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 1243.3ms TimeCoverageRelationStatistics Valid=691, Invalid=3599, Unknown=0, NotChecked=0, Total=4290 [2021-10-19 14:25:06,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4058 states. [2021-10-19 14:25:06,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4058 to 2531. [2021-10-19 14:25:06,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2531 states, 2521 states have (on average 1.8508528361761205) internal successors, (4666), 2530 states have internal predecessors, (4666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:25:06,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 4666 transitions. [2021-10-19 14:25:06,449 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 4666 transitions. Word has length 197 [2021-10-19 14:25:06,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:25:06,450 INFO L470 AbstractCegarLoop]: Abstraction has 2531 states and 4666 transitions. [2021-10-19 14:25:06,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 8.208333333333334) internal successors, (197), 25 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:25:06,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 4666 transitions. [2021-10-19 14:25:06,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-10-19 14:25:06,453 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:25:06,453 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:25:06,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-19 14:25:06,454 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:25:06,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:25:06,454 INFO L82 PathProgramCache]: Analyzing trace with hash -450889207, now seen corresponding path program 4 times [2021-10-19 14:25:06,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:25:06,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571943617] [2021-10-19 14:25:06,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:25:06,454 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:25:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:25:07,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:25:07,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:25:07,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571943617] [2021-10-19 14:25:07,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571943617] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:25:07,077 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:25:07,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-19 14:25:07,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609758061] [2021-10-19 14:25:07,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-19 14:25:07,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:25:07,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-19 14:25:07,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2021-10-19 14:25:07,078 INFO L87 Difference]: Start difference. First operand 2531 states and 4666 transitions. Second operand has 25 states, 24 states have (on average 8.208333333333334) internal successors, (197), 25 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:25:09,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:25:09,540 INFO L93 Difference]: Finished difference Result 4105 states and 7627 transitions. [2021-10-19 14:25:09,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-10-19 14:25:09,540 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 8.208333333333334) internal successors, (197), 25 states have internal predecessors, (197), 0 states have call successors, (0), 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 197 [2021-10-19 14:25:09,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:25:09,544 INFO L225 Difference]: With dead ends: 4105 [2021-10-19 14:25:09,544 INFO L226 Difference]: Without dead ends: 4097 [2021-10-19 14:25:09,546 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1349 ImplicationChecksByTransitivity, 1204.8ms TimeCoverageRelationStatistics Valid=706, Invalid=3850, Unknown=0, NotChecked=0, Total=4556 [2021-10-19 14:25:09,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4097 states. [2021-10-19 14:25:09,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4097 to 2531. [2021-10-19 14:25:09,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2531 states, 2521 states have (on average 1.8508528361761205) internal successors, (4666), 2530 states have internal predecessors, (4666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:25:09,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 4666 transitions. [2021-10-19 14:25:09,572 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 4666 transitions. Word has length 197 [2021-10-19 14:25:09,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:25:09,573 INFO L470 AbstractCegarLoop]: Abstraction has 2531 states and 4666 transitions. [2021-10-19 14:25:09,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 8.208333333333334) internal successors, (197), 25 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:25:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 4666 transitions. [2021-10-19 14:25:09,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-10-19 14:25:09,576 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:25:09,576 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:25:09,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-19 14:25:09,576 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:25:09,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:25:09,576 INFO L82 PathProgramCache]: Analyzing trace with hash 964346613, now seen corresponding path program 5 times [2021-10-19 14:25:09,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:25:09,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42683396] [2021-10-19 14:25:09,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:25:09,584 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:25:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-19 14:25:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-19 14:25:10,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-19 14:25:10,215 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42683396] [2021-10-19 14:25:10,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42683396] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-19 14:25:10,215 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-19 14:25:10,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-19 14:25:10,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737841569] [2021-10-19 14:25:10,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-19 14:25:10,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-19 14:25:10,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-19 14:25:10,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2021-10-19 14:25:10,216 INFO L87 Difference]: Start difference. First operand 2531 states and 4666 transitions. Second operand has 25 states, 24 states have (on average 8.208333333333334) internal successors, (197), 25 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:25:12,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-19 14:25:12,853 INFO L93 Difference]: Finished difference Result 4076 states and 7569 transitions. [2021-10-19 14:25:12,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-10-19 14:25:12,853 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 8.208333333333334) internal successors, (197), 25 states have internal predecessors, (197), 0 states have call successors, (0), 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 197 [2021-10-19 14:25:12,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-19 14:25:12,857 INFO L225 Difference]: With dead ends: 4076 [2021-10-19 14:25:12,857 INFO L226 Difference]: Without dead ends: 4068 [2021-10-19 14:25:12,858 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 1202.3ms TimeCoverageRelationStatistics Valid=643, Invalid=3779, Unknown=0, NotChecked=0, Total=4422 [2021-10-19 14:25:12,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4068 states. [2021-10-19 14:25:12,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4068 to 2466. [2021-10-19 14:25:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2466 states, 2456 states have (on average 1.8473127035830619) internal successors, (4537), 2465 states have internal predecessors, (4537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:25:12,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 4537 transitions. [2021-10-19 14:25:12,887 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 4537 transitions. Word has length 197 [2021-10-19 14:25:12,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-19 14:25:12,888 INFO L470 AbstractCegarLoop]: Abstraction has 2466 states and 4537 transitions. [2021-10-19 14:25:12,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 8.208333333333334) internal successors, (197), 25 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-19 14:25:12,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 4537 transitions. [2021-10-19 14:25:12,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2021-10-19 14:25:12,890 INFO L509 BasicCegarLoop]: Found error trace [2021-10-19 14:25:12,890 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-19 14:25:12,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-19 14:25:12,890 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-10-19 14:25:12,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-19 14:25:12,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1615375793, now seen corresponding path program 1 times [2021-10-19 14:25:12,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-19 14:25:12,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738685004] [2021-10-19 14:25:12,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-19 14:25:12,891 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-19 14:25:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-19 14:25:13,009 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-19 14:25:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-19 14:25:13,139 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-19 14:25:13,139 INFO L631 BasicCegarLoop]: Counterexample is feasible [2021-10-19 14:25:13,141 WARN L676 BasicCegarLoop]: Found a data race, but unable to determine exactly which statements and variables are involved. [2021-10-19 14:25:13,142 WARN L679 BasicCegarLoop]: C: printf("%d\n", p->datum) [1252] might race with any of C: A->next->datum++ [1228], or C: B->next = p [1244], or C: B->next = p [1244], or C: B->next = p [1244], or C: B->next = p [1244], or C: p -> next = ((void *)0) [1222], or C: p -> next = ((void *)0) [1222], or C: p -> next = ((void *)0) [1222], or C: p -> next = ((void *)0) [1222], or C: p -> datum = x [1221], or C: p -> datum = x [1221], or C: p -> datum = x [1221], or C: p -> datum = x [1221], or C: A->next = p [1241], or C: A->next = p [1241], or C: A->next = p [1241], or C: A->next = p [1241] [2021-10-19 14:25:13,143 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,144 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,145 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,145 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,145 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,145 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,145 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,145 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,145 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,145 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,145 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,145 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,145 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,145 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,146 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,146 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,146 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,146 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,146 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,146 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,146 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-19 14:25:13,146 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,146 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,146 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,146 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,146 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,146 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,147 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,147 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,147 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,147 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,147 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,147 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,147 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,147 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,147 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,147 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE [2021-10-19 14:25:13,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-19 14:25:13,152 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-19 14:25:13,152 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-19 14:25:13,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.10 02:25:13 BasicIcfg [2021-10-19 14:25:13,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-19 14:25:13,229 INFO L168 Benchmark]: Toolchain (without parser) took 47537.19 ms. Allocated memory was 196.1 MB in the beginning and 608.2 MB in the end (delta: 412.1 MB). Free memory was 139.1 MB in the beginning and 368.1 MB in the end (delta: -229.0 MB). Peak memory consumption was 183.8 MB. Max. memory is 8.0 GB. [2021-10-19 14:25:13,229 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 196.1 MB. Free memory is still 157.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-10-19 14:25:13,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 530.82 ms. Allocated memory was 196.1 MB in the beginning and 266.3 MB in the end (delta: 70.3 MB). Free memory was 138.9 MB in the beginning and 211.7 MB in the end (delta: -72.7 MB). Peak memory consumption was 13.4 MB. Max. memory is 8.0 GB. [2021-10-19 14:25:13,229 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.35 ms. Allocated memory is still 266.3 MB. Free memory was 211.7 MB in the beginning and 208.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-10-19 14:25:13,229 INFO L168 Benchmark]: Boogie Preprocessor took 40.02 ms. Allocated memory is still 266.3 MB. Free memory was 208.5 MB in the beginning and 204.8 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-10-19 14:25:13,229 INFO L168 Benchmark]: RCFGBuilder took 625.14 ms. Allocated memory is still 266.3 MB. Free memory was 204.8 MB in the beginning and 179.2 MB in the end (delta: 25.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. [2021-10-19 14:25:13,230 INFO L168 Benchmark]: TraceAbstraction took 46276.15 ms. Allocated memory was 266.3 MB in the beginning and 608.2 MB in the end (delta: 341.8 MB). Free memory was 178.6 MB in the beginning and 368.1 MB in the end (delta: -189.5 MB). Peak memory consumption was 153.9 MB. Max. memory is 8.0 GB. [2021-10-19 14:25:13,231 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.17 ms. Allocated memory is still 196.1 MB. Free memory is still 157.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 530.82 ms. Allocated memory was 196.1 MB in the beginning and 266.3 MB in the end (delta: 70.3 MB). Free memory was 138.9 MB in the beginning and 211.7 MB in the end (delta: -72.7 MB). Peak memory consumption was 13.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 51.35 ms. Allocated memory is still 266.3 MB. Free memory was 211.7 MB in the beginning and 208.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 40.02 ms. Allocated memory is still 266.3 MB. Free memory was 208.5 MB in the beginning and 204.8 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 625.14 ms. Allocated memory is still 266.3 MB. Free memory was 204.8 MB in the beginning and 179.2 MB in the end (delta: 25.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 46276.15 ms. Allocated memory was 266.3 MB in the beginning and 608.2 MB in the end (delta: 341.8 MB). Free memory was 178.6 MB in the beginning and 368.1 MB in the end (delta: -189.5 MB). Peak memory consumption was 153.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1252]: the program contains a data race the program contains a data race We found a FailurePath: [L1216-L1219] 0 struct s { int datum; struct s *next; } *A, *B; VAL [A={0:0}, B={0:0}] [L1224] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={17:0}, B={0:0}] [L1225] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1236] 0 pthread_t t1; VAL [A={0:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1237] 0 struct s *p = malloc(sizeof(struct s)); VAL [A={0:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1221] 0 p -> datum = x VAL [A={0:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1222] 0 p -> next = ((void *)0) VAL [A={0:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1239] 0 A = malloc(sizeof(struct s)) VAL [A={-3:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1240] 0 init(A,3) VAL [A={-3:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1221] 0 p -> datum = x VAL [A={-3:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1222] 0 p -> next = ((void *)0) VAL [A={-3:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1241] EXPR 0 A->next VAL [A={-3:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1241] 0 A->next = p VAL [A={-3:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1242] 0 B = malloc(sizeof(struct s)) VAL [A={-3:0}, A_mutex={17:0}, B={11:0}, B_mutex={18:0}] [L1243] 0 init(B,5) VAL [A={-3:0}, A_mutex={17:0}, B={11:0}, B_mutex={18:0}] [L1221] 0 p -> datum = x VAL [A={-3:0}, A_mutex={17:0}, B={11:0}, B_mutex={18:0}] [L1222] 0 p -> next = ((void *)0) VAL [A={-3:0}, A_mutex={17:0}, B={11:0}, B_mutex={18:0}] [L1244] EXPR 0 B->next VAL [A={-3:0}, A_mutex={17:0}, B={11:0}, B_mutex={18:0}] [L1244] 0 B->next = p VAL [A={-3:0}, A_mutex={17:0}, B={11:0}, B_mutex={18:0}] [L1245] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-3:0}, A_mutex={17:0}, arg={0:0}, B={11:0}, B_mutex={18:0}] [L1247] EXPR 0 A->next VAL [A={-3:0}, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={18:0}] [L1247] 0 p = A->next VAL [A={-3:0}, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={18:0}] [L1248] EXPR 0 p->datum VAL [A={-3:0}, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={18:0}] [L1248] 0 printf("%d\n", p->datum) VAL [A={-3:0}, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={18:0}] [L1228] EXPR 1 A->next VAL [A={-3:0}, A->next={-2:0}, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={18:0}] [L1251] EXPR 0 B->next VAL [A={-3:0}, A->next={-2:0}, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={18:0}] [L1251] 0 p = B->next VAL [A={-3:0}, A->next={-2:0}, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={18:0}] [L1252] EXPR 0 p->datum VAL [A={-3:0}, A->next={-2:0}, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={18:0}] [L1228] EXPR 1 A->next->datum VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={18:0}] [L1228] 1 A->next->datum++ VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A->next->datum++=104, A->next->datum++=9, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={18:0}] [L1252] 0 printf("%d\n", p->datum) VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A->next->datum++=104, A->next->datum++=9, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={18:0}] - UnprovableResult [Line: 1221]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1222]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1221]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1222]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1242]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1243]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1221]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1222]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1244]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1244]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1247]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1247]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1245]: 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: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1231]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1231]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1231]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1231]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 346 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 46069.5ms, OverallIterations: 32, TraceHistogramMax: 1, EmptinessCheckTime: 91.8ms, AutomataDifference: 32927.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 100.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 8579 SDtfs, 21489 SDslu, 42866 SDs, 0 SdLazy, 45989 SolverSat, 6267 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18550.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1062 GetRequests, 49 SyntacticMatches, 151 SemanticMatches, 862 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13317 ImplicationChecksByTransitivity, 14326.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=4213occurred in iteration=12, InterpolantAutomatonStates: 712, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1758.2ms AutomataMinimizationTime, 31 MinimizatonAttempts, 15669 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 113.0ms SsaConstructionTime, 755.3ms SatisfiabilityAnalysisTime, 9782.5ms InterpolantComputationTime, 5051 NumberOfCodeBlocks, 5051 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 4822 ConstructedInterpolants, 0 QuantifiedInterpolants, 59773 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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 proved your program to be incorrect! [2021-10-19 14:25:13,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...