/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_04-list2_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-aed12abd52951161f3584c1e4a16827ff4d06934-aed12ab [2021-10-14 11:55:14,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-14 11:55:14,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-14 11:55:15,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-14 11:55:15,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-14 11:55:15,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-14 11:55:15,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-14 11:55:15,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-14 11:55:15,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-14 11:55:15,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-14 11:55:15,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-14 11:55:15,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-14 11:55:15,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-14 11:55:15,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-14 11:55:15,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-14 11:55:15,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-14 11:55:15,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-14 11:55:15,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-14 11:55:15,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-14 11:55:15,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-14 11:55:15,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-14 11:55:15,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-14 11:55:15,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-14 11:55:15,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-14 11:55:15,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-14 11:55:15,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-14 11:55:15,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-14 11:55:15,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-14 11:55:15,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-14 11:55:15,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-14 11:55:15,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-14 11:55:15,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-14 11:55:15,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-14 11:55:15,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-14 11:55:15,062 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-14 11:55:15,062 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-14 11:55:15,063 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-14 11:55:15,063 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-14 11:55:15,063 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-14 11:55:15,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-14 11:55:15,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-14 11:55:15,065 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-14 11:55:15,090 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-14 11:55:15,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-14 11:55:15,090 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-14 11:55:15,090 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-14 11:55:15,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-14 11:55:15,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-14 11:55:15,091 INFO L138 SettingsManager]: * Use SBE=true [2021-10-14 11:55:15,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-14 11:55:15,091 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-14 11:55:15,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-14 11:55:15,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-14 11:55:15,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-14 11:55:15,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-14 11:55:15,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-14 11:55:15,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-14 11:55:15,092 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-14 11:55:15,092 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-14 11:55:15,092 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-14 11:55:15,092 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-14 11:55:15,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-14 11:55:15,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-14 11:55:15,093 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-10-14 11:55:15,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-14 11:55:15,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-14 11:55:15,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-14 11:55:15,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-14 11:55:15,093 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-14 11:55:15,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-14 11:55:15,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-14 11:55:15,093 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-14 11:55:15,093 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-14 11:55:15,093 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-14 11:55:15,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-14 11:55:15,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-14 11:55:15,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-14 11:55:15,309 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-14 11:55:15,312 INFO L275 PluginConnector]: CDTParser initialized [2021-10-14 11:55:15,313 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_04-list2_nr.i [2021-10-14 11:55:15,358 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b9f0a17/d46050e1395841c0b5d885ee8cf89487/FLAG189ccbfc5 [2021-10-14 11:55:15,771 INFO L306 CDTParser]: Found 1 translation units. [2021-10-14 11:55:15,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_04-list2_nr.i [2021-10-14 11:55:15,789 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b9f0a17/d46050e1395841c0b5d885ee8cf89487/FLAG189ccbfc5 [2021-10-14 11:55:15,798 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b9f0a17/d46050e1395841c0b5d885ee8cf89487 [2021-10-14 11:55:15,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-14 11:55:15,815 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-14 11:55:15,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-14 11:55:15,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-14 11:55:15,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-14 11:55:15,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:55:15" (1/1) ... [2021-10-14 11:55:15,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f8b09b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:15, skipping insertion in model container [2021-10-14 11:55:15,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:55:15" (1/1) ... [2021-10-14 11:55:15,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-14 11:55:15,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-14 11:55:16,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-14 11:55:16,239 INFO L203 MainTranslator]: Completed pre-run [2021-10-14 11:55:16,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-14 11:55:16,331 INFO L208 MainTranslator]: Completed translation [2021-10-14 11:55:16,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:16 WrapperNode [2021-10-14 11:55:16,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-14 11:55:16,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-14 11:55:16,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-14 11:55:16,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-14 11:55:16,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:16" (1/1) ... [2021-10-14 11:55:16,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:16" (1/1) ... [2021-10-14 11:55:16,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-14 11:55:16,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-14 11:55:16,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-14 11:55:16,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-14 11:55:16,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:16" (1/1) ... [2021-10-14 11:55:16,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:16" (1/1) ... [2021-10-14 11:55:16,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:16" (1/1) ... [2021-10-14 11:55:16,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:16" (1/1) ... [2021-10-14 11:55:16,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:16" (1/1) ... [2021-10-14 11:55:16,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:16" (1/1) ... [2021-10-14 11:55:16,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:16" (1/1) ... [2021-10-14 11:55:16,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-14 11:55:16,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-14 11:55:16,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-14 11:55:16,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-14 11:55:16,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:16" (1/1) ... [2021-10-14 11:55:16,434 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-14 11:55:16,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-14 11:55:16,449 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-14 11:55:16,461 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-14 11:55:16,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-14 11:55:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-14 11:55:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-14 11:55:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-14 11:55:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-14 11:55:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-10-14 11:55:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-14 11:55:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-14 11:55:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-10-14 11:55:16,472 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-10-14 11:55:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-14 11:55:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-14 11:55:16,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-14 11:55:16,473 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-14 11:55:16,999 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-14 11:55:16,999 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2021-10-14 11:55:17,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:55:17 BoogieIcfgContainer [2021-10-14 11:55:17,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-14 11:55:17,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-14 11:55:17,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-14 11:55:17,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-14 11:55:17,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:55:15" (1/3) ... [2021-10-14 11:55:17,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2364a9a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:55:17, skipping insertion in model container [2021-10-14 11:55:17,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:55:16" (2/3) ... [2021-10-14 11:55:17,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2364a9a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:55:17, skipping insertion in model container [2021-10-14 11:55:17,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:55:17" (3/3) ... [2021-10-14 11:55:17,010 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_04-list2_nr.i [2021-10-14 11:55:17,016 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-14 11:55:17,016 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-14 11:55:17,016 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2021-10-14 11:55:17,016 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-14 11:55:17,052 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,052 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,052 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,052 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,052 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,053 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,053 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,053 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,053 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,053 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,053 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,053 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,053 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,053 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,053 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,054 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,054 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,054 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,054 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,054 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,054 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,054 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,054 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,054 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,054 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,055 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,055 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,055 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,055 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,055 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,055 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,055 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,055 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,055 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,055 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,056 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,056 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,056 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,056 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,056 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,056 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,056 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,056 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,056 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,056 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,056 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,056 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,057 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,057 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,057 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,057 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,057 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,057 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,057 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,057 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,057 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,057 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,057 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,059 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,059 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,059 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,059 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,059 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,059 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,059 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,059 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,059 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,059 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,059 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,060 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,060 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,060 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,060 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,060 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,060 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,060 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,060 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,060 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,060 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,060 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,061 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,061 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,061 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,061 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,061 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,061 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,061 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,061 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,061 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,061 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,061 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,062 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,062 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,062 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,062 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,062 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,062 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,062 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,062 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,062 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,062 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,062 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,063 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,063 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,063 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,063 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,064 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,064 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,065 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,065 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,065 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,065 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,065 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,065 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,065 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,066 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,066 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,066 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,066 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,066 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,067 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,067 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,067 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,067 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,067 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,067 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,067 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,067 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,067 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,068 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,068 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,068 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,068 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,069 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,069 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,069 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,069 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,069 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,069 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,069 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,069 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,069 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,069 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,069 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,070 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,070 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,070 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,070 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,070 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,070 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,070 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,070 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,070 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,070 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,070 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,070 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,071 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,071 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,071 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,071 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,071 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,071 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,071 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,071 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,071 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,071 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,072 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,072 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,072 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,072 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,072 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,072 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,072 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,073 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,073 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,073 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,073 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,073 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,073 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,073 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,073 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,073 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,073 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,074 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,074 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,074 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,074 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,074 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,074 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,074 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,074 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,074 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,075 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,075 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,075 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,075 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,075 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,076 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,076 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,076 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,076 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,076 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,076 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,076 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,076 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,076 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,076 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,077 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,077 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,077 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,083 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,083 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,083 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,084 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,085 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,086 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,090 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,090 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,090 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,090 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,090 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,090 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,091 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,092 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,092 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,092 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,092 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,092 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,093 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,093 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,093 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,093 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,093 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,093 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,093 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,093 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,093 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,094 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-14 11:55:17,097 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-14 11:55:17,127 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-14 11:55:17,131 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-14 11:55:17,131 INFO L340 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2021-10-14 11:55:17,142 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 303 places, 299 transitions, 603 flow [2021-10-14 11:55:17,246 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3478 states, 3464 states have (on average 1.9246535796766744) internal successors, (6667), 3477 states have internal predecessors, (6667), 0 states have call successors, (0), 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-14 11:55:17,254 INFO L276 IsEmpty]: Start isEmpty. Operand has 3478 states, 3464 states have (on average 1.9246535796766744) internal successors, (6667), 3477 states have internal predecessors, (6667), 0 states have call successors, (0), 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-14 11:55:17,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-14 11:55:17,260 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:17,260 INFO L512 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-14 11:55:17,261 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:55:17,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:17,268 INFO L82 PathProgramCache]: Analyzing trace with hash -299154937, now seen corresponding path program 1 times [2021-10-14 11:55:17,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:17,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453827530] [2021-10-14 11:55:17,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:17,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:17,581 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-14 11:55:17,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:17,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453827530] [2021-10-14 11:55:17,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453827530] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:17,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:17,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-14 11:55:17,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287873559] [2021-10-14 11:55:17,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-14 11:55:17,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:17,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-14 11:55:17,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:55:17,612 INFO L87 Difference]: Start difference. First operand has 3478 states, 3464 states have (on average 1.9246535796766744) internal successors, (6667), 3477 states have internal predecessors, (6667), 0 states have call successors, (0), 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-14 11:55:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:18,024 INFO L93 Difference]: Finished difference Result 3474 states and 6663 transitions. [2021-10-14 11:55:18,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-14 11:55:18,026 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-14 11:55:18,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:18,050 INFO L225 Difference]: With dead ends: 3474 [2021-10-14 11:55:18,051 INFO L226 Difference]: Without dead ends: 3474 [2021-10-14 11:55:18,052 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.9ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:55:18,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3474 states. [2021-10-14 11:55:18,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3474 to 3474. [2021-10-14 11:55:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3474 states, 3464 states have (on average 1.923498845265589) internal successors, (6663), 3473 states have internal predecessors, (6663), 0 states have call successors, (0), 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-14 11:55:18,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3474 states to 3474 states and 6663 transitions. [2021-10-14 11:55:18,194 INFO L78 Accepts]: Start accepts. Automaton has 3474 states and 6663 transitions. Word has length 44 [2021-10-14 11:55:18,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:18,195 INFO L470 AbstractCegarLoop]: Abstraction has 3474 states and 6663 transitions. [2021-10-14 11:55:18,195 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-14 11:55:18,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3474 states and 6663 transitions. [2021-10-14 11:55:18,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-14 11:55:18,196 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:18,196 INFO L512 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-14 11:55:18,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-14 11:55:18,196 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:55:18,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:18,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1764070472, now seen corresponding path program 1 times [2021-10-14 11:55:18,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:18,199 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703578274] [2021-10-14 11:55:18,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:18,200 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:18,340 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-14 11:55:18,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:18,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703578274] [2021-10-14 11:55:18,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703578274] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:18,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:18,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-14 11:55:18,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688754111] [2021-10-14 11:55:18,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-14 11:55:18,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:18,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-14 11:55:18,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:55:18,345 INFO L87 Difference]: Start difference. First operand 3474 states and 6663 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-14 11:55:18,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:18,493 INFO L93 Difference]: Finished difference Result 3470 states and 6659 transitions. [2021-10-14 11:55:18,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-14 11:55:18,493 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-14 11:55:18,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:18,504 INFO L225 Difference]: With dead ends: 3470 [2021-10-14 11:55:18,505 INFO L226 Difference]: Without dead ends: 3470 [2021-10-14 11:55:18,505 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.2ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:55:18,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2021-10-14 11:55:18,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 3470. [2021-10-14 11:55:18,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3470 states, 3464 states have (on average 1.9223441108545034) internal successors, (6659), 3469 states have internal predecessors, (6659), 0 states have call successors, (0), 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-14 11:55:18,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3470 states to 3470 states and 6659 transitions. [2021-10-14 11:55:18,617 INFO L78 Accepts]: Start accepts. Automaton has 3470 states and 6659 transitions. Word has length 52 [2021-10-14 11:55:18,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:18,617 INFO L470 AbstractCegarLoop]: Abstraction has 3470 states and 6659 transitions. [2021-10-14 11:55:18,621 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-14 11:55:18,621 INFO L276 IsEmpty]: Start isEmpty. Operand 3470 states and 6659 transitions. [2021-10-14 11:55:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-14 11:55:18,624 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:18,624 INFO L512 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-14 11:55:18,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-14 11:55:18,624 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:55:18,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:18,631 INFO L82 PathProgramCache]: Analyzing trace with hash -652921123, now seen corresponding path program 1 times [2021-10-14 11:55:18,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:18,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448129339] [2021-10-14 11:55:18,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:18,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:18,697 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-14 11:55:18,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:18,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448129339] [2021-10-14 11:55:18,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448129339] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:18,698 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:18,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-14 11:55:18,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644641404] [2021-10-14 11:55:18,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-14 11:55:18,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:18,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-14 11:55:18,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-14 11:55:18,699 INFO L87 Difference]: Start difference. First operand 3470 states and 6659 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-14 11:55:18,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:18,722 INFO L93 Difference]: Finished difference Result 3469 states and 6658 transitions. [2021-10-14 11:55:18,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-14 11:55:18,723 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-14 11:55:18,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:18,735 INFO L225 Difference]: With dead ends: 3469 [2021-10-14 11:55:18,735 INFO L226 Difference]: Without dead ends: 3469 [2021-10-14 11:55:18,735 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-14 11:55:18,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3469 states. [2021-10-14 11:55:18,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3469 to 3469. [2021-10-14 11:55:18,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3469 states, 3464 states have (on average 1.922055427251732) internal successors, (6658), 3468 states have internal predecessors, (6658), 0 states have call successors, (0), 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-14 11:55:18,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 3469 states and 6658 transitions. [2021-10-14 11:55:18,841 INFO L78 Accepts]: Start accepts. Automaton has 3469 states and 6658 transitions. Word has length 58 [2021-10-14 11:55:18,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:18,842 INFO L470 AbstractCegarLoop]: Abstraction has 3469 states and 6658 transitions. [2021-10-14 11:55:18,842 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-14 11:55:18,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3469 states and 6658 transitions. [2021-10-14 11:55:18,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-10-14 11:55:18,843 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:18,843 INFO L512 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] [2021-10-14 11:55:18,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-14 11:55:18,843 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:55:18,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:18,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1767267437, now seen corresponding path program 1 times [2021-10-14 11:55:18,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:18,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475052933] [2021-10-14 11:55:18,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:18,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:18,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-14 11:55:18,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:18,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475052933] [2021-10-14 11:55:18,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475052933] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:18,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:18,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-14 11:55:18,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401038433] [2021-10-14 11:55:18,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-14 11:55:18,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:18,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-14 11:55:18,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:55:18,964 INFO L87 Difference]: Start difference. First operand 3469 states and 6658 transitions. Second operand has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 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-14 11:55:19,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:19,091 INFO L93 Difference]: Finished difference Result 3468 states and 6657 transitions. [2021-10-14 11:55:19,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-14 11:55:19,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-10-14 11:55:19,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:19,103 INFO L225 Difference]: With dead ends: 3468 [2021-10-14 11:55:19,104 INFO L226 Difference]: Without dead ends: 3468 [2021-10-14 11:55:19,105 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.7ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:55:19,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2021-10-14 11:55:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 3468. [2021-10-14 11:55:19,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3468 states, 3464 states have (on average 1.9217667436489607) internal successors, (6657), 3467 states have internal predecessors, (6657), 0 states have call successors, (0), 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-14 11:55:19,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3468 states to 3468 states and 6657 transitions. [2021-10-14 11:55:19,197 INFO L78 Accepts]: Start accepts. Automaton has 3468 states and 6657 transitions. Word has length 92 [2021-10-14 11:55:19,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:19,197 INFO L470 AbstractCegarLoop]: Abstraction has 3468 states and 6657 transitions. [2021-10-14 11:55:19,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 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-14 11:55:19,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3468 states and 6657 transitions. [2021-10-14 11:55:19,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-14 11:55:19,198 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:19,199 INFO L512 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] [2021-10-14 11:55:19,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-14 11:55:19,199 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:55:19,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:19,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1891170954, now seen corresponding path program 1 times [2021-10-14 11:55:19,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:19,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8391244] [2021-10-14 11:55:19,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:19,200 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:19,241 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-14 11:55:19,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:19,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8391244] [2021-10-14 11:55:19,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8391244] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:19,242 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:19,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-14 11:55:19,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525954550] [2021-10-14 11:55:19,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-14 11:55:19,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:19,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-14 11:55:19,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-14 11:55:19,243 INFO L87 Difference]: Start difference. First operand 3468 states and 6657 transitions. Second operand has 3 states, 2 states have (on average 49.5) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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-14 11:55:19,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:19,265 INFO L93 Difference]: Finished difference Result 3467 states and 6656 transitions. [2021-10-14 11:55:19,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-14 11:55:19,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 49.5) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2021-10-14 11:55:19,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:19,275 INFO L225 Difference]: With dead ends: 3467 [2021-10-14 11:55:19,275 INFO L226 Difference]: Without dead ends: 3467 [2021-10-14 11:55:19,276 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-14 11:55:19,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3467 states. [2021-10-14 11:55:19,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3467 to 3467. [2021-10-14 11:55:19,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3467 states, 3464 states have (on average 1.9214780600461894) internal successors, (6656), 3466 states have internal predecessors, (6656), 0 states have call successors, (0), 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-14 11:55:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3467 states to 3467 states and 6656 transitions. [2021-10-14 11:55:19,334 INFO L78 Accepts]: Start accepts. Automaton has 3467 states and 6656 transitions. Word has length 99 [2021-10-14 11:55:19,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:19,334 INFO L470 AbstractCegarLoop]: Abstraction has 3467 states and 6656 transitions. [2021-10-14 11:55:19,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 49.5) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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-14 11:55:19,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3467 states and 6656 transitions. [2021-10-14 11:55:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-10-14 11:55:19,336 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:19,336 INFO L512 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-14 11:55:19,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-14 11:55:19,336 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:55:19,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:19,336 INFO L82 PathProgramCache]: Analyzing trace with hash 860961892, now seen corresponding path program 1 times [2021-10-14 11:55:19,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:19,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048976465] [2021-10-14 11:55:19,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:19,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:19,452 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-14 11:55:19,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:19,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048976465] [2021-10-14 11:55:19,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048976465] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:19,453 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:19,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-14 11:55:19,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856710445] [2021-10-14 11:55:19,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-14 11:55:19,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:19,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-14 11:55:19,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:55:19,455 INFO L87 Difference]: Start difference. First operand 3467 states and 6656 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-14 11:55:19,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:19,631 INFO L93 Difference]: Finished difference Result 3466 states and 6655 transitions. [2021-10-14 11:55:19,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-14 11:55:19,632 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-14 11:55:19,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:19,650 INFO L225 Difference]: With dead ends: 3466 [2021-10-14 11:55:19,650 INFO L226 Difference]: Without dead ends: 3466 [2021-10-14 11:55:19,651 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.6ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:55:19,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3466 states. [2021-10-14 11:55:19,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3466 to 3466. [2021-10-14 11:55:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3466 states, 3464 states have (on average 1.921189376443418) internal successors, (6655), 3465 states have internal predecessors, (6655), 0 states have call successors, (0), 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-14 11:55:19,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3466 states to 3466 states and 6655 transitions. [2021-10-14 11:55:19,721 INFO L78 Accepts]: Start accepts. Automaton has 3466 states and 6655 transitions. Word has length 156 [2021-10-14 11:55:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:19,722 INFO L470 AbstractCegarLoop]: Abstraction has 3466 states and 6655 transitions. [2021-10-14 11:55:19,722 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-14 11:55:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3466 states and 6655 transitions. [2021-10-14 11:55:19,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-10-14 11:55:19,729 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:19,729 INFO L512 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] [2021-10-14 11:55:19,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-14 11:55:19,729 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:55:19,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:19,730 INFO L82 PathProgramCache]: Analyzing trace with hash 151451699, now seen corresponding path program 1 times [2021-10-14 11:55:19,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:19,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509758652] [2021-10-14 11:55:19,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:19,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:19,886 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-14 11:55:19,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:19,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509758652] [2021-10-14 11:55:19,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509758652] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:19,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:19,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-14 11:55:19,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282849998] [2021-10-14 11:55:19,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-14 11:55:19,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:19,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-14 11:55:19,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:55:19,890 INFO L87 Difference]: Start difference. First operand 3466 states and 6655 transitions. Second operand has 6 states, 5 states have (on average 37.4) internal successors, (187), 6 states have internal predecessors, (187), 0 states have call successors, (0), 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-14 11:55:20,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:20,266 INFO L93 Difference]: Finished difference Result 3739 states and 7195 transitions. [2021-10-14 11:55:20,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-14 11:55:20,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 37.4) internal successors, (187), 6 states have internal predecessors, (187), 0 states have call successors, (0), 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 187 [2021-10-14 11:55:20,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:20,283 INFO L225 Difference]: With dead ends: 3739 [2021-10-14 11:55:20,283 INFO L226 Difference]: Without dead ends: 3739 [2021-10-14 11:55:20,284 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.6ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:55:20,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3739 states. [2021-10-14 11:55:20,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3739 to 3645. [2021-10-14 11:55:20,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3645 states, 3643 states have (on average 1.9239637661268185) internal successors, (7009), 3644 states have internal predecessors, (7009), 0 states have call successors, (0), 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-14 11:55:20,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3645 states to 3645 states and 7009 transitions. [2021-10-14 11:55:20,383 INFO L78 Accepts]: Start accepts. Automaton has 3645 states and 7009 transitions. Word has length 187 [2021-10-14 11:55:20,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:20,383 INFO L470 AbstractCegarLoop]: Abstraction has 3645 states and 7009 transitions. [2021-10-14 11:55:20,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 37.4) internal successors, (187), 6 states have internal predecessors, (187), 0 states have call successors, (0), 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-14 11:55:20,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3645 states and 7009 transitions. [2021-10-14 11:55:20,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-10-14 11:55:20,386 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:20,386 INFO L512 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] [2021-10-14 11:55:20,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-14 11:55:20,386 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:55:20,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:20,387 INFO L82 PathProgramCache]: Analyzing trace with hash 794081458, now seen corresponding path program 1 times [2021-10-14 11:55:20,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:20,387 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907237081] [2021-10-14 11:55:20,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:20,390 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:20,437 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-14 11:55:20,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:20,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907237081] [2021-10-14 11:55:20,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907237081] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:20,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:20,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-14 11:55:20,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819870025] [2021-10-14 11:55:20,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-14 11:55:20,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:20,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-14 11:55:20,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-14 11:55:20,439 INFO L87 Difference]: Start difference. First operand 3645 states and 7009 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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-14 11:55:20,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:20,460 INFO L93 Difference]: Finished difference Result 2998 states and 5630 transitions. [2021-10-14 11:55:20,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-14 11:55:20,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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 196 [2021-10-14 11:55:20,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:20,466 INFO L225 Difference]: With dead ends: 2998 [2021-10-14 11:55:20,466 INFO L226 Difference]: Without dead ends: 2998 [2021-10-14 11:55:20,466 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-14 11:55:20,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2021-10-14 11:55:20,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2812. [2021-10-14 11:55:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2812 states, 2810 states have (on average 1.8822064056939503) internal successors, (5289), 2811 states have internal predecessors, (5289), 0 states have call successors, (0), 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-14 11:55:20,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 5289 transitions. [2021-10-14 11:55:20,513 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 5289 transitions. Word has length 196 [2021-10-14 11:55:20,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:20,514 INFO L470 AbstractCegarLoop]: Abstraction has 2812 states and 5289 transitions. [2021-10-14 11:55:20,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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-14 11:55:20,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 5289 transitions. [2021-10-14 11:55:20,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2021-10-14 11:55:20,517 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:20,517 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:20,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-14 11:55:20,517 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:55:20,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:20,518 INFO L82 PathProgramCache]: Analyzing trace with hash -2075332540, now seen corresponding path program 1 times [2021-10-14 11:55:20,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:20,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089461810] [2021-10-14 11:55:20,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:20,518 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:20,615 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-14 11:55:20,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:20,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089461810] [2021-10-14 11:55:20,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089461810] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:20,615 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:20,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-14 11:55:20,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335169227] [2021-10-14 11:55:20,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-14 11:55:20,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:20,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-14 11:55:20,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:55:20,617 INFO L87 Difference]: Start difference. First operand 2812 states and 5289 transitions. Second operand has 6 states, 5 states have (on average 43.8) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 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-14 11:55:20,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:20,887 INFO L93 Difference]: Finished difference Result 2991 states and 5596 transitions. [2021-10-14 11:55:20,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-14 11:55:20,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 43.8) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 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 219 [2021-10-14 11:55:20,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:20,892 INFO L225 Difference]: With dead ends: 2991 [2021-10-14 11:55:20,892 INFO L226 Difference]: Without dead ends: 2478 [2021-10-14 11:55:20,893 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.5ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:55:20,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2021-10-14 11:55:20,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2478. [2021-10-14 11:55:20,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2478 states, 2476 states have (on average 1.8489499192245558) internal successors, (4578), 2477 states have internal predecessors, (4578), 0 states have call successors, (0), 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-14 11:55:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 4578 transitions. [2021-10-14 11:55:20,936 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 4578 transitions. Word has length 219 [2021-10-14 11:55:20,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:20,936 INFO L470 AbstractCegarLoop]: Abstraction has 2478 states and 4578 transitions. [2021-10-14 11:55:20,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 43.8) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 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-14 11:55:20,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 4578 transitions. [2021-10-14 11:55:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2021-10-14 11:55:20,939 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:20,939 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:20,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-14 11:55:20,939 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:55:20,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:20,940 INFO L82 PathProgramCache]: Analyzing trace with hash 236837731, now seen corresponding path program 1 times [2021-10-14 11:55:20,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:20,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348555106] [2021-10-14 11:55:20,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:20,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:21,737 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-14 11:55:21,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:21,738 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348555106] [2021-10-14 11:55:21,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348555106] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:21,738 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:21,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-10-14 11:55:21,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51141959] [2021-10-14 11:55:21,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-10-14 11:55:21,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:21,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-10-14 11:55:21,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2021-10-14 11:55:21,739 INFO L87 Difference]: Start difference. First operand 2478 states and 4578 transitions. Second operand has 26 states, 25 states have (on average 8.8) internal successors, (220), 26 states have internal predecessors, (220), 0 states have call successors, (0), 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-14 11:55:23,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:23,366 INFO L93 Difference]: Finished difference Result 2757 states and 5119 transitions. [2021-10-14 11:55:23,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-14 11:55:23,366 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 8.8) internal successors, (220), 26 states have internal predecessors, (220), 0 states have call successors, (0), 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 220 [2021-10-14 11:55:23,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:23,370 INFO L225 Difference]: With dead ends: 2757 [2021-10-14 11:55:23,370 INFO L226 Difference]: Without dead ends: 2757 [2021-10-14 11:55:23,371 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 1061.5ms TimeCoverageRelationStatistics Valid=502, Invalid=2804, Unknown=0, NotChecked=0, Total=3306 [2021-10-14 11:55:23,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2021-10-14 11:55:23,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2423. [2021-10-14 11:55:23,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2423 states, 2421 states have (on average 1.845518380834366) internal successors, (4468), 2422 states have internal predecessors, (4468), 0 states have call successors, (0), 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-14 11:55:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 4468 transitions. [2021-10-14 11:55:23,402 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 4468 transitions. Word has length 220 [2021-10-14 11:55:23,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:23,403 INFO L470 AbstractCegarLoop]: Abstraction has 2423 states and 4468 transitions. [2021-10-14 11:55:23,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 8.8) internal successors, (220), 26 states have internal predecessors, (220), 0 states have call successors, (0), 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-14 11:55:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 4468 transitions. [2021-10-14 11:55:23,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2021-10-14 11:55:23,406 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:23,406 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:23,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-14 11:55:23,406 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:55:23,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:23,406 INFO L82 PathProgramCache]: Analyzing trace with hash 319167177, now seen corresponding path program 1 times [2021-10-14 11:55:23,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:23,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687102352] [2021-10-14 11:55:23,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:23,407 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:24,162 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-14 11:55:24,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:24,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687102352] [2021-10-14 11:55:24,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687102352] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:24,163 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:24,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-10-14 11:55:24,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811024898] [2021-10-14 11:55:24,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-10-14 11:55:24,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:24,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-10-14 11:55:24,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2021-10-14 11:55:24,165 INFO L87 Difference]: Start difference. First operand 2423 states and 4468 transitions. Second operand has 27 states, 26 states have (on average 8.76923076923077) internal successors, (228), 27 states have internal predecessors, (228), 0 states have call successors, (0), 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-14 11:55:26,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:26,311 INFO L93 Difference]: Finished difference Result 2412 states and 4446 transitions. [2021-10-14 11:55:26,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-10-14 11:55:26,311 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 8.76923076923077) internal successors, (228), 27 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2021-10-14 11:55:26,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:26,315 INFO L225 Difference]: With dead ends: 2412 [2021-10-14 11:55:26,316 INFO L226 Difference]: Without dead ends: 2412 [2021-10-14 11:55:26,316 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 802.0ms TimeCoverageRelationStatistics Valid=324, Invalid=2328, Unknown=0, NotChecked=0, Total=2652 [2021-10-14 11:55:26,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2021-10-14 11:55:26,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 2368. [2021-10-14 11:55:26,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 2366 states have (on average 1.8465765004226542) internal successors, (4369), 2367 states have internal predecessors, (4369), 0 states have call successors, (0), 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-14 11:55:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 4369 transitions. [2021-10-14 11:55:26,342 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 4369 transitions. Word has length 228 [2021-10-14 11:55:26,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:26,343 INFO L470 AbstractCegarLoop]: Abstraction has 2368 states and 4369 transitions. [2021-10-14 11:55:26,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 8.76923076923077) internal successors, (228), 27 states have internal predecessors, (228), 0 states have call successors, (0), 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-14 11:55:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 4369 transitions. [2021-10-14 11:55:26,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-10-14 11:55:26,346 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:26,346 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:26,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-14 11:55:26,347 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:55:26,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:26,347 INFO L82 PathProgramCache]: Analyzing trace with hash 674938162, now seen corresponding path program 1 times [2021-10-14 11:55:26,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:26,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967619467] [2021-10-14 11:55:26,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:26,347 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:27,505 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-14 11:55:27,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:27,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967619467] [2021-10-14 11:55:27,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967619467] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:27,505 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:27,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-10-14 11:55:27,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587464129] [2021-10-14 11:55:27,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-10-14 11:55:27,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:27,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-10-14 11:55:27,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=897, Unknown=0, NotChecked=0, Total=992 [2021-10-14 11:55:27,507 INFO L87 Difference]: Start difference. First operand 2368 states and 4369 transitions. Second operand has 32 states, 31 states have (on average 7.451612903225806) internal successors, (231), 32 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:55:29,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:29,734 INFO L93 Difference]: Finished difference Result 2431 states and 4481 transitions. [2021-10-14 11:55:29,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-10-14 11:55:29,748 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 7.451612903225806) internal successors, (231), 32 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2021-10-14 11:55:29,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:29,754 INFO L225 Difference]: With dead ends: 2431 [2021-10-14 11:55:29,754 INFO L226 Difference]: Without dead ends: 2422 [2021-10-14 11:55:29,755 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 1474.8ms TimeCoverageRelationStatistics Valid=469, Invalid=3437, Unknown=0, NotChecked=0, Total=3906 [2021-10-14 11:55:29,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2021-10-14 11:55:29,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2384. [2021-10-14 11:55:29,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2384 states, 2382 states have (on average 1.8471872376154492) internal successors, (4400), 2383 states have internal predecessors, (4400), 0 states have call successors, (0), 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-14 11:55:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 4400 transitions. [2021-10-14 11:55:29,788 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 4400 transitions. Word has length 231 [2021-10-14 11:55:29,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:29,788 INFO L470 AbstractCegarLoop]: Abstraction has 2384 states and 4400 transitions. [2021-10-14 11:55:29,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 7.451612903225806) internal successors, (231), 32 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:55:29,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 4400 transitions. [2021-10-14 11:55:29,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-10-14 11:55:29,792 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:29,792 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:29,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-14 11:55:29,792 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:55:29,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:29,793 INFO L82 PathProgramCache]: Analyzing trace with hash 749466368, now seen corresponding path program 2 times [2021-10-14 11:55:29,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:29,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315797936] [2021-10-14 11:55:29,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:29,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:30,810 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-14 11:55:30,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:30,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315797936] [2021-10-14 11:55:30,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315797936] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:30,811 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:30,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-10-14 11:55:30,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327175214] [2021-10-14 11:55:30,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-10-14 11:55:30,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:30,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-10-14 11:55:30,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2021-10-14 11:55:30,813 INFO L87 Difference]: Start difference. First operand 2384 states and 4400 transitions. Second operand has 29 states, 28 states have (on average 8.25) internal successors, (231), 29 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:55:33,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:33,029 INFO L93 Difference]: Finished difference Result 2461 states and 4540 transitions. [2021-10-14 11:55:33,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-14 11:55:33,041 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 8.25) internal successors, (231), 29 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2021-10-14 11:55:33,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:33,045 INFO L225 Difference]: With dead ends: 2461 [2021-10-14 11:55:33,045 INFO L226 Difference]: Without dead ends: 2452 [2021-10-14 11:55:33,046 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1388.0ms TimeCoverageRelationStatistics Valid=396, Invalid=2796, Unknown=0, NotChecked=0, Total=3192 [2021-10-14 11:55:33,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2021-10-14 11:55:33,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 2390. [2021-10-14 11:55:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2390 states, 2388 states have (on average 1.847571189279732) internal successors, (4412), 2389 states have internal predecessors, (4412), 0 states have call successors, (0), 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-14 11:55:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 4412 transitions. [2021-10-14 11:55:33,080 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 4412 transitions. Word has length 231 [2021-10-14 11:55:33,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:33,080 INFO L470 AbstractCegarLoop]: Abstraction has 2390 states and 4412 transitions. [2021-10-14 11:55:33,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 8.25) internal successors, (231), 29 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:55:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 4412 transitions. [2021-10-14 11:55:33,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-10-14 11:55:33,085 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:33,085 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:33,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-14 11:55:33,086 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:55:33,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:33,086 INFO L82 PathProgramCache]: Analyzing trace with hash 376756776, now seen corresponding path program 3 times [2021-10-14 11:55:33,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:33,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303457567] [2021-10-14 11:55:33,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:33,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:34,020 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-14 11:55:34,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:34,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303457567] [2021-10-14 11:55:34,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303457567] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:34,020 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:34,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-10-14 11:55:34,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3770782] [2021-10-14 11:55:34,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-10-14 11:55:34,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:34,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-10-14 11:55:34,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2021-10-14 11:55:34,022 INFO L87 Difference]: Start difference. First operand 2390 states and 4412 transitions. Second operand has 29 states, 28 states have (on average 8.25) internal successors, (231), 29 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:55:35,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:35,971 INFO L93 Difference]: Finished difference Result 2466 states and 4549 transitions. [2021-10-14 11:55:35,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-14 11:55:35,971 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 8.25) internal successors, (231), 29 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2021-10-14 11:55:35,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:35,978 INFO L225 Difference]: With dead ends: 2466 [2021-10-14 11:55:35,978 INFO L226 Difference]: Without dead ends: 2448 [2021-10-14 11:55:35,980 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 1105.3ms TimeCoverageRelationStatistics Valid=431, Invalid=2991, Unknown=0, NotChecked=0, Total=3422 [2021-10-14 11:55:35,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2021-10-14 11:55:36,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2400. [2021-10-14 11:55:36,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 2398 states have (on average 1.847789824854045) internal successors, (4431), 2399 states have internal predecessors, (4431), 0 states have call successors, (0), 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-14 11:55:36,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 4431 transitions. [2021-10-14 11:55:36,007 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 4431 transitions. Word has length 231 [2021-10-14 11:55:36,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:36,007 INFO L470 AbstractCegarLoop]: Abstraction has 2400 states and 4431 transitions. [2021-10-14 11:55:36,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 8.25) internal successors, (231), 29 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:55:36,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 4431 transitions. [2021-10-14 11:55:36,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-10-14 11:55:36,010 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:36,011 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:36,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-14 11:55:36,011 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:55:36,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:36,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1133416590, now seen corresponding path program 4 times [2021-10-14 11:55:36,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:36,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178616969] [2021-10-14 11:55:36,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:36,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:37,127 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-14 11:55:37,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:37,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178616969] [2021-10-14 11:55:37,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178616969] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:37,127 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:37,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-10-14 11:55:37,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808826110] [2021-10-14 11:55:37,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-10-14 11:55:37,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:37,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-10-14 11:55:37,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2021-10-14 11:55:37,129 INFO L87 Difference]: Start difference. First operand 2400 states and 4431 transitions. Second operand has 32 states, 31 states have (on average 7.451612903225806) internal successors, (231), 32 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:55:39,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:39,502 INFO L93 Difference]: Finished difference Result 2490 states and 4597 transitions. [2021-10-14 11:55:39,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-10-14 11:55:39,502 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 7.451612903225806) internal successors, (231), 32 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2021-10-14 11:55:39,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:39,506 INFO L225 Difference]: With dead ends: 2490 [2021-10-14 11:55:39,506 INFO L226 Difference]: Without dead ends: 2481 [2021-10-14 11:55:39,507 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 1463.8ms TimeCoverageRelationStatistics Valid=470, Invalid=3562, Unknown=0, NotChecked=0, Total=4032 [2021-10-14 11:55:39,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2021-10-14 11:55:39,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2412. [2021-10-14 11:55:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2412 states, 2410 states have (on average 1.8485477178423237) internal successors, (4455), 2411 states have internal predecessors, (4455), 0 states have call successors, (0), 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-14 11:55:39,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2412 states and 4455 transitions. [2021-10-14 11:55:39,533 INFO L78 Accepts]: Start accepts. Automaton has 2412 states and 4455 transitions. Word has length 231 [2021-10-14 11:55:39,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:39,533 INFO L470 AbstractCegarLoop]: Abstraction has 2412 states and 4455 transitions. [2021-10-14 11:55:39,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 7.451612903225806) internal successors, (231), 32 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:55:39,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 4455 transitions. [2021-10-14 11:55:39,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-10-14 11:55:39,536 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:39,536 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:39,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-14 11:55:39,537 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:55:39,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:39,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1506126182, now seen corresponding path program 5 times [2021-10-14 11:55:39,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:39,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890886971] [2021-10-14 11:55:39,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:39,537 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:40,409 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-14 11:55:40,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:40,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890886971] [2021-10-14 11:55:40,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890886971] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:40,409 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:40,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-10-14 11:55:40,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667736311] [2021-10-14 11:55:40,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-10-14 11:55:40,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:40,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-10-14 11:55:40,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2021-10-14 11:55:40,410 INFO L87 Difference]: Start difference. First operand 2412 states and 4455 transitions. Second operand has 29 states, 28 states have (on average 8.25) internal successors, (231), 29 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:55:42,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:42,424 INFO L93 Difference]: Finished difference Result 2519 states and 4653 transitions. [2021-10-14 11:55:42,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-14 11:55:42,425 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 8.25) internal successors, (231), 29 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2021-10-14 11:55:42,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:42,429 INFO L225 Difference]: With dead ends: 2519 [2021-10-14 11:55:42,429 INFO L226 Difference]: Without dead ends: 2501 [2021-10-14 11:55:42,430 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 1136.9ms TimeCoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2021-10-14 11:55:42,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2501 states. [2021-10-14 11:55:42,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501 to 2406. [2021-10-14 11:55:42,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2406 states, 2404 states have (on average 1.848169717138103) internal successors, (4443), 2405 states have internal predecessors, (4443), 0 states have call successors, (0), 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-14 11:55:42,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 4443 transitions. [2021-10-14 11:55:42,461 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 4443 transitions. Word has length 231 [2021-10-14 11:55:42,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:42,461 INFO L470 AbstractCegarLoop]: Abstraction has 2406 states and 4443 transitions. [2021-10-14 11:55:42,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 8.25) internal successors, (231), 29 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:55:42,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 4443 transitions. [2021-10-14 11:55:42,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-10-14 11:55:42,464 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:42,464 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:42,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-14 11:55:42,465 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:55:42,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:42,465 INFO L82 PathProgramCache]: Analyzing trace with hash -489242318, now seen corresponding path program 6 times [2021-10-14 11:55:42,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:42,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545939032] [2021-10-14 11:55:42,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:42,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:43,483 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-14 11:55:43,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:43,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545939032] [2021-10-14 11:55:43,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545939032] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:43,484 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:43,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-10-14 11:55:43,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956914027] [2021-10-14 11:55:43,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-14 11:55:43,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:43,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-14 11:55:43,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2021-10-14 11:55:43,485 INFO L87 Difference]: Start difference. First operand 2406 states and 4443 transitions. Second operand has 30 states, 29 states have (on average 7.9655172413793105) internal successors, (231), 30 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:55:45,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:45,751 INFO L93 Difference]: Finished difference Result 2785 states and 5170 transitions. [2021-10-14 11:55:45,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-10-14 11:55:45,752 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 7.9655172413793105) internal successors, (231), 30 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2021-10-14 11:55:45,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:45,755 INFO L225 Difference]: With dead ends: 2785 [2021-10-14 11:55:45,755 INFO L226 Difference]: Without dead ends: 2758 [2021-10-14 11:55:45,756 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 1415.1ms TimeCoverageRelationStatistics Valid=572, Invalid=4398, Unknown=0, NotChecked=0, Total=4970 [2021-10-14 11:55:45,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2021-10-14 11:55:45,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2416. [2021-10-14 11:55:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2416 states, 2414 states have (on average 1.848384424192212) internal successors, (4462), 2415 states have internal predecessors, (4462), 0 states have call successors, (0), 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-14 11:55:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 4462 transitions. [2021-10-14 11:55:45,784 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 4462 transitions. Word has length 231 [2021-10-14 11:55:45,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:45,784 INFO L470 AbstractCegarLoop]: Abstraction has 2416 states and 4462 transitions. [2021-10-14 11:55:45,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 7.9655172413793105) internal successors, (231), 30 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:55:45,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 4462 transitions. [2021-10-14 11:55:45,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-10-14 11:55:45,787 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:45,788 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:45,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-14 11:55:45,788 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:55:45,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:45,788 INFO L82 PathProgramCache]: Analyzing trace with hash -302890482, now seen corresponding path program 7 times [2021-10-14 11:55:45,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:45,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116898157] [2021-10-14 11:55:45,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:45,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:46,962 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-14 11:55:46,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:46,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116898157] [2021-10-14 11:55:46,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116898157] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:46,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:46,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-10-14 11:55:46,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740325223] [2021-10-14 11:55:46,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-14 11:55:46,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:46,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-14 11:55:46,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2021-10-14 11:55:46,964 INFO L87 Difference]: Start difference. First operand 2416 states and 4462 transitions. Second operand has 30 states, 29 states have (on average 7.9655172413793105) internal successors, (231), 30 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:55:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:49,630 INFO L93 Difference]: Finished difference Result 2554 states and 4721 transitions. [2021-10-14 11:55:49,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-10-14 11:55:49,630 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 7.9655172413793105) internal successors, (231), 30 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2021-10-14 11:55:49,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:49,633 INFO L225 Difference]: With dead ends: 2554 [2021-10-14 11:55:49,634 INFO L226 Difference]: Without dead ends: 2518 [2021-10-14 11:55:49,635 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 1863.1ms TimeCoverageRelationStatistics Valid=598, Invalid=4094, Unknown=0, NotChecked=0, Total=4692 [2021-10-14 11:55:49,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2518 states. [2021-10-14 11:55:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2518 to 2432. [2021-10-14 11:55:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2432 states, 2430 states have (on average 1.8489711934156379) internal successors, (4493), 2431 states have internal predecessors, (4493), 0 states have call successors, (0), 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-14 11:55:49,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 4493 transitions. [2021-10-14 11:55:49,659 INFO L78 Accepts]: Start accepts. Automaton has 2432 states and 4493 transitions. Word has length 231 [2021-10-14 11:55:49,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:49,660 INFO L470 AbstractCegarLoop]: Abstraction has 2432 states and 4493 transitions. [2021-10-14 11:55:49,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 7.9655172413793105) internal successors, (231), 30 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:55:49,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 4493 transitions. [2021-10-14 11:55:49,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-10-14 11:55:49,663 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:49,663 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:49,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-14 11:55:49,664 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:55:49,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:49,664 INFO L82 PathProgramCache]: Analyzing trace with hash 640817920, now seen corresponding path program 8 times [2021-10-14 11:55:49,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:49,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996668097] [2021-10-14 11:55:49,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:49,664 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:50,771 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-14 11:55:50,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:50,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996668097] [2021-10-14 11:55:50,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996668097] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:50,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:50,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-10-14 11:55:50,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228881173] [2021-10-14 11:55:50,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-14 11:55:50,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:50,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-14 11:55:50,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2021-10-14 11:55:50,773 INFO L87 Difference]: Start difference. First operand 2432 states and 4493 transitions. Second operand has 30 states, 29 states have (on average 7.9655172413793105) internal successors, (231), 30 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:55:53,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:53,893 INFO L93 Difference]: Finished difference Result 2702 states and 5016 transitions. [2021-10-14 11:55:53,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-10-14 11:55:53,894 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 7.9655172413793105) internal successors, (231), 30 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2021-10-14 11:55:53,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:53,897 INFO L225 Difference]: With dead ends: 2702 [2021-10-14 11:55:53,897 INFO L226 Difference]: Without dead ends: 2666 [2021-10-14 11:55:53,899 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 1910.4ms TimeCoverageRelationStatistics Valid=615, Invalid=4355, Unknown=0, NotChecked=0, Total=4970 [2021-10-14 11:55:53,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2021-10-14 11:55:53,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2522. [2021-10-14 11:55:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2522 states, 2520 states have (on average 1.8543650793650794) internal successors, (4673), 2521 states have internal predecessors, (4673), 0 states have call successors, (0), 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-14 11:55:53,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 4673 transitions. [2021-10-14 11:55:53,924 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 4673 transitions. Word has length 231 [2021-10-14 11:55:53,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:53,925 INFO L470 AbstractCegarLoop]: Abstraction has 2522 states and 4673 transitions. [2021-10-14 11:55:53,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 7.9655172413793105) internal successors, (231), 30 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:55:53,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 4673 transitions. [2021-10-14 11:55:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-10-14 11:55:53,928 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:53,928 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:53,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-14 11:55:53,929 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:55:53,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:53,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1768912004, now seen corresponding path program 9 times [2021-10-14 11:55:53,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:53,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040814920] [2021-10-14 11:55:53,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:53,930 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:54,725 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-14 11:55:54,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:54,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040814920] [2021-10-14 11:55:54,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040814920] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:54,726 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:54,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-10-14 11:55:54,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059365839] [2021-10-14 11:55:54,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-10-14 11:55:54,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:54,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-10-14 11:55:54,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2021-10-14 11:55:54,727 INFO L87 Difference]: Start difference. First operand 2522 states and 4673 transitions. Second operand has 31 states, 30 states have (on average 7.7) internal successors, (231), 31 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:55:57,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:57,165 INFO L93 Difference]: Finished difference Result 3082 states and 5746 transitions. [2021-10-14 11:55:57,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-10-14 11:55:57,165 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 7.7) internal successors, (231), 31 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2021-10-14 11:55:57,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:57,170 INFO L225 Difference]: With dead ends: 3082 [2021-10-14 11:55:57,170 INFO L226 Difference]: Without dead ends: 3046 [2021-10-14 11:55:57,171 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1899 ImplicationChecksByTransitivity, 1507.2ms TimeCoverageRelationStatistics Valid=848, Invalid=6292, Unknown=0, NotChecked=0, Total=7140 [2021-10-14 11:55:57,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3046 states. [2021-10-14 11:55:57,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3046 to 2672. [2021-10-14 11:55:57,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2672 states, 2670 states have (on average 1.8569288389513108) internal successors, (4958), 2671 states have internal predecessors, (4958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2672 states to 2672 states and 4958 transitions. [2021-10-14 11:55:57,199 INFO L78 Accepts]: Start accepts. Automaton has 2672 states and 4958 transitions. Word has length 231 [2021-10-14 11:55:57,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:57,199 INFO L470 AbstractCegarLoop]: Abstraction has 2672 states and 4958 transitions. [2021-10-14 11:55:57,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 7.7) internal successors, (231), 31 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:55:57,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2672 states and 4958 transitions. [2021-10-14 11:55:57,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-10-14 11:55:57,203 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:57,203 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:57,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-14 11:55:57,203 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:55:57,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:57,204 INFO L82 PathProgramCache]: Analyzing trace with hash 867590158, now seen corresponding path program 10 times [2021-10-14 11:55:57,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:57,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165044782] [2021-10-14 11:55:57,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:57,204 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:55:57,827 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-14 11:55:57,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:55:57,828 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165044782] [2021-10-14 11:55:57,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165044782] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:55:57,828 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:55:57,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-10-14 11:55:57,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130236309] [2021-10-14 11:55:57,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-10-14 11:55:57,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:55:57,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-10-14 11:55:57,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2021-10-14 11:55:57,829 INFO L87 Difference]: Start difference. First operand 2672 states and 4958 transitions. Second operand has 28 states, 27 states have (on average 8.555555555555555) internal successors, (231), 28 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:55:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:55:59,760 INFO L93 Difference]: Finished difference Result 3058 states and 5694 transitions. [2021-10-14 11:55:59,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-10-14 11:55:59,762 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 8.555555555555555) internal successors, (231), 28 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2021-10-14 11:55:59,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:55:59,765 INFO L225 Difference]: With dead ends: 3058 [2021-10-14 11:55:59,765 INFO L226 Difference]: Without dead ends: 3022 [2021-10-14 11:55:59,766 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 999.4ms TimeCoverageRelationStatistics Valid=459, Invalid=3323, Unknown=0, NotChecked=0, Total=3782 [2021-10-14 11:55:59,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2021-10-14 11:55:59,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 2672. [2021-10-14 11:55:59,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2672 states, 2670 states have (on average 1.8569288389513108) internal successors, (4958), 2671 states have internal predecessors, (4958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:55:59,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2672 states to 2672 states and 4958 transitions. [2021-10-14 11:55:59,792 INFO L78 Accepts]: Start accepts. Automaton has 2672 states and 4958 transitions. Word has length 231 [2021-10-14 11:55:59,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:55:59,792 INFO L470 AbstractCegarLoop]: Abstraction has 2672 states and 4958 transitions. [2021-10-14 11:55:59,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 8.555555555555555) internal successors, (231), 28 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:55:59,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2672 states and 4958 transitions. [2021-10-14 11:55:59,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-10-14 11:55:59,796 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:55:59,796 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:55:59,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-14 11:55:59,797 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:55:59,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:55:59,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1644507530, now seen corresponding path program 11 times [2021-10-14 11:55:59,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:55:59,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973643417] [2021-10-14 11:55:59,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:55:59,797 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:55:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:00,458 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-14 11:56:00,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:00,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973643417] [2021-10-14 11:56:00,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973643417] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:00,458 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:00,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-10-14 11:56:00,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470133162] [2021-10-14 11:56:00,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-10-14 11:56:00,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:00,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-10-14 11:56:00,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2021-10-14 11:56:00,460 INFO L87 Difference]: Start difference. First operand 2672 states and 4958 transitions. Second operand has 28 states, 27 states have (on average 8.555555555555555) internal successors, (231), 28 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:56:02,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:02,940 INFO L93 Difference]: Finished difference Result 3098 states and 5768 transitions. [2021-10-14 11:56:02,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-10-14 11:56:02,940 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 8.555555555555555) internal successors, (231), 28 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2021-10-14 11:56:02,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:02,943 INFO L225 Difference]: With dead ends: 3098 [2021-10-14 11:56:02,944 INFO L226 Difference]: Without dead ends: 3062 [2021-10-14 11:56:02,945 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 1123.4ms TimeCoverageRelationStatistics Valid=606, Invalid=4650, Unknown=0, NotChecked=0, Total=5256 [2021-10-14 11:56:02,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2021-10-14 11:56:02,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 2495. [2021-10-14 11:56:02,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2495 states, 2493 states have (on average 1.852787805856398) internal successors, (4619), 2494 states have internal predecessors, (4619), 0 states have call successors, (0), 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-14 11:56:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 4619 transitions. [2021-10-14 11:56:02,974 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 4619 transitions. Word has length 231 [2021-10-14 11:56:02,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:02,974 INFO L470 AbstractCegarLoop]: Abstraction has 2495 states and 4619 transitions. [2021-10-14 11:56:02,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 8.555555555555555) internal successors, (231), 28 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:56:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 4619 transitions. [2021-10-14 11:56:02,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-10-14 11:56:02,978 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:02,978 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-14 11:56:02,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-14 11:56:02,979 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:56:02,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:02,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1890715634, now seen corresponding path program 12 times [2021-10-14 11:56:02,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:02,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704494833] [2021-10-14 11:56:02,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:02,980 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:03,669 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-14 11:56:03,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:03,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704494833] [2021-10-14 11:56:03,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704494833] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:03,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:03,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-10-14 11:56:03,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074505063] [2021-10-14 11:56:03,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-14 11:56:03,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:03,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-14 11:56:03,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2021-10-14 11:56:03,670 INFO L87 Difference]: Start difference. First operand 2495 states and 4619 transitions. Second operand has 30 states, 29 states have (on average 7.9655172413793105) internal successors, (231), 30 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:56:06,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:06,096 INFO L93 Difference]: Finished difference Result 2700 states and 5018 transitions. [2021-10-14 11:56:06,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-10-14 11:56:06,096 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 7.9655172413793105) internal successors, (231), 30 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2021-10-14 11:56:06,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:06,098 INFO L225 Difference]: With dead ends: 2700 [2021-10-14 11:56:06,098 INFO L226 Difference]: Without dead ends: 2664 [2021-10-14 11:56:06,099 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1146 ImplicationChecksByTransitivity, 1287.6ms TimeCoverageRelationStatistics Valid=571, Invalid=4399, Unknown=0, NotChecked=0, Total=4970 [2021-10-14 11:56:06,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2021-10-14 11:56:06,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2308. [2021-10-14 11:56:06,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2308 states, 2307 states have (on average 1.8461205028175118) internal successors, (4259), 2307 states have internal predecessors, (4259), 0 states have call successors, (0), 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-14 11:56:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 4259 transitions. [2021-10-14 11:56:06,118 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 4259 transitions. Word has length 231 [2021-10-14 11:56:06,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:06,118 INFO L470 AbstractCegarLoop]: Abstraction has 2308 states and 4259 transitions. [2021-10-14 11:56:06,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 7.9655172413793105) internal successors, (231), 30 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 11:56:06,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 4259 transitions. [2021-10-14 11:56:06,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:56:06,121 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:06,122 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:56:06,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-14 11:56:06,122 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:56:06,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:06,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1157826920, now seen corresponding path program 1 times [2021-10-14 11:56:06,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:06,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019265862] [2021-10-14 11:56:06,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:06,122 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:06,904 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-14 11:56:06,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:06,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019265862] [2021-10-14 11:56:06,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019265862] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:06,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:06,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-10-14 11:56:06,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885791630] [2021-10-14 11:56:06,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-14 11:56:06,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:06,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-14 11:56:06,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2021-10-14 11:56:06,905 INFO L87 Difference]: Start difference. First operand 2308 states and 4259 transitions. Second operand has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:09,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:09,007 INFO L93 Difference]: Finished difference Result 2843 states and 5281 transitions. [2021-10-14 11:56:09,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-14 11:56:09,007 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:56:09,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:09,010 INFO L225 Difference]: With dead ends: 2843 [2021-10-14 11:56:09,010 INFO L226 Difference]: Without dead ends: 2843 [2021-10-14 11:56:09,011 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 973.2ms TimeCoverageRelationStatistics Valid=403, Invalid=3019, Unknown=0, NotChecked=0, Total=3422 [2021-10-14 11:56:09,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2021-10-14 11:56:09,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2498. [2021-10-14 11:56:09,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2498 states, 2497 states have (on average 1.8538245895074088) internal successors, (4629), 2497 states have internal predecessors, (4629), 0 states have call successors, (0), 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-14 11:56:09,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 4629 transitions. [2021-10-14 11:56:09,033 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 4629 transitions. Word has length 239 [2021-10-14 11:56:09,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:09,033 INFO L470 AbstractCegarLoop]: Abstraction has 2498 states and 4629 transitions. [2021-10-14 11:56:09,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:09,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 4629 transitions. [2021-10-14 11:56:09,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:56:09,036 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:09,036 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:56:09,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-14 11:56:09,037 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:56:09,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:09,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1138450932, now seen corresponding path program 2 times [2021-10-14 11:56:09,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:09,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62606167] [2021-10-14 11:56:09,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:09,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:09,766 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-14 11:56:09,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:09,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62606167] [2021-10-14 11:56:09,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62606167] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:09,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:09,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-10-14 11:56:09,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397883677] [2021-10-14 11:56:09,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-14 11:56:09,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:09,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-14 11:56:09,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2021-10-14 11:56:09,767 INFO L87 Difference]: Start difference. First operand 2498 states and 4629 transitions. Second operand has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:11,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:11,983 INFO L93 Difference]: Finished difference Result 3240 states and 6039 transitions. [2021-10-14 11:56:11,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-10-14 11:56:11,983 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:56:11,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:11,987 INFO L225 Difference]: With dead ends: 3240 [2021-10-14 11:56:11,987 INFO L226 Difference]: Without dead ends: 3240 [2021-10-14 11:56:11,988 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 1355.0ms TimeCoverageRelationStatistics Valid=496, Invalid=3794, Unknown=0, NotChecked=0, Total=4290 [2021-10-14 11:56:11,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3240 states. [2021-10-14 11:56:12,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3240 to 2588. [2021-10-14 11:56:12,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2588 states, 2587 states have (on average 1.8589099342868187) internal successors, (4809), 2587 states have internal predecessors, (4809), 0 states have call successors, (0), 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-14 11:56:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2588 states to 2588 states and 4809 transitions. [2021-10-14 11:56:12,017 INFO L78 Accepts]: Start accepts. Automaton has 2588 states and 4809 transitions. Word has length 239 [2021-10-14 11:56:12,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:12,017 INFO L470 AbstractCegarLoop]: Abstraction has 2588 states and 4809 transitions. [2021-10-14 11:56:12,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:12,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2588 states and 4809 transitions. [2021-10-14 11:56:12,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:56:12,020 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:12,020 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:56:12,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-14 11:56:12,021 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:56:12,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:12,021 INFO L82 PathProgramCache]: Analyzing trace with hash 2015936908, now seen corresponding path program 3 times [2021-10-14 11:56:12,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:12,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274222099] [2021-10-14 11:56:12,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:12,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:12,755 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-14 11:56:12,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:12,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274222099] [2021-10-14 11:56:12,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274222099] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:12,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:12,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-10-14 11:56:12,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104345249] [2021-10-14 11:56:12,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-14 11:56:12,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:12,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-14 11:56:12,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2021-10-14 11:56:12,756 INFO L87 Difference]: Start difference. First operand 2588 states and 4809 transitions. Second operand has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:14,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:14,677 INFO L93 Difference]: Finished difference Result 2674 states and 4937 transitions. [2021-10-14 11:56:14,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-14 11:56:14,678 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:56:14,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:14,680 INFO L225 Difference]: With dead ends: 2674 [2021-10-14 11:56:14,680 INFO L226 Difference]: Without dead ends: 2674 [2021-10-14 11:56:14,681 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 1229.4ms TimeCoverageRelationStatistics Valid=417, Invalid=3123, Unknown=0, NotChecked=0, Total=3540 [2021-10-14 11:56:14,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2021-10-14 11:56:14,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2592. [2021-10-14 11:56:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2592 states, 2591 states have (on average 1.8587417985333847) internal successors, (4816), 2591 states have internal predecessors, (4816), 0 states have call successors, (0), 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-14 11:56:14,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2592 states and 4816 transitions. [2021-10-14 11:56:14,700 INFO L78 Accepts]: Start accepts. Automaton has 2592 states and 4816 transitions. Word has length 239 [2021-10-14 11:56:14,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:14,700 INFO L470 AbstractCegarLoop]: Abstraction has 2592 states and 4816 transitions. [2021-10-14 11:56:14,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:14,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 4816 transitions. [2021-10-14 11:56:14,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:56:14,703 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:14,703 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:56:14,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-14 11:56:14,703 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:56:14,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:14,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1835702746, now seen corresponding path program 4 times [2021-10-14 11:56:14,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:14,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680753362] [2021-10-14 11:56:14,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:14,704 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:15,428 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-14 11:56:15,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:15,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680753362] [2021-10-14 11:56:15,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680753362] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:15,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:15,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-10-14 11:56:15,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977759112] [2021-10-14 11:56:15,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-14 11:56:15,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:15,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-14 11:56:15,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2021-10-14 11:56:15,429 INFO L87 Difference]: Start difference. First operand 2592 states and 4816 transitions. Second operand has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:17,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:17,594 INFO L93 Difference]: Finished difference Result 2714 states and 4997 transitions. [2021-10-14 11:56:17,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-10-14 11:56:17,595 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:56:17,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:17,597 INFO L225 Difference]: With dead ends: 2714 [2021-10-14 11:56:17,597 INFO L226 Difference]: Without dead ends: 2714 [2021-10-14 11:56:17,598 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 1294.1ms TimeCoverageRelationStatistics Valid=433, Invalid=3349, Unknown=0, NotChecked=0, Total=3782 [2021-10-14 11:56:17,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2021-10-14 11:56:17,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2592. [2021-10-14 11:56:17,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2592 states, 2591 states have (on average 1.8587417985333847) internal successors, (4816), 2591 states have internal predecessors, (4816), 0 states have call successors, (0), 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-14 11:56:17,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2592 states and 4816 transitions. [2021-10-14 11:56:17,619 INFO L78 Accepts]: Start accepts. Automaton has 2592 states and 4816 transitions. Word has length 239 [2021-10-14 11:56:17,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:17,619 INFO L470 AbstractCegarLoop]: Abstraction has 2592 states and 4816 transitions. [2021-10-14 11:56:17,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:17,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 4816 transitions. [2021-10-14 11:56:17,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:56:17,622 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:17,622 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:56:17,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-14 11:56:17,622 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:56:17,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:17,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1717081710, now seen corresponding path program 5 times [2021-10-14 11:56:17,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:17,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830244007] [2021-10-14 11:56:17,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:17,623 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:18,317 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-14 11:56:18,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:18,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830244007] [2021-10-14 11:56:18,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830244007] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:18,317 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:18,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-10-14 11:56:18,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466860925] [2021-10-14 11:56:18,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-14 11:56:18,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:18,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-14 11:56:18,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2021-10-14 11:56:18,318 INFO L87 Difference]: Start difference. First operand 2592 states and 4816 transitions. Second operand has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:20,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:20,407 INFO L93 Difference]: Finished difference Result 2744 states and 5067 transitions. [2021-10-14 11:56:20,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-14 11:56:20,407 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:56:20,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:20,410 INFO L225 Difference]: With dead ends: 2744 [2021-10-14 11:56:20,410 INFO L226 Difference]: Without dead ends: 2744 [2021-10-14 11:56:20,410 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 1237.5ms TimeCoverageRelationStatistics Valid=423, Invalid=3237, Unknown=0, NotChecked=0, Total=3660 [2021-10-14 11:56:20,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2744 states. [2021-10-14 11:56:20,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2744 to 2592. [2021-10-14 11:56:20,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2592 states, 2591 states have (on average 1.8587417985333847) internal successors, (4816), 2591 states have internal predecessors, (4816), 0 states have call successors, (0), 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-14 11:56:20,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2592 states and 4816 transitions. [2021-10-14 11:56:20,430 INFO L78 Accepts]: Start accepts. Automaton has 2592 states and 4816 transitions. Word has length 239 [2021-10-14 11:56:20,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:20,430 INFO L470 AbstractCegarLoop]: Abstraction has 2592 states and 4816 transitions. [2021-10-14 11:56:20,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:20,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 4816 transitions. [2021-10-14 11:56:20,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:56:20,433 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:20,434 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:56:20,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-14 11:56:20,434 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:56:20,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:20,434 INFO L82 PathProgramCache]: Analyzing trace with hash 2110284228, now seen corresponding path program 6 times [2021-10-14 11:56:20,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:20,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898266988] [2021-10-14 11:56:20,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:20,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:21,151 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-14 11:56:21,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:21,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898266988] [2021-10-14 11:56:21,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898266988] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:21,152 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:21,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-10-14 11:56:21,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121111564] [2021-10-14 11:56:21,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-14 11:56:21,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:21,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-14 11:56:21,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2021-10-14 11:56:21,153 INFO L87 Difference]: Start difference. First operand 2592 states and 4816 transitions. Second operand has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:23,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:23,284 INFO L93 Difference]: Finished difference Result 2776 states and 5133 transitions. [2021-10-14 11:56:23,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-10-14 11:56:23,284 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:56:23,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:23,286 INFO L225 Difference]: With dead ends: 2776 [2021-10-14 11:56:23,286 INFO L226 Difference]: Without dead ends: 2776 [2021-10-14 11:56:23,287 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 1273.9ms TimeCoverageRelationStatistics Valid=438, Invalid=3344, Unknown=0, NotChecked=0, Total=3782 [2021-10-14 11:56:23,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2021-10-14 11:56:23,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 2592. [2021-10-14 11:56:23,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2592 states, 2591 states have (on average 1.8587417985333847) internal successors, (4816), 2591 states have internal predecessors, (4816), 0 states have call successors, (0), 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-14 11:56:23,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2592 states and 4816 transitions. [2021-10-14 11:56:23,306 INFO L78 Accepts]: Start accepts. Automaton has 2592 states and 4816 transitions. Word has length 239 [2021-10-14 11:56:23,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:23,306 INFO L470 AbstractCegarLoop]: Abstraction has 2592 states and 4816 transitions. [2021-10-14 11:56:23,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:23,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 4816 transitions. [2021-10-14 11:56:23,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:56:23,309 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:23,309 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:56:23,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-14 11:56:23,309 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:56:23,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:23,309 INFO L82 PathProgramCache]: Analyzing trace with hash -291200530, now seen corresponding path program 7 times [2021-10-14 11:56:23,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:23,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55938791] [2021-10-14 11:56:23,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:23,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:24,172 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-14 11:56:24,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:24,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55938791] [2021-10-14 11:56:24,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55938791] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:24,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:24,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-10-14 11:56:24,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187496252] [2021-10-14 11:56:24,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-10-14 11:56:24,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:24,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-10-14 11:56:24,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=897, Unknown=0, NotChecked=0, Total=992 [2021-10-14 11:56:24,174 INFO L87 Difference]: Start difference. First operand 2592 states and 4816 transitions. Second operand has 32 states, 31 states have (on average 7.709677419354839) internal successors, (239), 32 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:26,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:26,505 INFO L93 Difference]: Finished difference Result 3046 states and 5595 transitions. [2021-10-14 11:56:26,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-10-14 11:56:26,505 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 7.709677419354839) internal successors, (239), 32 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:56:26,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:26,508 INFO L225 Difference]: With dead ends: 3046 [2021-10-14 11:56:26,508 INFO L226 Difference]: Without dead ends: 3046 [2021-10-14 11:56:26,509 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 1749.2ms TimeCoverageRelationStatistics Valid=616, Invalid=4496, Unknown=0, NotChecked=0, Total=5112 [2021-10-14 11:56:26,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3046 states. [2021-10-14 11:56:26,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3046 to 2615. [2021-10-14 11:56:26,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2615 states, 2614 states have (on average 1.8580719204284621) internal successors, (4857), 2614 states have internal predecessors, (4857), 0 states have call successors, (0), 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-14 11:56:26,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2615 states and 4857 transitions. [2021-10-14 11:56:26,534 INFO L78 Accepts]: Start accepts. Automaton has 2615 states and 4857 transitions. Word has length 239 [2021-10-14 11:56:26,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:26,534 INFO L470 AbstractCegarLoop]: Abstraction has 2615 states and 4857 transitions. [2021-10-14 11:56:26,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 7.709677419354839) internal successors, (239), 32 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:26,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 4857 transitions. [2021-10-14 11:56:26,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:56:26,537 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:26,537 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:56:26,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-14 11:56:26,538 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:56:26,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:26,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1702099246, now seen corresponding path program 8 times [2021-10-14 11:56:26,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:26,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736992604] [2021-10-14 11:56:26,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:26,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:27,344 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-14 11:56:27,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:27,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736992604] [2021-10-14 11:56:27,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736992604] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:27,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:27,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-10-14 11:56:27,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028038955] [2021-10-14 11:56:27,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-14 11:56:27,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:27,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-14 11:56:27,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2021-10-14 11:56:27,345 INFO L87 Difference]: Start difference. First operand 2615 states and 4857 transitions. Second operand has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:29,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:29,680 INFO L93 Difference]: Finished difference Result 3085 states and 5674 transitions. [2021-10-14 11:56:29,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-10-14 11:56:29,680 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:56:29,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:29,683 INFO L225 Difference]: With dead ends: 3085 [2021-10-14 11:56:29,683 INFO L226 Difference]: Without dead ends: 3085 [2021-10-14 11:56:29,684 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 1498.0ms TimeCoverageRelationStatistics Valid=606, Invalid=3950, Unknown=0, NotChecked=0, Total=4556 [2021-10-14 11:56:29,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2021-10-14 11:56:29,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 2614. [2021-10-14 11:56:29,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2614 states, 2613 states have (on average 1.858017604286261) internal successors, (4855), 2613 states have internal predecessors, (4855), 0 states have call successors, (0), 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-14 11:56:29,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 4855 transitions. [2021-10-14 11:56:29,705 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 4855 transitions. Word has length 239 [2021-10-14 11:56:29,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:29,705 INFO L470 AbstractCegarLoop]: Abstraction has 2614 states and 4855 transitions. [2021-10-14 11:56:29,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:29,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 4855 transitions. [2021-10-14 11:56:29,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:56:29,708 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:29,708 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:56:29,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-14 11:56:29,708 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:56:29,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:29,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2130277038, now seen corresponding path program 9 times [2021-10-14 11:56:29,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:29,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381919598] [2021-10-14 11:56:29,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:29,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:30,475 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-14 11:56:30,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:30,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381919598] [2021-10-14 11:56:30,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381919598] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:30,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:30,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-10-14 11:56:30,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625410889] [2021-10-14 11:56:30,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-10-14 11:56:30,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:30,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-10-14 11:56:30,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2021-10-14 11:56:30,477 INFO L87 Difference]: Start difference. First operand 2614 states and 4855 transitions. Second operand has 29 states, 28 states have (on average 8.535714285714286) internal successors, (239), 29 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:32,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:32,656 INFO L93 Difference]: Finished difference Result 3154 states and 5802 transitions. [2021-10-14 11:56:32,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-10-14 11:56:32,656 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 8.535714285714286) internal successors, (239), 29 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:56:32,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:32,659 INFO L225 Difference]: With dead ends: 3154 [2021-10-14 11:56:32,659 INFO L226 Difference]: Without dead ends: 3154 [2021-10-14 11:56:32,660 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 1200.4ms TimeCoverageRelationStatistics Valid=505, Invalid=3401, Unknown=0, NotChecked=0, Total=3906 [2021-10-14 11:56:32,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3154 states. [2021-10-14 11:56:32,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 2613. [2021-10-14 11:56:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2613 states, 2612 states have (on average 1.8579632465543645) internal successors, (4853), 2612 states have internal predecessors, (4853), 0 states have call successors, (0), 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-14 11:56:32,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2613 states to 2613 states and 4853 transitions. [2021-10-14 11:56:32,685 INFO L78 Accepts]: Start accepts. Automaton has 2613 states and 4853 transitions. Word has length 239 [2021-10-14 11:56:32,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:32,686 INFO L470 AbstractCegarLoop]: Abstraction has 2613 states and 4853 transitions. [2021-10-14 11:56:32,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 8.535714285714286) internal successors, (239), 29 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:32,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2613 states and 4853 transitions. [2021-10-14 11:56:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:56:32,688 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:32,689 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:56:32,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-14 11:56:32,689 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:56:32,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:32,689 INFO L82 PathProgramCache]: Analyzing trace with hash -2116561390, now seen corresponding path program 10 times [2021-10-14 11:56:32,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:32,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027295770] [2021-10-14 11:56:32,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:32,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:33,448 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-14 11:56:33,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:33,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027295770] [2021-10-14 11:56:33,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027295770] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:33,448 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:33,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-10-14 11:56:33,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135531252] [2021-10-14 11:56:33,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-14 11:56:33,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:33,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-14 11:56:33,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2021-10-14 11:56:33,449 INFO L87 Difference]: Start difference. First operand 2613 states and 4853 transitions. Second operand has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:35,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:35,658 INFO L93 Difference]: Finished difference Result 3120 states and 5754 transitions. [2021-10-14 11:56:35,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-10-14 11:56:35,658 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:56:35,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:35,662 INFO L225 Difference]: With dead ends: 3120 [2021-10-14 11:56:35,662 INFO L226 Difference]: Without dead ends: 3120 [2021-10-14 11:56:35,662 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1021 ImplicationChecksByTransitivity, 1368.5ms TimeCoverageRelationStatistics Valid=533, Invalid=3627, Unknown=0, NotChecked=0, Total=4160 [2021-10-14 11:56:35,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2021-10-14 11:56:35,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2612. [2021-10-14 11:56:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2612 states, 2611 states have (on average 1.8579088471849865) internal successors, (4851), 2611 states have internal predecessors, (4851), 0 states have call successors, (0), 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-14 11:56:35,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 4851 transitions. [2021-10-14 11:56:35,683 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 4851 transitions. Word has length 239 [2021-10-14 11:56:35,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:35,683 INFO L470 AbstractCegarLoop]: Abstraction has 2612 states and 4851 transitions. [2021-10-14 11:56:35,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:35,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 4851 transitions. [2021-10-14 11:56:35,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:56:35,686 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:35,686 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:56:35,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-14 11:56:35,686 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:56:35,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:35,686 INFO L82 PathProgramCache]: Analyzing trace with hash 350677272, now seen corresponding path program 11 times [2021-10-14 11:56:35,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:35,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756945678] [2021-10-14 11:56:35,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:35,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:36,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-14 11:56:36,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:36,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756945678] [2021-10-14 11:56:36,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756945678] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:36,513 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:36,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-10-14 11:56:36,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115098104] [2021-10-14 11:56:36,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-10-14 11:56:36,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:36,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-10-14 11:56:36,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2021-10-14 11:56:36,514 INFO L87 Difference]: Start difference. First operand 2612 states and 4851 transitions. Second operand has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 31 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:38,857 INFO L93 Difference]: Finished difference Result 3146 states and 5845 transitions. [2021-10-14 11:56:38,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-10-14 11:56:38,857 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 31 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:56:38,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:38,860 INFO L225 Difference]: With dead ends: 3146 [2021-10-14 11:56:38,860 INFO L226 Difference]: Without dead ends: 3146 [2021-10-14 11:56:38,861 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1204 ImplicationChecksByTransitivity, 1188.7ms TimeCoverageRelationStatistics Valid=503, Invalid=4189, Unknown=0, NotChecked=0, Total=4692 [2021-10-14 11:56:38,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3146 states. [2021-10-14 11:56:38,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3146 to 2494. [2021-10-14 11:56:38,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2494 states, 2493 states have (on average 1.851183313277176) internal successors, (4615), 2493 states have internal predecessors, (4615), 0 states have call successors, (0), 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-14 11:56:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2494 states and 4615 transitions. [2021-10-14 11:56:38,881 INFO L78 Accepts]: Start accepts. Automaton has 2494 states and 4615 transitions. Word has length 239 [2021-10-14 11:56:38,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:38,882 INFO L470 AbstractCegarLoop]: Abstraction has 2494 states and 4615 transitions. [2021-10-14 11:56:38,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 31 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:38,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 4615 transitions. [2021-10-14 11:56:38,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:56:38,884 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:38,884 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:56:38,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-14 11:56:38,884 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:56:38,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:38,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1916119628, now seen corresponding path program 12 times [2021-10-14 11:56:38,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:38,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046474005] [2021-10-14 11:56:38,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:38,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:39,687 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-14 11:56:39,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:39,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046474005] [2021-10-14 11:56:39,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046474005] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:39,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:39,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-10-14 11:56:39,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589626082] [2021-10-14 11:56:39,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-10-14 11:56:39,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:39,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-10-14 11:56:39,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2021-10-14 11:56:39,688 INFO L87 Difference]: Start difference. First operand 2494 states and 4615 transitions. Second operand has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 31 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:41,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:41,431 INFO L93 Difference]: Finished difference Result 2618 states and 4817 transitions. [2021-10-14 11:56:41,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-10-14 11:56:41,432 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 31 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:56:41,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:41,434 INFO L225 Difference]: With dead ends: 2618 [2021-10-14 11:56:41,434 INFO L226 Difference]: Without dead ends: 2618 [2021-10-14 11:56:41,435 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 1104.6ms TimeCoverageRelationStatistics Valid=439, Invalid=3593, Unknown=0, NotChecked=0, Total=4032 [2021-10-14 11:56:41,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2021-10-14 11:56:41,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2497. [2021-10-14 11:56:41,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2497 states, 2496 states have (on average 1.8513621794871795) internal successors, (4621), 2496 states have internal predecessors, (4621), 0 states have call successors, (0), 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-14 11:56:41,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2497 states to 2497 states and 4621 transitions. [2021-10-14 11:56:41,453 INFO L78 Accepts]: Start accepts. Automaton has 2497 states and 4621 transitions. Word has length 239 [2021-10-14 11:56:41,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:41,453 INFO L470 AbstractCegarLoop]: Abstraction has 2497 states and 4621 transitions. [2021-10-14 11:56:41,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 31 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2497 states and 4621 transitions. [2021-10-14 11:56:41,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:56:41,456 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:41,456 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:56:41,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-14 11:56:41,456 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:56:41,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:41,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1935520026, now seen corresponding path program 13 times [2021-10-14 11:56:41,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:41,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821570150] [2021-10-14 11:56:41,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:41,457 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:42,236 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-14 11:56:42,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:42,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821570150] [2021-10-14 11:56:42,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821570150] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:42,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:42,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-10-14 11:56:42,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778322706] [2021-10-14 11:56:42,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-10-14 11:56:42,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:42,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-10-14 11:56:42,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2021-10-14 11:56:42,238 INFO L87 Difference]: Start difference. First operand 2497 states and 4621 transitions. Second operand has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 31 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:44,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:44,451 INFO L93 Difference]: Finished difference Result 2658 states and 4877 transitions. [2021-10-14 11:56:44,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-10-14 11:56:44,451 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 31 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:56:44,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:44,454 INFO L225 Difference]: With dead ends: 2658 [2021-10-14 11:56:44,454 INFO L226 Difference]: Without dead ends: 2658 [2021-10-14 11:56:44,454 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 1177.6ms TimeCoverageRelationStatistics Valid=455, Invalid=3835, Unknown=0, NotChecked=0, Total=4290 [2021-10-14 11:56:44,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2021-10-14 11:56:44,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2496. [2021-10-14 11:56:44,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2495 states have (on average 1.851302605210421) internal successors, (4619), 2495 states have internal predecessors, (4619), 0 states have call successors, (0), 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-14 11:56:44,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 4619 transitions. [2021-10-14 11:56:44,473 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 4619 transitions. Word has length 239 [2021-10-14 11:56:44,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:44,473 INFO L470 AbstractCegarLoop]: Abstraction has 2496 states and 4619 transitions. [2021-10-14 11:56:44,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 31 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:44,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 4619 transitions. [2021-10-14 11:56:44,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:56:44,476 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:44,476 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:56:44,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-14 11:56:44,476 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:56:44,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:44,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1617264430, now seen corresponding path program 14 times [2021-10-14 11:56:44,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:44,477 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656938624] [2021-10-14 11:56:44,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:44,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:45,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-14 11:56:45,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:45,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656938624] [2021-10-14 11:56:45,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656938624] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:45,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:45,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-10-14 11:56:45,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87756196] [2021-10-14 11:56:45,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-10-14 11:56:45,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:45,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-10-14 11:56:45,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2021-10-14 11:56:45,226 INFO L87 Difference]: Start difference. First operand 2496 states and 4619 transitions. Second operand has 28 states, 27 states have (on average 8.851851851851851) internal successors, (239), 28 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:46,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:46,988 INFO L93 Difference]: Finished difference Result 2688 states and 4947 transitions. [2021-10-14 11:56:46,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-14 11:56:46,988 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 8.851851851851851) internal successors, (239), 28 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:56:46,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:46,991 INFO L225 Difference]: With dead ends: 2688 [2021-10-14 11:56:46,991 INFO L226 Difference]: Without dead ends: 2688 [2021-10-14 11:56:46,991 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 951.7ms TimeCoverageRelationStatistics Valid=390, Invalid=2916, Unknown=0, NotChecked=0, Total=3306 [2021-10-14 11:56:46,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2021-10-14 11:56:47,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 2495. [2021-10-14 11:56:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2495 states, 2494 states have (on average 1.851242983159583) internal successors, (4617), 2494 states have internal predecessors, (4617), 0 states have call successors, (0), 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-14 11:56:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 4617 transitions. [2021-10-14 11:56:47,010 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 4617 transitions. Word has length 239 [2021-10-14 11:56:47,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:47,011 INFO L470 AbstractCegarLoop]: Abstraction has 2495 states and 4617 transitions. [2021-10-14 11:56:47,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 8.851851851851851) internal successors, (239), 28 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:47,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 4617 transitions. [2021-10-14 11:56:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:56:47,013 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:47,013 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:56:47,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-14 11:56:47,014 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:56:47,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:47,014 INFO L82 PathProgramCache]: Analyzing trace with hash 2010466948, now seen corresponding path program 15 times [2021-10-14 11:56:47,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:47,014 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848312186] [2021-10-14 11:56:47,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:47,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:47,696 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-14 11:56:47,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:47,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848312186] [2021-10-14 11:56:47,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848312186] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:47,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:47,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-10-14 11:56:47,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472486217] [2021-10-14 11:56:47,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-10-14 11:56:47,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:47,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-10-14 11:56:47,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2021-10-14 11:56:47,698 INFO L87 Difference]: Start difference. First operand 2495 states and 4617 transitions. Second operand has 28 states, 27 states have (on average 8.851851851851851) internal successors, (239), 28 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:49,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:49,317 INFO L93 Difference]: Finished difference Result 2720 states and 5013 transitions. [2021-10-14 11:56:49,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-14 11:56:49,318 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 8.851851851851851) internal successors, (239), 28 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:56:49,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:49,320 INFO L225 Difference]: With dead ends: 2720 [2021-10-14 11:56:49,320 INFO L226 Difference]: Without dead ends: 2720 [2021-10-14 11:56:49,321 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 896.9ms TimeCoverageRelationStatistics Valid=405, Invalid=3017, Unknown=0, NotChecked=0, Total=3422 [2021-10-14 11:56:49,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2021-10-14 11:56:49,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2479. [2021-10-14 11:56:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2479 states, 2478 states have (on average 1.8502824858757063) internal successors, (4585), 2478 states have internal predecessors, (4585), 0 states have call successors, (0), 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-14 11:56:49,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 4585 transitions. [2021-10-14 11:56:49,353 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 4585 transitions. Word has length 239 [2021-10-14 11:56:49,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:49,353 INFO L470 AbstractCegarLoop]: Abstraction has 2479 states and 4585 transitions. [2021-10-14 11:56:49,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 8.851851851851851) internal successors, (239), 28 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:49,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 4585 transitions. [2021-10-14 11:56:49,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:56:49,356 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:49,356 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:56:49,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-14 11:56:49,356 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:56:49,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:49,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1262560322, now seen corresponding path program 16 times [2021-10-14 11:56:49,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:49,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549697774] [2021-10-14 11:56:49,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:49,357 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:50,202 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-14 11:56:50,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:50,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549697774] [2021-10-14 11:56:50,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549697774] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:50,202 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:50,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-10-14 11:56:50,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834095462] [2021-10-14 11:56:50,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-14 11:56:50,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:50,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-14 11:56:50,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2021-10-14 11:56:50,203 INFO L87 Difference]: Start difference. First operand 2479 states and 4585 transitions. Second operand has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:52,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:52,361 INFO L93 Difference]: Finished difference Result 2618 states and 4802 transitions. [2021-10-14 11:56:52,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-10-14 11:56:52,362 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:56:52,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:52,364 INFO L225 Difference]: With dead ends: 2618 [2021-10-14 11:56:52,364 INFO L226 Difference]: Without dead ends: 2618 [2021-10-14 11:56:52,365 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1121 ImplicationChecksByTransitivity, 1439.1ms TimeCoverageRelationStatistics Valid=625, Invalid=3931, Unknown=0, NotChecked=0, Total=4556 [2021-10-14 11:56:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2021-10-14 11:56:52,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2497. [2021-10-14 11:56:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2497 states, 2496 states have (on average 1.8513621794871795) internal successors, (4621), 2496 states have internal predecessors, (4621), 0 states have call successors, (0), 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-14 11:56:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2497 states to 2497 states and 4621 transitions. [2021-10-14 11:56:52,383 INFO L78 Accepts]: Start accepts. Automaton has 2497 states and 4621 transitions. Word has length 239 [2021-10-14 11:56:52,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:52,383 INFO L470 AbstractCegarLoop]: Abstraction has 2497 states and 4621 transitions. [2021-10-14 11:56:52,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:52,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2497 states and 4621 transitions. [2021-10-14 11:56:52,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:56:52,386 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:52,386 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:56:52,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-14 11:56:52,386 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:56:52,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:52,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1621508258, now seen corresponding path program 17 times [2021-10-14 11:56:52,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:52,387 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839351454] [2021-10-14 11:56:52,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:52,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:53,260 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-14 11:56:53,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:53,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839351454] [2021-10-14 11:56:53,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839351454] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:53,260 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:53,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-10-14 11:56:53,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082653067] [2021-10-14 11:56:53,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-14 11:56:53,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:53,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-14 11:56:53,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2021-10-14 11:56:53,262 INFO L87 Difference]: Start difference. First operand 2497 states and 4621 transitions. Second operand has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:55,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:55,746 INFO L93 Difference]: Finished difference Result 2657 states and 4881 transitions. [2021-10-14 11:56:55,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-10-14 11:56:55,747 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:56:55,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:55,749 INFO L225 Difference]: With dead ends: 2657 [2021-10-14 11:56:55,749 INFO L226 Difference]: Without dead ends: 2657 [2021-10-14 11:56:55,749 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1210 ImplicationChecksByTransitivity, 1613.1ms TimeCoverageRelationStatistics Valid=654, Invalid=4176, Unknown=0, NotChecked=0, Total=4830 [2021-10-14 11:56:55,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2657 states. [2021-10-14 11:56:55,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2657 to 2491. [2021-10-14 11:56:55,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2491 states, 2490 states have (on average 1.8510040160642571) internal successors, (4609), 2490 states have internal predecessors, (4609), 0 states have call successors, (0), 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-14 11:56:55,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2491 states to 2491 states and 4609 transitions. [2021-10-14 11:56:55,769 INFO L78 Accepts]: Start accepts. Automaton has 2491 states and 4609 transitions. Word has length 239 [2021-10-14 11:56:55,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:55,769 INFO L470 AbstractCegarLoop]: Abstraction has 2491 states and 4609 transitions. [2021-10-14 11:56:55,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:55,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2491 states and 4609 transitions. [2021-10-14 11:56:55,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:56:55,772 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:55,772 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:56:55,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-14 11:56:55,772 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:56:55,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:55,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1158917246, now seen corresponding path program 18 times [2021-10-14 11:56:55,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:55,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555840836] [2021-10-14 11:56:55,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:55,772 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:56,463 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-14 11:56:56,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:56,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555840836] [2021-10-14 11:56:56,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555840836] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:56,464 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:56,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-10-14 11:56:56,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572357503] [2021-10-14 11:56:56,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-10-14 11:56:56,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:56,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-10-14 11:56:56,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2021-10-14 11:56:56,465 INFO L87 Difference]: Start difference. First operand 2491 states and 4609 transitions. Second operand has 29 states, 28 states have (on average 8.535714285714286) internal successors, (239), 29 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:59,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:56:59,156 INFO L93 Difference]: Finished difference Result 2726 states and 5009 transitions. [2021-10-14 11:56:59,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-10-14 11:56:59,156 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 8.535714285714286) internal successors, (239), 29 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:56:59,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:56:59,159 INFO L225 Difference]: With dead ends: 2726 [2021-10-14 11:56:59,159 INFO L226 Difference]: Without dead ends: 2726 [2021-10-14 11:56:59,160 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 1820.3ms TimeCoverageRelationStatistics Valid=600, Invalid=3690, Unknown=0, NotChecked=0, Total=4290 [2021-10-14 11:56:59,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2021-10-14 11:56:59,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 2485. [2021-10-14 11:56:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2485 states, 2484 states have (on average 1.8506441223832528) internal successors, (4597), 2484 states have internal predecessors, (4597), 0 states have call successors, (0), 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-14 11:56:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 4597 transitions. [2021-10-14 11:56:59,181 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 4597 transitions. Word has length 239 [2021-10-14 11:56:59,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:56:59,181 INFO L470 AbstractCegarLoop]: Abstraction has 2485 states and 4597 transitions. [2021-10-14 11:56:59,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 8.535714285714286) internal successors, (239), 29 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:56:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 4597 transitions. [2021-10-14 11:56:59,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:56:59,183 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:56:59,183 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:56:59,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-14 11:56:59,184 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:56:59,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:56:59,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1207046114, now seen corresponding path program 19 times [2021-10-14 11:56:59,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:56:59,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211773021] [2021-10-14 11:56:59,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:56:59,184 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:56:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:56:59,887 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-14 11:56:59,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:56:59,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211773021] [2021-10-14 11:56:59,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211773021] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:56:59,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:56:59,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-10-14 11:56:59,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567444531] [2021-10-14 11:56:59,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-10-14 11:56:59,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:56:59,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-10-14 11:56:59,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2021-10-14 11:56:59,888 INFO L87 Difference]: Start difference. First operand 2485 states and 4597 transitions. Second operand has 29 states, 28 states have (on average 8.535714285714286) internal successors, (239), 29 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:02,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:02,271 INFO L93 Difference]: Finished difference Result 2785 states and 5127 transitions. [2021-10-14 11:57:02,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-10-14 11:57:02,271 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 8.535714285714286) internal successors, (239), 29 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:57:02,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:02,274 INFO L225 Difference]: With dead ends: 2785 [2021-10-14 11:57:02,274 INFO L226 Difference]: Without dead ends: 2785 [2021-10-14 11:57:02,275 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1416.7ms TimeCoverageRelationStatistics Valid=597, Invalid=3693, Unknown=0, NotChecked=0, Total=4290 [2021-10-14 11:57:02,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2785 states. [2021-10-14 11:57:02,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2785 to 2404. [2021-10-14 11:57:02,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2404 states, 2403 states have (on average 1.8456096545984186) internal successors, (4435), 2403 states have internal predecessors, (4435), 0 states have call successors, (0), 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-14 11:57:02,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2404 states and 4435 transitions. [2021-10-14 11:57:02,292 INFO L78 Accepts]: Start accepts. Automaton has 2404 states and 4435 transitions. Word has length 239 [2021-10-14 11:57:02,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:02,293 INFO L470 AbstractCegarLoop]: Abstraction has 2404 states and 4435 transitions. [2021-10-14 11:57:02,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 8.535714285714286) internal successors, (239), 29 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:02,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 4435 transitions. [2021-10-14 11:57:02,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:57:02,295 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:02,295 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:57:02,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-14 11:57:02,295 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:57:02,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:02,295 INFO L82 PathProgramCache]: Analyzing trace with hash -719275112, now seen corresponding path program 20 times [2021-10-14 11:57:02,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:02,295 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961393194] [2021-10-14 11:57:02,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:02,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:03,050 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-14 11:57:03,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:03,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961393194] [2021-10-14 11:57:03,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961393194] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:03,051 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:03,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-10-14 11:57:03,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031620312] [2021-10-14 11:57:03,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-14 11:57:03,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:03,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-14 11:57:03,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2021-10-14 11:57:03,052 INFO L87 Difference]: Start difference. First operand 2404 states and 4435 transitions. Second operand has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:05,217 INFO L93 Difference]: Finished difference Result 3161 states and 5868 transitions. [2021-10-14 11:57:05,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-10-14 11:57:05,219 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:57:05,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:05,223 INFO L225 Difference]: With dead ends: 3161 [2021-10-14 11:57:05,223 INFO L226 Difference]: Without dead ends: 3161 [2021-10-14 11:57:05,223 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 1334.1ms TimeCoverageRelationStatistics Valid=606, Invalid=3950, Unknown=0, NotChecked=0, Total=4556 [2021-10-14 11:57:05,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3161 states. [2021-10-14 11:57:05,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3161 to 2360. [2021-10-14 11:57:05,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2360 states, 2359 states have (on average 1.844001695633743) internal successors, (4350), 2359 states have internal predecessors, (4350), 0 states have call successors, (0), 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-14 11:57:05,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 4350 transitions. [2021-10-14 11:57:05,246 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 4350 transitions. Word has length 239 [2021-10-14 11:57:05,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:05,251 INFO L470 AbstractCegarLoop]: Abstraction has 2360 states and 4350 transitions. [2021-10-14 11:57:05,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:05,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 4350 transitions. [2021-10-14 11:57:05,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:57:05,253 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:05,253 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:57:05,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-14 11:57:05,253 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:57:05,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:05,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1545929708, now seen corresponding path program 21 times [2021-10-14 11:57:05,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:05,254 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903435638] [2021-10-14 11:57:05,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:05,254 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:06,364 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-14 11:57:06,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:06,364 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903435638] [2021-10-14 11:57:06,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903435638] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:06,366 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:06,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-10-14 11:57:06,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868299125] [2021-10-14 11:57:06,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-10-14 11:57:06,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:06,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-10-14 11:57:06,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2021-10-14 11:57:06,367 INFO L87 Difference]: Start difference. First operand 2360 states and 4350 transitions. Second operand has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 31 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:09,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:09,698 INFO L93 Difference]: Finished difference Result 2438 states and 4467 transitions. [2021-10-14 11:57:09,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-10-14 11:57:09,698 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 31 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:57:09,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:09,700 INFO L225 Difference]: With dead ends: 2438 [2021-10-14 11:57:09,700 INFO L226 Difference]: Without dead ends: 2438 [2021-10-14 11:57:09,701 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 2117.3ms TimeCoverageRelationStatistics Valid=565, Invalid=3595, Unknown=0, NotChecked=0, Total=4160 [2021-10-14 11:57:09,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2438 states. [2021-10-14 11:57:09,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2438 to 2360. [2021-10-14 11:57:09,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2360 states, 2359 states have (on average 1.844001695633743) internal successors, (4350), 2359 states have internal predecessors, (4350), 0 states have call successors, (0), 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-14 11:57:09,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 4350 transitions. [2021-10-14 11:57:09,717 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 4350 transitions. Word has length 239 [2021-10-14 11:57:09,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:09,717 INFO L470 AbstractCegarLoop]: Abstraction has 2360 states and 4350 transitions. [2021-10-14 11:57:09,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 31 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:09,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 4350 transitions. [2021-10-14 11:57:09,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:57:09,719 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:09,719 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:57:09,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-14 11:57:09,719 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:57:09,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:09,720 INFO L82 PathProgramCache]: Analyzing trace with hash -634161508, now seen corresponding path program 22 times [2021-10-14 11:57:09,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:09,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122473901] [2021-10-14 11:57:09,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:09,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:10,819 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-14 11:57:10,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:10,820 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122473901] [2021-10-14 11:57:10,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122473901] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:10,820 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:10,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-10-14 11:57:10,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372558356] [2021-10-14 11:57:10,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-10-14 11:57:10,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:10,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-10-14 11:57:10,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2021-10-14 11:57:10,821 INFO L87 Difference]: Start difference. First operand 2360 states and 4350 transitions. Second operand has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 31 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:14,456 INFO L93 Difference]: Finished difference Result 2474 states and 4511 transitions. [2021-10-14 11:57:14,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-10-14 11:57:14,456 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 31 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:57:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:14,458 INFO L225 Difference]: With dead ends: 2474 [2021-10-14 11:57:14,458 INFO L226 Difference]: Without dead ends: 2474 [2021-10-14 11:57:14,459 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1121 ImplicationChecksByTransitivity, 2342.8ms TimeCoverageRelationStatistics Valid=629, Invalid=3927, Unknown=0, NotChecked=0, Total=4556 [2021-10-14 11:57:14,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2021-10-14 11:57:14,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2366. [2021-10-14 11:57:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 2365 states have (on average 1.8443974630021143) internal successors, (4362), 2365 states have internal predecessors, (4362), 0 states have call successors, (0), 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-14 11:57:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 4362 transitions. [2021-10-14 11:57:14,475 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 4362 transitions. Word has length 239 [2021-10-14 11:57:14,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:14,475 INFO L470 AbstractCegarLoop]: Abstraction has 2366 states and 4362 transitions. [2021-10-14 11:57:14,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 31 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 4362 transitions. [2021-10-14 11:57:14,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:57:14,477 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:14,478 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:57:14,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-14 11:57:14,478 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:57:14,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:14,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1040453606, now seen corresponding path program 23 times [2021-10-14 11:57:14,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:14,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343358913] [2021-10-14 11:57:14,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:14,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:15,376 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-14 11:57:15,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:15,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343358913] [2021-10-14 11:57:15,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343358913] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:15,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:15,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-10-14 11:57:15,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287278828] [2021-10-14 11:57:15,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-14 11:57:15,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:15,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-14 11:57:15,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2021-10-14 11:57:15,378 INFO L87 Difference]: Start difference. First operand 2366 states and 4362 transitions. Second operand has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:18,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:18,244 INFO L93 Difference]: Finished difference Result 2484 states and 4539 transitions. [2021-10-14 11:57:18,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-10-14 11:57:18,244 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:57:18,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:18,246 INFO L225 Difference]: With dead ends: 2484 [2021-10-14 11:57:18,246 INFO L226 Difference]: Without dead ends: 2484 [2021-10-14 11:57:18,247 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 1475.6ms TimeCoverageRelationStatistics Valid=606, Invalid=3816, Unknown=0, NotChecked=0, Total=4422 [2021-10-14 11:57:18,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2021-10-14 11:57:18,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2360. [2021-10-14 11:57:18,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2360 states, 2359 states have (on average 1.844001695633743) internal successors, (4350), 2359 states have internal predecessors, (4350), 0 states have call successors, (0), 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-14 11:57:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 4350 transitions. [2021-10-14 11:57:18,263 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 4350 transitions. Word has length 239 [2021-10-14 11:57:18,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:18,263 INFO L470 AbstractCegarLoop]: Abstraction has 2360 states and 4350 transitions. [2021-10-14 11:57:18,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:18,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 4350 transitions. [2021-10-14 11:57:18,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:57:18,265 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:18,265 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:57:18,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-10-14 11:57:18,265 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:57:18,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:18,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1928635890, now seen corresponding path program 24 times [2021-10-14 11:57:18,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:18,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727249132] [2021-10-14 11:57:18,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:18,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:19,345 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-14 11:57:19,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:19,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727249132] [2021-10-14 11:57:19,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727249132] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:19,345 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:19,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-10-14 11:57:19,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720419813] [2021-10-14 11:57:19,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-10-14 11:57:19,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:19,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-10-14 11:57:19,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2021-10-14 11:57:19,346 INFO L87 Difference]: Start difference. First operand 2360 states and 4350 transitions. Second operand has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 31 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:22,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:22,439 INFO L93 Difference]: Finished difference Result 2477 states and 4530 transitions. [2021-10-14 11:57:22,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-10-14 11:57:22,440 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 31 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:57:22,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:22,442 INFO L225 Difference]: With dead ends: 2477 [2021-10-14 11:57:22,442 INFO L226 Difference]: Without dead ends: 2477 [2021-10-14 11:57:22,442 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 2264.4ms TimeCoverageRelationStatistics Valid=596, Invalid=3826, Unknown=0, NotChecked=0, Total=4422 [2021-10-14 11:57:22,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2021-10-14 11:57:22,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2372. [2021-10-14 11:57:22,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2372 states, 2371 states have (on average 1.8447912273302405) internal successors, (4374), 2371 states have internal predecessors, (4374), 0 states have call successors, (0), 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-14 11:57:22,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 4374 transitions. [2021-10-14 11:57:22,464 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 4374 transitions. Word has length 239 [2021-10-14 11:57:22,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:22,464 INFO L470 AbstractCegarLoop]: Abstraction has 2372 states and 4374 transitions. [2021-10-14 11:57:22,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 31 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:22,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 4374 transitions. [2021-10-14 11:57:22,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:57:22,466 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:22,467 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:57:22,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-10-14 11:57:22,467 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:57:22,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:22,467 INFO L82 PathProgramCache]: Analyzing trace with hash -254020776, now seen corresponding path program 25 times [2021-10-14 11:57:22,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:22,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155265516] [2021-10-14 11:57:22,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:22,467 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:23,389 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-14 11:57:23,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:23,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155265516] [2021-10-14 11:57:23,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155265516] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:23,390 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:23,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-10-14 11:57:23,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794010755] [2021-10-14 11:57:23,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-14 11:57:23,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:23,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-14 11:57:23,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2021-10-14 11:57:23,391 INFO L87 Difference]: Start difference. First operand 2372 states and 4374 transitions. Second operand has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:26,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:26,084 INFO L93 Difference]: Finished difference Result 2517 states and 4590 transitions. [2021-10-14 11:57:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-10-14 11:57:26,085 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:57:26,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:26,087 INFO L225 Difference]: With dead ends: 2517 [2021-10-14 11:57:26,087 INFO L226 Difference]: Without dead ends: 2517 [2021-10-14 11:57:26,087 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 1676.7ms TimeCoverageRelationStatistics Valid=614, Invalid=3942, Unknown=0, NotChecked=0, Total=4556 [2021-10-14 11:57:26,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2517 states. [2021-10-14 11:57:26,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2517 to 2366. [2021-10-14 11:57:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 2365 states have (on average 1.8443974630021143) internal successors, (4362), 2365 states have internal predecessors, (4362), 0 states have call successors, (0), 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-14 11:57:26,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 4362 transitions. [2021-10-14 11:57:26,103 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 4362 transitions. Word has length 239 [2021-10-14 11:57:26,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:26,104 INFO L470 AbstractCegarLoop]: Abstraction has 2366 states and 4362 transitions. [2021-10-14 11:57:26,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:26,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 4362 transitions. [2021-10-14 11:57:26,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:57:26,106 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:26,106 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:57:26,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-14 11:57:26,106 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:57:26,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:26,106 INFO L82 PathProgramCache]: Analyzing trace with hash -194580466, now seen corresponding path program 26 times [2021-10-14 11:57:26,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:26,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764337799] [2021-10-14 11:57:26,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:26,107 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:27,020 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-14 11:57:27,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:27,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764337799] [2021-10-14 11:57:27,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764337799] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:27,021 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:27,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-10-14 11:57:27,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713340963] [2021-10-14 11:57:27,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-10-14 11:57:27,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:27,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-10-14 11:57:27,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2021-10-14 11:57:27,022 INFO L87 Difference]: Start difference. First operand 2366 states and 4362 transitions. Second operand has 32 states, 31 states have (on average 7.709677419354839) internal successors, (239), 32 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:29,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:29,641 INFO L93 Difference]: Finished difference Result 2530 states and 4631 transitions. [2021-10-14 11:57:29,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-10-14 11:57:29,641 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 7.709677419354839) internal successors, (239), 32 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:57:29,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:29,644 INFO L225 Difference]: With dead ends: 2530 [2021-10-14 11:57:29,644 INFO L226 Difference]: Without dead ends: 2530 [2021-10-14 11:57:29,644 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 3 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 1494.6ms TimeCoverageRelationStatistics Valid=557, Invalid=3733, Unknown=0, NotChecked=0, Total=4290 [2021-10-14 11:57:29,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2021-10-14 11:57:29,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2360. [2021-10-14 11:57:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2360 states, 2359 states have (on average 1.844001695633743) internal successors, (4350), 2359 states have internal predecessors, (4350), 0 states have call successors, (0), 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-14 11:57:29,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 4350 transitions. [2021-10-14 11:57:29,664 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 4350 transitions. Word has length 239 [2021-10-14 11:57:29,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:29,664 INFO L470 AbstractCegarLoop]: Abstraction has 2360 states and 4350 transitions. [2021-10-14 11:57:29,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 7.709677419354839) internal successors, (239), 32 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:29,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 4350 transitions. [2021-10-14 11:57:29,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:57:29,666 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:29,666 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:57:29,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-10-14 11:57:29,666 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:57:29,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:29,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1458050822, now seen corresponding path program 27 times [2021-10-14 11:57:29,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:29,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386224529] [2021-10-14 11:57:29,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:29,667 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:30,739 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-14 11:57:30,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:30,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386224529] [2021-10-14 11:57:30,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386224529] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:30,740 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:30,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-10-14 11:57:30,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311700987] [2021-10-14 11:57:30,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-10-14 11:57:30,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:30,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-10-14 11:57:30,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2021-10-14 11:57:30,741 INFO L87 Difference]: Start difference. First operand 2360 states and 4350 transitions. Second operand has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 31 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:33,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:33,532 INFO L93 Difference]: Finished difference Result 2461 states and 4506 transitions. [2021-10-14 11:57:33,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-10-14 11:57:33,532 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 31 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:57:33,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:33,535 INFO L225 Difference]: With dead ends: 2461 [2021-10-14 11:57:33,535 INFO L226 Difference]: Without dead ends: 2461 [2021-10-14 11:57:33,536 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 2225.9ms TimeCoverageRelationStatistics Valid=593, Invalid=3829, Unknown=0, NotChecked=0, Total=4422 [2021-10-14 11:57:33,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2021-10-14 11:57:33,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2354. [2021-10-14 11:57:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2354 states, 2353 states have (on average 1.8461538461538463) internal successors, (4344), 2353 states have internal predecessors, (4344), 0 states have call successors, (0), 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-14 11:57:33,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2354 states and 4344 transitions. [2021-10-14 11:57:33,554 INFO L78 Accepts]: Start accepts. Automaton has 2354 states and 4344 transitions. Word has length 239 [2021-10-14 11:57:33,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:33,555 INFO L470 AbstractCegarLoop]: Abstraction has 2354 states and 4344 transitions. [2021-10-14 11:57:33,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 7.966666666666667) internal successors, (239), 31 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:33,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 4344 transitions. [2021-10-14 11:57:33,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:57:33,557 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:33,557 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:57:33,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-10-14 11:57:33,557 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:57:33,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:33,557 INFO L82 PathProgramCache]: Analyzing trace with hash 216564292, now seen corresponding path program 28 times [2021-10-14 11:57:33,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:33,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759917595] [2021-10-14 11:57:33,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:33,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:34,467 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-14 11:57:34,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:34,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759917595] [2021-10-14 11:57:34,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759917595] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:34,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:34,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-10-14 11:57:34,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029286963] [2021-10-14 11:57:34,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-14 11:57:34,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:34,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-14 11:57:34,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2021-10-14 11:57:34,469 INFO L87 Difference]: Start difference. First operand 2354 states and 4344 transitions. Second operand has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:36,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:36,985 INFO L93 Difference]: Finished difference Result 2501 states and 4566 transitions. [2021-10-14 11:57:36,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-10-14 11:57:36,985 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:57:36,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:36,988 INFO L225 Difference]: With dead ends: 2501 [2021-10-14 11:57:36,988 INFO L226 Difference]: Without dead ends: 2501 [2021-10-14 11:57:36,988 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 1686.6ms TimeCoverageRelationStatistics Valid=608, Invalid=3948, Unknown=0, NotChecked=0, Total=4556 [2021-10-14 11:57:36,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2501 states. [2021-10-14 11:57:37,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501 to 2348. [2021-10-14 11:57:37,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2348 states, 2347 states have (on average 1.8457605453770771) internal successors, (4332), 2347 states have internal predecessors, (4332), 0 states have call successors, (0), 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-14 11:57:37,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 4332 transitions. [2021-10-14 11:57:37,005 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 4332 transitions. Word has length 239 [2021-10-14 11:57:37,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:37,005 INFO L470 AbstractCegarLoop]: Abstraction has 2348 states and 4332 transitions. [2021-10-14 11:57:37,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 4332 transitions. [2021-10-14 11:57:37,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:57:37,007 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:37,007 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:57:37,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-10-14 11:57:37,007 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:57:37,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:37,008 INFO L82 PathProgramCache]: Analyzing trace with hash 276004602, now seen corresponding path program 29 times [2021-10-14 11:57:37,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:37,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440885524] [2021-10-14 11:57:37,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:37,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:37,908 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-14 11:57:37,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:37,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440885524] [2021-10-14 11:57:37,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440885524] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:37,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:37,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-10-14 11:57:37,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865743913] [2021-10-14 11:57:37,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-10-14 11:57:37,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:37,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-10-14 11:57:37,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2021-10-14 11:57:37,910 INFO L87 Difference]: Start difference. First operand 2348 states and 4332 transitions. Second operand has 32 states, 31 states have (on average 7.709677419354839) internal successors, (239), 32 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:40,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:40,292 INFO L93 Difference]: Finished difference Result 2536 states and 4641 transitions. [2021-10-14 11:57:40,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-10-14 11:57:40,292 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 7.709677419354839) internal successors, (239), 32 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:57:40,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:40,294 INFO L225 Difference]: With dead ends: 2536 [2021-10-14 11:57:40,294 INFO L226 Difference]: Without dead ends: 2536 [2021-10-14 11:57:40,295 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1549.6ms TimeCoverageRelationStatistics Valid=570, Invalid=3852, Unknown=0, NotChecked=0, Total=4422 [2021-10-14 11:57:40,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2021-10-14 11:57:40,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2342. [2021-10-14 11:57:40,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2342 states, 2341 states have (on average 1.845365228534814) internal successors, (4320), 2341 states have internal predecessors, (4320), 0 states have call successors, (0), 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-14 11:57:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2342 states to 2342 states and 4320 transitions. [2021-10-14 11:57:40,312 INFO L78 Accepts]: Start accepts. Automaton has 2342 states and 4320 transitions. Word has length 239 [2021-10-14 11:57:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:40,312 INFO L470 AbstractCegarLoop]: Abstraction has 2342 states and 4320 transitions. [2021-10-14 11:57:40,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 7.709677419354839) internal successors, (239), 32 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2342 states and 4320 transitions. [2021-10-14 11:57:40,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-10-14 11:57:40,314 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:40,314 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:57:40,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-10-14 11:57:40,314 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:57:40,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:40,314 INFO L82 PathProgramCache]: Analyzing trace with hash 973947972, now seen corresponding path program 30 times [2021-10-14 11:57:40,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:40,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358279421] [2021-10-14 11:57:40,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:40,315 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:41,383 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-14 11:57:41,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:41,383 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358279421] [2021-10-14 11:57:41,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358279421] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:41,383 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:41,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-10-14 11:57:41,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816150255] [2021-10-14 11:57:41,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-14 11:57:41,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:41,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-14 11:57:41,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2021-10-14 11:57:41,384 INFO L87 Difference]: Start difference. First operand 2342 states and 4320 transitions. Second operand has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:44,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:44,492 INFO L93 Difference]: Finished difference Result 2459 states and 4515 transitions. [2021-10-14 11:57:44,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-10-14 11:57:44,492 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2021-10-14 11:57:44,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:44,495 INFO L225 Difference]: With dead ends: 2459 [2021-10-14 11:57:44,495 INFO L226 Difference]: Without dead ends: 2459 [2021-10-14 11:57:44,495 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 2217.5ms TimeCoverageRelationStatistics Valid=516, Invalid=3516, Unknown=0, NotChecked=0, Total=4032 [2021-10-14 11:57:44,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2021-10-14 11:57:44,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2243. [2021-10-14 11:57:44,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2243 states, 2242 states have (on average 1.847457627118644) internal successors, (4142), 2242 states have internal predecessors, (4142), 0 states have call successors, (0), 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-14 11:57:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 4142 transitions. [2021-10-14 11:57:44,512 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 4142 transitions. Word has length 239 [2021-10-14 11:57:44,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:44,512 INFO L470 AbstractCegarLoop]: Abstraction has 2243 states and 4142 transitions. [2021-10-14 11:57:44,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 8.241379310344827) internal successors, (239), 30 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 11:57:44,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 4142 transitions. [2021-10-14 11:57:44,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2021-10-14 11:57:44,514 INFO L504 BasicCegarLoop]: Found error trace [2021-10-14 11:57:44,514 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:57:44,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-10-14 11:57:44,514 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2021-10-14 11:57:44,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-14 11:57:44,515 INFO L82 PathProgramCache]: Analyzing trace with hash 404237556, now seen corresponding path program 1 times [2021-10-14 11:57:44,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-14 11:57:44,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179701599] [2021-10-14 11:57:44,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-14 11:57:44,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-14 11:57:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-14 11:57:44,576 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-14 11:57:44,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-14 11:57:44,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179701599] [2021-10-14 11:57:44,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179701599] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-14 11:57:44,577 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-14 11:57:44,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-14 11:57:44,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275375494] [2021-10-14 11:57:44,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-14 11:57:44,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-14 11:57:44,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-14 11:57:44,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-14 11:57:44,578 INFO L87 Difference]: Start difference. First operand 2243 states and 4142 transitions. Second operand has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 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-14 11:57:44,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-14 11:57:44,621 INFO L93 Difference]: Finished difference Result 1668 states and 3016 transitions. [2021-10-14 11:57:44,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-14 11:57:44,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2021-10-14 11:57:44,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-14 11:57:44,621 INFO L225 Difference]: With dead ends: 1668 [2021-10-14 11:57:44,621 INFO L226 Difference]: Without dead ends: 0 [2021-10-14 11:57:44,622 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 16.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-14 11:57:44,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-14 11:57:44,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-14 11:57:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-14 11:57:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-14 11:57:44,622 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 252 [2021-10-14 11:57:44,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-14 11:57:44,622 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-14 11:57:44,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 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-14 11:57:44,622 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-14 11:57:44,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-14 11:57:44,624 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:44,624 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:44,625 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:44,625 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:44,625 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:44,625 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:44,625 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:44,625 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:44,625 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:44,625 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:44,625 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:44,625 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:44,625 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-14 11:57:44,625 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:44,625 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:44,625 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:44,626 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE [2021-10-14 11:57:44,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-10-14 11:57:44,630 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-14 11:57:44,630 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-14 11:57:44,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:57:44 BasicIcfg [2021-10-14 11:57:44,631 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-14 11:57:44,632 INFO L168 Benchmark]: Toolchain (without parser) took 148830.49 ms. Allocated memory was 189.8 MB in the beginning and 572.5 MB in the end (delta: 382.7 MB). Free memory was 135.4 MB in the beginning and 331.6 MB in the end (delta: -196.3 MB). Peak memory consumption was 187.3 MB. Max. memory is 8.0 GB. [2021-10-14 11:57:44,632 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 189.8 MB. Free memory was 154.6 MB in the beginning and 154.5 MB in the end (delta: 96.9 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-10-14 11:57:44,632 INFO L168 Benchmark]: CACSL2BoogieTranslator took 515.38 ms. Allocated memory is still 189.8 MB. Free memory was 135.2 MB in the beginning and 136.1 MB in the end (delta: -924.9 kB). Peak memory consumption was 13.7 MB. Max. memory is 8.0 GB. [2021-10-14 11:57:44,633 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.51 ms. Allocated memory is still 189.8 MB. Free memory was 136.1 MB in the beginning and 132.5 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-10-14 11:57:44,633 INFO L168 Benchmark]: Boogie Preprocessor took 37.65 ms. Allocated memory is still 189.8 MB. Free memory was 132.5 MB in the beginning and 129.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-10-14 11:57:44,633 INFO L168 Benchmark]: RCFGBuilder took 577.44 ms. Allocated memory is still 189.8 MB. Free memory was 129.3 MB in the beginning and 104.2 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 8.0 GB. [2021-10-14 11:57:44,633 INFO L168 Benchmark]: TraceAbstraction took 147629.47 ms. Allocated memory was 189.8 MB in the beginning and 572.5 MB in the end (delta: 382.7 MB). Free memory was 103.6 MB in the beginning and 331.6 MB in the end (delta: -228.0 MB). Peak memory consumption was 155.8 MB. Max. memory is 8.0 GB. [2021-10-14 11:57:44,634 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.14 ms. Allocated memory is still 189.8 MB. Free memory was 154.6 MB in the beginning and 154.5 MB in the end (delta: 96.9 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 515.38 ms. Allocated memory is still 189.8 MB. Free memory was 135.2 MB in the beginning and 136.1 MB in the end (delta: -924.9 kB). Peak memory consumption was 13.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 52.51 ms. Allocated memory is still 189.8 MB. Free memory was 136.1 MB in the beginning and 132.5 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 37.65 ms. Allocated memory is still 189.8 MB. Free memory was 132.5 MB in the beginning and 129.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 577.44 ms. Allocated memory is still 189.8 MB. Free memory was 129.3 MB in the beginning and 104.2 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 147629.47 ms. Allocated memory was 189.8 MB in the beginning and 572.5 MB in the end (delta: 382.7 MB). Free memory was 103.6 MB in the beginning and 331.6 MB in the end (delta: -228.0 MB). Peak memory consumption was 155.8 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 - PositiveResult [Line: 1221]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1222]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1239]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1221]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1222]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1241]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1242]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1221]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1222]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1221]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1222]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1246]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1228]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1231]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 371 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 147502.6ms, OverallIterations: 54, TraceHistogramMax: 1, EmptinessCheckTime: 146.5ms, AutomataDifference: 106144.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 114.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 16260 SDtfs, 72367 SDslu, 194866 SDs, 0 SdLazy, 141067 SolverSat, 6242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47863.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3201 GetRequests, 173 SyntacticMatches, 210 SemanticMatches, 2818 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45334 ImplicationChecksByTransitivity, 63875.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3645occurred in iteration=7, InterpolantAutomatonStates: 1943, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1748.2ms AutomataMinimizationTime, 54 MinimizatonAttempts, 11162 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 185.7ms SsaConstructionTime, 1906.6ms SatisfiabilityAnalysisTime, 36729.0ms InterpolantComputationTime, 11745 NumberOfCodeBlocks, 11745 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 11691 ConstructedInterpolants, 0 QuantifiedInterpolants, 303287 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 54 InterpolantComputations, 54 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 - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-14 11:57:44,663 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...