/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_05-ptra_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-eaa536417960c97dc4122e532ee2691877b99d76-eaa5364 [2021-10-16 22:46:49,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-16 22:46:49,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-16 22:46:49,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-16 22:46:49,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-16 22:46:49,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-16 22:46:49,637 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-16 22:46:49,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-16 22:46:49,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-16 22:46:49,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-16 22:46:49,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-16 22:46:49,644 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-16 22:46:49,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-16 22:46:49,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-16 22:46:49,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-16 22:46:49,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-16 22:46:49,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-16 22:46:49,651 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-16 22:46:49,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-16 22:46:49,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-16 22:46:49,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-16 22:46:49,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-16 22:46:49,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-16 22:46:49,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-16 22:46:49,664 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-16 22:46:49,664 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-16 22:46:49,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-16 22:46:49,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-16 22:46:49,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-16 22:46:49,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-16 22:46:49,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-16 22:46:49,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-16 22:46:49,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-16 22:46:49,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-16 22:46:49,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-16 22:46:49,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-16 22:46:49,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-16 22:46:49,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-16 22:46:49,669 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-16 22:46:49,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-16 22:46:49,670 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-16 22:46:49,671 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-16 22:46:49,692 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-16 22:46:49,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-16 22:46:49,692 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-16 22:46:49,693 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-16 22:46:49,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-16 22:46:49,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-16 22:46:49,694 INFO L138 SettingsManager]: * Use SBE=true [2021-10-16 22:46:49,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-16 22:46:49,694 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-16 22:46:49,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-16 22:46:49,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-16 22:46:49,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-16 22:46:49,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-16 22:46:49,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-16 22:46:49,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-16 22:46:49,695 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-16 22:46:49,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-16 22:46:49,695 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-16 22:46:49,695 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-16 22:46:49,695 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-16 22:46:49,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-16 22:46:49,696 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-10-16 22:46:49,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-16 22:46:49,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 22:46:49,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-16 22:46:49,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-16 22:46:49,697 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-16 22:46:49,697 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-16 22:46:49,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-16 22:46:49,697 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-16 22:46:49,697 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-16 22:46:49,697 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-16 22:46:49,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-16 22:46:49,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-16 22:46:49,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-16 22:46:49,909 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-16 22:46:49,909 INFO L275 PluginConnector]: CDTParser initialized [2021-10-16 22:46:49,910 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_05-ptra_rc.i [2021-10-16 22:46:49,971 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7515c390/22446a8065ad40d2ae83ea1025aac304/FLAGc4405eab0 [2021-10-16 22:46:50,418 INFO L306 CDTParser]: Found 1 translation units. [2021-10-16 22:46:50,419 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_05-ptra_rc.i [2021-10-16 22:46:50,435 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7515c390/22446a8065ad40d2ae83ea1025aac304/FLAGc4405eab0 [2021-10-16 22:46:50,726 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7515c390/22446a8065ad40d2ae83ea1025aac304 [2021-10-16 22:46:50,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-16 22:46:50,729 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-16 22:46:50,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-16 22:46:50,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-16 22:46:50,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-16 22:46:50,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:46:50" (1/1) ... [2021-10-16 22:46:50,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5878334c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:50, skipping insertion in model container [2021-10-16 22:46:50,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:46:50" (1/1) ... [2021-10-16 22:46:50,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-16 22:46:50,774 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-16 22:46:51,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 22:46:51,173 INFO L203 MainTranslator]: Completed pre-run [2021-10-16 22:46:51,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 22:46:51,272 INFO L208 MainTranslator]: Completed translation [2021-10-16 22:46:51,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:51 WrapperNode [2021-10-16 22:46:51,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-16 22:46:51,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-16 22:46:51,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-16 22:46:51,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-16 22:46:51,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:51" (1/1) ... [2021-10-16 22:46:51,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:51" (1/1) ... [2021-10-16 22:46:51,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-16 22:46:51,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-16 22:46:51,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-16 22:46:51,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-16 22:46:51,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:51" (1/1) ... [2021-10-16 22:46:51,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:51" (1/1) ... [2021-10-16 22:46:51,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:51" (1/1) ... [2021-10-16 22:46:51,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:51" (1/1) ... [2021-10-16 22:46:51,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:51" (1/1) ... [2021-10-16 22:46:51,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:51" (1/1) ... [2021-10-16 22:46:51,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:51" (1/1) ... [2021-10-16 22:46:51,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-16 22:46:51,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-16 22:46:51,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-16 22:46:51,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-16 22:46:51,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:51" (1/1) ... [2021-10-16 22:46:51,350 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 22:46:51,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-16 22:46:51,400 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-16 22:46:51,411 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-16 22:46:51,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-16 22:46:51,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-16 22:46:51,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-16 22:46:51,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-16 22:46:51,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-16 22:46:51,438 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-10-16 22:46:51,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-16 22:46:51,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-16 22:46:51,439 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-10-16 22:46:51,439 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-10-16 22:46:51,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-16 22:46:51,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-16 22:46:51,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-16 22:46:51,440 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-16 22:46:51,814 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-16 22:46:51,814 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2021-10-16 22:46:51,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:46:51 BoogieIcfgContainer [2021-10-16 22:46:51,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-16 22:46:51,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-16 22:46:51,817 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-16 22:46:51,819 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-16 22:46:51,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 10:46:50" (1/3) ... [2021-10-16 22:46:51,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3bb535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:46:51, skipping insertion in model container [2021-10-16 22:46:51,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:51" (2/3) ... [2021-10-16 22:46:51,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3bb535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:46:51, skipping insertion in model container [2021-10-16 22:46:51,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:46:51" (3/3) ... [2021-10-16 22:46:51,821 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_05-ptra_rc.i [2021-10-16 22:46:51,825 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-16 22:46:51,825 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-16 22:46:51,825 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2021-10-16 22:46:51,825 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-16 22:46:51,889 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,889 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,889 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,890 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,890 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,890 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,890 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,890 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,890 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~ip~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,890 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~ip~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,890 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~ip~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,890 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~ip~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,890 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,891 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,891 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,891 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,891 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,892 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,892 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,892 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,892 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,892 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,892 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,892 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,892 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,893 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,893 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,893 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,893 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,893 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,893 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,894 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,894 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,894 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,894 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,894 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,894 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,894 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,894 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,894 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,894 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,894 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,895 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,895 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,895 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,895 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,895 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,895 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,895 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,895 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,895 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,895 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,895 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,896 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,896 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,896 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,896 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,896 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,896 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,896 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,896 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,896 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,897 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,897 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,897 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,897 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,897 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,897 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,897 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,897 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,897 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,898 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,898 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,898 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,899 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,899 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,899 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,899 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,899 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,899 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,899 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,899 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,900 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,900 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,900 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,900 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,900 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,900 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,900 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,900 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,900 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,900 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,901 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,901 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,901 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,901 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,902 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,904 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,904 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,904 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,908 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,908 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,909 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,909 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,909 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,909 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,909 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,909 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,909 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,909 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,909 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,909 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,909 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,909 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,910 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,910 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,910 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,910 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,910 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,910 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,910 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,910 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,911 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,911 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,911 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,911 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,912 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,912 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,912 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,912 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,912 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,912 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,912 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,912 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,912 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,912 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,913 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,913 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,913 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,913 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,913 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,913 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,913 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,913 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,913 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,913 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,913 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,913 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,914 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,914 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,914 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,914 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,914 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,914 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,914 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,914 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,914 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,914 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,914 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,914 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,915 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,915 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,915 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,915 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,915 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,915 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,915 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,915 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,915 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,915 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,915 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,915 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,916 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,916 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,916 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,916 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,916 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,916 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,916 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,916 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,916 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,916 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,916 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,917 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,917 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,917 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,917 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,917 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,917 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,917 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,917 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,917 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,917 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,917 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,918 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,918 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,918 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,918 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,918 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,918 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,918 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,918 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,918 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,918 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,918 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,918 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,919 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,919 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,919 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,919 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,919 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,919 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,919 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,919 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,919 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,919 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,919 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,920 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,920 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,920 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,920 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,925 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,925 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,926 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,928 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,928 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,929 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,930 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,930 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,930 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,930 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,930 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,930 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,930 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,930 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,930 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,930 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,931 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,931 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,931 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,931 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,931 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,931 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,931 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,931 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,931 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,931 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,931 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,931 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,932 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,932 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,932 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,932 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,932 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,932 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,932 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,933 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,933 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,933 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,933 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,933 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,933 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,933 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,933 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,933 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,933 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,933 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,934 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,934 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,934 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,934 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,934 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,934 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,934 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,934 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,934 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,934 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,934 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,934 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,935 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,935 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,935 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,938 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,938 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,939 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,939 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,939 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,939 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~ip~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,939 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,939 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,939 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,939 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,939 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,940 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,940 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,940 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,940 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,940 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,940 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,940 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,940 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~p.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,940 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,940 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,940 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,940 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~ip~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,940 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,940 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,941 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_init_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,941 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,941 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,941 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,941 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~sp~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,941 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,941 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-16 22:46:51,945 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-16 22:46:51,977 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-16 22:46:51,982 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-16 22:46:51,982 INFO L340 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2021-10-16 22:46:51,994 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 240 places, 236 transitions, 477 flow [2021-10-16 22:46:52,041 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2310 states, 2297 states have (on average 1.910317805833696) internal successors, (4388), 2309 states have internal predecessors, (4388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:52,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 2310 states, 2297 states have (on average 1.910317805833696) internal successors, (4388), 2309 states have internal predecessors, (4388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:52,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-16 22:46:52,050 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:46:52,051 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:46:52,051 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:46:52,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:46:52,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1136014956, now seen corresponding path program 1 times [2021-10-16 22:46:52,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:46:52,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421953914] [2021-10-16 22:46:52,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:46:52,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:46:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:46:52,300 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-16 22:46:52,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:46:52,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421953914] [2021-10-16 22:46:52,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421953914] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:46:52,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:46:52,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-16 22:46:52,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607459760] [2021-10-16 22:46:52,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-16 22:46:52,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:46:52,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-16 22:46:52,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-16 22:46:52,323 INFO L87 Difference]: Start difference. First operand has 2310 states, 2297 states have (on average 1.910317805833696) internal successors, (4388), 2309 states have internal predecessors, (4388), 0 states have call successors, (0), 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.2) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:46:52,619 INFO L93 Difference]: Finished difference Result 2307 states and 4385 transitions. [2021-10-16 22:46:52,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-16 22:46:52,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-10-16 22:46:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:46:52,641 INFO L225 Difference]: With dead ends: 2307 [2021-10-16 22:46:52,641 INFO L226 Difference]: Without dead ends: 2307 [2021-10-16 22:46:52,643 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.6ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-16 22:46:52,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2021-10-16 22:46:52,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2021-10-16 22:46:52,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2297 states have (on average 1.9090117544623422) internal successors, (4385), 2306 states have internal predecessors, (4385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:52,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 4385 transitions. [2021-10-16 22:46:52,747 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 4385 transitions. Word has length 41 [2021-10-16 22:46:52,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:46:52,748 INFO L470 AbstractCegarLoop]: Abstraction has 2307 states and 4385 transitions. [2021-10-16 22:46:52,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:52,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 4385 transitions. [2021-10-16 22:46:52,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-16 22:46:52,749 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:46:52,749 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:46:52,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-16 22:46:52,750 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:46:52,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:46:52,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1447902045, now seen corresponding path program 1 times [2021-10-16 22:46:52,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:46:52,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191368626] [2021-10-16 22:46:52,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:46:52,751 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:46:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:46:52,851 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-16 22:46:52,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:46:52,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191368626] [2021-10-16 22:46:52,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191368626] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:46:52,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:46:52,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-16 22:46:52,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686738525] [2021-10-16 22:46:52,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-16 22:46:52,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:46:52,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-16 22:46:52,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-16 22:46:52,853 INFO L87 Difference]: Start difference. First operand 2307 states and 4385 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:52,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:46:52,988 INFO L93 Difference]: Finished difference Result 2304 states and 4382 transitions. [2021-10-16 22:46:52,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-16 22:46:52,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2021-10-16 22:46:52,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:46:52,996 INFO L225 Difference]: With dead ends: 2304 [2021-10-16 22:46:52,996 INFO L226 Difference]: Without dead ends: 2304 [2021-10-16 22:46:52,996 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.3ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-16 22:46:53,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2021-10-16 22:46:53,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2304. [2021-10-16 22:46:53,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2304 states, 2297 states have (on average 1.9077057030909883) internal successors, (4382), 2303 states have internal predecessors, (4382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 4382 transitions. [2021-10-16 22:46:53,059 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 4382 transitions. Word has length 49 [2021-10-16 22:46:53,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:46:53,059 INFO L470 AbstractCegarLoop]: Abstraction has 2304 states and 4382 transitions. [2021-10-16 22:46:53,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:53,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 4382 transitions. [2021-10-16 22:46:53,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-10-16 22:46:53,062 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:46:53,062 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:46:53,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-16 22:46:53,063 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:46:53,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:46:53,063 INFO L82 PathProgramCache]: Analyzing trace with hash -304688343, now seen corresponding path program 1 times [2021-10-16 22:46:53,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:46:53,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074270149] [2021-10-16 22:46:53,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:46:53,064 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:46:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:46:53,103 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-16 22:46:53,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:46:53,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074270149] [2021-10-16 22:46:53,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074270149] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:46:53,104 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:46:53,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 22:46:53,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644773486] [2021-10-16 22:46:53,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 22:46:53,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:46:53,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 22:46:53,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 22:46:53,105 INFO L87 Difference]: Start difference. First operand 2304 states and 4382 transitions. Second operand has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:53,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:46:53,124 INFO L93 Difference]: Finished difference Result 2303 states and 4381 transitions. [2021-10-16 22:46:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 22:46:53,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2021-10-16 22:46:53,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:46:53,132 INFO L225 Difference]: With dead ends: 2303 [2021-10-16 22:46:53,132 INFO L226 Difference]: Without dead ends: 2303 [2021-10-16 22:46:53,132 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 22:46:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2303 states. [2021-10-16 22:46:53,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2303 to 2303. [2021-10-16 22:46:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2303 states, 2297 states have (on average 1.9072703526338703) internal successors, (4381), 2302 states have internal predecessors, (4381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:53,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 4381 transitions. [2021-10-16 22:46:53,193 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 4381 transitions. Word has length 55 [2021-10-16 22:46:53,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:46:53,193 INFO L470 AbstractCegarLoop]: Abstraction has 2303 states and 4381 transitions. [2021-10-16 22:46:53,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:53,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 4381 transitions. [2021-10-16 22:46:53,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-10-16 22:46:53,194 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:46:53,194 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:46:53,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-16 22:46:53,194 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:46:53,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:46:53,195 INFO L82 PathProgramCache]: Analyzing trace with hash 499753497, now seen corresponding path program 1 times [2021-10-16 22:46:53,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:46:53,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63234798] [2021-10-16 22:46:53,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:46:53,195 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:46:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:46:53,276 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-16 22:46:53,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:46:53,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63234798] [2021-10-16 22:46:53,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63234798] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:46:53,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:46:53,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-16 22:46:53,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472957592] [2021-10-16 22:46:53,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-16 22:46:53,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:46:53,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-16 22:46:53,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-16 22:46:53,278 INFO L87 Difference]: Start difference. First operand 2303 states and 4381 transitions. Second operand has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:53,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:46:53,360 INFO L93 Difference]: Finished difference Result 2302 states and 4380 transitions. [2021-10-16 22:46:53,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-16 22:46:53,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2021-10-16 22:46:53,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:46:53,368 INFO L225 Difference]: With dead ends: 2302 [2021-10-16 22:46:53,368 INFO L226 Difference]: Without dead ends: 2302 [2021-10-16 22:46:53,368 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.0ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-16 22:46:53,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2021-10-16 22:46:53,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2302. [2021-10-16 22:46:53,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2302 states, 2297 states have (on average 1.9068350021767524) internal successors, (4380), 2301 states have internal predecessors, (4380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 4380 transitions. [2021-10-16 22:46:53,405 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 4380 transitions. Word has length 89 [2021-10-16 22:46:53,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:46:53,405 INFO L470 AbstractCegarLoop]: Abstraction has 2302 states and 4380 transitions. [2021-10-16 22:46:53,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:53,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 4380 transitions. [2021-10-16 22:46:53,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-10-16 22:46:53,406 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:46:53,406 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:46:53,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-16 22:46:53,407 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:46:53,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:46:53,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2146740553, now seen corresponding path program 1 times [2021-10-16 22:46:53,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:46:53,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489645259] [2021-10-16 22:46:53,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:46:53,407 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:46:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:46:53,438 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-16 22:46:53,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:46:53,439 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489645259] [2021-10-16 22:46:53,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489645259] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:46:53,439 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:46:53,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 22:46:53,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127800712] [2021-10-16 22:46:53,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 22:46:53,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:46:53,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 22:46:53,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 22:46:53,440 INFO L87 Difference]: Start difference. First operand 2302 states and 4380 transitions. Second operand has 3 states, 2 states have (on average 48.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:53,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:46:53,451 INFO L93 Difference]: Finished difference Result 2301 states and 4379 transitions. [2021-10-16 22:46:53,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 22:46:53,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 48.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2021-10-16 22:46:53,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:46:53,458 INFO L225 Difference]: With dead ends: 2301 [2021-10-16 22:46:53,458 INFO L226 Difference]: Without dead ends: 2301 [2021-10-16 22:46:53,458 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 22:46:53,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2301 states. [2021-10-16 22:46:53,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2301 to 2301. [2021-10-16 22:46:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2301 states, 2297 states have (on average 1.9063996517196342) internal successors, (4379), 2300 states have internal predecessors, (4379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:53,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 4379 transitions. [2021-10-16 22:46:53,489 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 4379 transitions. Word has length 96 [2021-10-16 22:46:53,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:46:53,489 INFO L470 AbstractCegarLoop]: Abstraction has 2301 states and 4379 transitions. [2021-10-16 22:46:53,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 48.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:53,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 4379 transitions. [2021-10-16 22:46:53,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-10-16 22:46:53,491 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:46:53,491 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:46:53,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-16 22:46:53,491 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:46:53,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:46:53,492 INFO L82 PathProgramCache]: Analyzing trace with hash -542880613, now seen corresponding path program 1 times [2021-10-16 22:46:53,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:46:53,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689795845] [2021-10-16 22:46:53,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:46:53,492 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:46:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:46:53,569 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-16 22:46:53,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:46:53,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689795845] [2021-10-16 22:46:53,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689795845] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:46:53,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:46:53,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-16 22:46:53,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984083666] [2021-10-16 22:46:53,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-16 22:46:53,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:46:53,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-16 22:46:53,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-16 22:46:53,570 INFO L87 Difference]: Start difference. First operand 2301 states and 4379 transitions. Second operand has 6 states, 5 states have (on average 28.8) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:53,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:46:53,695 INFO L93 Difference]: Finished difference Result 2405 states and 4582 transitions. [2021-10-16 22:46:53,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-16 22:46:53,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 28.8) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2021-10-16 22:46:53,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:46:53,702 INFO L225 Difference]: With dead ends: 2405 [2021-10-16 22:46:53,702 INFO L226 Difference]: Without dead ends: 2405 [2021-10-16 22:46:53,702 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.1ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-16 22:46:53,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2021-10-16 22:46:53,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2382. [2021-10-16 22:46:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2378 states have (on average 1.907905803195963) internal successors, (4537), 2381 states have internal predecessors, (4537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 4537 transitions. [2021-10-16 22:46:53,735 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 4537 transitions. Word has length 144 [2021-10-16 22:46:53,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:46:53,736 INFO L470 AbstractCegarLoop]: Abstraction has 2382 states and 4537 transitions. [2021-10-16 22:46:53,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 28.8) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:53,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 4537 transitions. [2021-10-16 22:46:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-10-16 22:46:53,737 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:46:53,737 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:46:53,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-16 22:46:53,738 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:46:53,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:46:53,738 INFO L82 PathProgramCache]: Analyzing trace with hash 196870304, now seen corresponding path program 1 times [2021-10-16 22:46:53,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:46:53,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696901255] [2021-10-16 22:46:53,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:46:53,738 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:46:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:46:53,855 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-16 22:46:53,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:46:53,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696901255] [2021-10-16 22:46:53,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696901255] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:46:53,856 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:46:53,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-16 22:46:53,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661757378] [2021-10-16 22:46:53,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-16 22:46:53,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:46:53,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-16 22:46:53,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-16 22:46:53,857 INFO L87 Difference]: Start difference. First operand 2382 states and 4537 transitions. Second operand has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:54,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:46:54,052 INFO L93 Difference]: Finished difference Result 2486 states and 4740 transitions. [2021-10-16 22:46:54,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-16 22:46:54,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2021-10-16 22:46:54,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:46:54,060 INFO L225 Difference]: With dead ends: 2486 [2021-10-16 22:46:54,060 INFO L226 Difference]: Without dead ends: 2486 [2021-10-16 22:46:54,061 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.5ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-16 22:46:54,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2021-10-16 22:46:54,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2463. [2021-10-16 22:46:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2463 states, 2459 states have (on average 1.909312728751525) internal successors, (4695), 2462 states have internal predecessors, (4695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 4695 transitions. [2021-10-16 22:46:54,097 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 4695 transitions. Word has length 152 [2021-10-16 22:46:54,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:46:54,097 INFO L470 AbstractCegarLoop]: Abstraction has 2463 states and 4695 transitions. [2021-10-16 22:46:54,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:54,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 4695 transitions. [2021-10-16 22:46:54,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-10-16 22:46:54,099 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:46:54,099 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:46:54,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-16 22:46:54,099 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:46:54,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:46:54,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1613783396, now seen corresponding path program 1 times [2021-10-16 22:46:54,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:46:54,100 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486530527] [2021-10-16 22:46:54,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:46:54,100 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:46:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:46:54,284 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-16 22:46:54,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:46:54,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486530527] [2021-10-16 22:46:54,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486530527] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:46:54,285 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:46:54,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-16 22:46:54,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771328366] [2021-10-16 22:46:54,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-16 22:46:54,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:46:54,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-16 22:46:54,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-10-16 22:46:54,286 INFO L87 Difference]: Start difference. First operand 2463 states and 4695 transitions. Second operand has 13 states, 12 states have (on average 12.916666666666666) internal successors, (155), 13 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:54,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:46:54,708 INFO L93 Difference]: Finished difference Result 2464 states and 4696 transitions. [2021-10-16 22:46:54,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-16 22:46:54,708 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 12.916666666666666) internal successors, (155), 13 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2021-10-16 22:46:54,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:46:54,716 INFO L225 Difference]: With dead ends: 2464 [2021-10-16 22:46:54,716 INFO L226 Difference]: Without dead ends: 2464 [2021-10-16 22:46:54,716 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 172.5ms TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2021-10-16 22:46:54,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2021-10-16 22:46:54,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 2408. [2021-10-16 22:46:54,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2408 states, 2404 states have (on average 1.9072379367720467) internal successors, (4585), 2407 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-16 22:46:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 4585 transitions. [2021-10-16 22:46:54,755 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 4585 transitions. Word has length 155 [2021-10-16 22:46:54,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:46:54,756 INFO L470 AbstractCegarLoop]: Abstraction has 2408 states and 4585 transitions. [2021-10-16 22:46:54,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 12.916666666666666) internal successors, (155), 13 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 4585 transitions. [2021-10-16 22:46:54,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-10-16 22:46:54,760 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:46:54,760 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:46:54,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-16 22:46:54,760 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:46:54,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:46:54,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1444617857, now seen corresponding path program 1 times [2021-10-16 22:46:54,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:46:54,760 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062174809] [2021-10-16 22:46:54,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:46:54,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:46:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:46:54,965 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-16 22:46:54,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:46:54,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062174809] [2021-10-16 22:46:54,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062174809] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:46:54,966 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:46:54,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-16 22:46:54,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165719513] [2021-10-16 22:46:54,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-16 22:46:54,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:46:54,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-16 22:46:54,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-16 22:46:54,967 INFO L87 Difference]: Start difference. First operand 2408 states and 4585 transitions. Second operand has 13 states, 12 states have (on average 13.583333333333334) internal successors, (163), 13 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:55,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:46:55,590 INFO L93 Difference]: Finished difference Result 2633 states and 4974 transitions. [2021-10-16 22:46:55,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-10-16 22:46:55,591 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 13.583333333333334) internal successors, (163), 13 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2021-10-16 22:46:55,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:46:55,598 INFO L225 Difference]: With dead ends: 2633 [2021-10-16 22:46:55,598 INFO L226 Difference]: Without dead ends: 2633 [2021-10-16 22:46:55,598 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 243.6ms TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2021-10-16 22:46:55,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2021-10-16 22:46:55,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2353. [2021-10-16 22:46:55,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2353 states, 2349 states have (on average 1.9050659855257557) internal successors, (4475), 2352 states have internal predecessors, (4475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:55,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 4475 transitions. [2021-10-16 22:46:55,627 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 4475 transitions. Word has length 163 [2021-10-16 22:46:55,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:46:55,627 INFO L470 AbstractCegarLoop]: Abstraction has 2353 states and 4475 transitions. [2021-10-16 22:46:55,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 13.583333333333334) internal successors, (163), 13 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:55,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 4475 transitions. [2021-10-16 22:46:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:46:55,629 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:46:55,629 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:46:55,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-16 22:46:55,630 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:46:55,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:46:55,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1624954631, now seen corresponding path program 1 times [2021-10-16 22:46:55,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:46:55,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165543698] [2021-10-16 22:46:55,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:46:55,630 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:46:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:46:56,168 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-16 22:46:56,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:46:56,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165543698] [2021-10-16 22:46:56,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165543698] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:46:56,169 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:46:56,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-10-16 22:46:56,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922624889] [2021-10-16 22:46:56,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-10-16 22:46:56,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:46:56,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-10-16 22:46:56,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2021-10-16 22:46:56,170 INFO L87 Difference]: Start difference. First operand 2353 states and 4475 transitions. Second operand has 27 states, 26 states have (on average 6.384615384615385) internal successors, (166), 27 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:59,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:46:59,037 INFO L93 Difference]: Finished difference Result 4764 states and 9191 transitions. [2021-10-16 22:46:59,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2021-10-16 22:46:59,037 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 6.384615384615385) internal successors, (166), 27 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:46:59,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:46:59,053 INFO L225 Difference]: With dead ends: 4764 [2021-10-16 22:46:59,054 INFO L226 Difference]: Without dead ends: 4764 [2021-10-16 22:46:59,055 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2219 ImplicationChecksByTransitivity, 1556.6ms TimeCoverageRelationStatistics Valid=1148, Invalid=6862, Unknown=0, NotChecked=0, Total=8010 [2021-10-16 22:46:59,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4764 states. [2021-10-16 22:46:59,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4764 to 2483. [2021-10-16 22:46:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 2479 states have (on average 1.91004437273094) internal successors, (4735), 2482 states have internal predecessors, (4735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 4735 transitions. [2021-10-16 22:46:59,102 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 4735 transitions. Word has length 166 [2021-10-16 22:46:59,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:46:59,102 INFO L470 AbstractCegarLoop]: Abstraction has 2483 states and 4735 transitions. [2021-10-16 22:46:59,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 6.384615384615385) internal successors, (166), 27 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:46:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 4735 transitions. [2021-10-16 22:46:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:46:59,105 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:46:59,105 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:46:59,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-16 22:46:59,105 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:46:59,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:46:59,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1681844161, now seen corresponding path program 2 times [2021-10-16 22:46:59,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:46:59,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464257155] [2021-10-16 22:46:59,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:46:59,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:46:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:46:59,747 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-16 22:46:59,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:46:59,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464257155] [2021-10-16 22:46:59,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464257155] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:46:59,748 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:46:59,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:46:59,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968798527] [2021-10-16 22:46:59,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:46:59,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:46:59,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:46:59,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:46:59,749 INFO L87 Difference]: Start difference. First operand 2483 states and 4735 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:01,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:47:01,959 INFO L93 Difference]: Finished difference Result 5270 states and 10194 transitions. [2021-10-16 22:47:01,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-10-16 22:47:01,959 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:47:01,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:47:01,977 INFO L225 Difference]: With dead ends: 5270 [2021-10-16 22:47:01,977 INFO L226 Difference]: Without dead ends: 5270 [2021-10-16 22:47:01,978 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 1300.6ms TimeCoverageRelationStatistics Valid=672, Invalid=3618, Unknown=0, NotChecked=0, Total=4290 [2021-10-16 22:47:01,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5270 states. [2021-10-16 22:47:02,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5270 to 2537. [2021-10-16 22:47:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 2533 states have (on average 1.911962100276352) internal successors, (4843), 2536 states have internal predecessors, (4843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:02,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 4843 transitions. [2021-10-16 22:47:02,040 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 4843 transitions. Word has length 166 [2021-10-16 22:47:02,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:47:02,041 INFO L470 AbstractCegarLoop]: Abstraction has 2537 states and 4843 transitions. [2021-10-16 22:47:02,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:02,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 4843 transitions. [2021-10-16 22:47:02,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:47:02,043 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:47:02,043 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:47:02,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-16 22:47:02,043 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:47:02,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:47:02,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1997342077, now seen corresponding path program 3 times [2021-10-16 22:47:02,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:47:02,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099538487] [2021-10-16 22:47:02,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:47:02,044 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:47:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:47:02,601 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-16 22:47:02,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:47:02,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099538487] [2021-10-16 22:47:02,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099538487] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:47:02,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:47:02,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:47:02,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781613151] [2021-10-16 22:47:02,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:47:02,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:47:02,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:47:02,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:47:02,605 INFO L87 Difference]: Start difference. First operand 2537 states and 4843 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:05,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:47:05,096 INFO L93 Difference]: Finished difference Result 4237 states and 8208 transitions. [2021-10-16 22:47:05,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-10-16 22:47:05,099 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:47:05,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:47:05,107 INFO L225 Difference]: With dead ends: 4237 [2021-10-16 22:47:05,107 INFO L226 Difference]: Without dead ends: 4237 [2021-10-16 22:47:05,108 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 1489.3ms TimeCoverageRelationStatistics Valid=653, Invalid=3637, Unknown=0, NotChecked=0, Total=4290 [2021-10-16 22:47:05,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4237 states. [2021-10-16 22:47:05,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4237 to 2541. [2021-10-16 22:47:05,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2541 states, 2537 states have (on average 1.9121009065825778) internal successors, (4851), 2540 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-16 22:47:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 4851 transitions. [2021-10-16 22:47:05,140 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 4851 transitions. Word has length 166 [2021-10-16 22:47:05,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:47:05,140 INFO L470 AbstractCegarLoop]: Abstraction has 2541 states and 4851 transitions. [2021-10-16 22:47:05,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:05,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 4851 transitions. [2021-10-16 22:47:05,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:47:05,142 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:47:05,142 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:47:05,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-16 22:47:05,142 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:47:05,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:47:05,143 INFO L82 PathProgramCache]: Analyzing trace with hash 911806977, now seen corresponding path program 4 times [2021-10-16 22:47:05,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:47:05,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744691493] [2021-10-16 22:47:05,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:47:05,143 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:47:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:47:05,585 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-16 22:47:05,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:47:05,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744691493] [2021-10-16 22:47:05,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744691493] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:47:05,585 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:47:05,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:47:05,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045554838] [2021-10-16 22:47:05,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:47:05,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:47:05,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:47:05,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:47:05,586 INFO L87 Difference]: Start difference. First operand 2541 states and 4851 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:07,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:47:07,855 INFO L93 Difference]: Finished difference Result 6341 states and 12259 transitions. [2021-10-16 22:47:07,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-10-16 22:47:07,856 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:47:07,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:47:07,866 INFO L225 Difference]: With dead ends: 6341 [2021-10-16 22:47:07,866 INFO L226 Difference]: Without dead ends: 6341 [2021-10-16 22:47:07,868 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1448 ImplicationChecksByTransitivity, 1412.5ms TimeCoverageRelationStatistics Valid=900, Invalid=4952, Unknown=0, NotChecked=0, Total=5852 [2021-10-16 22:47:07,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6341 states. [2021-10-16 22:47:07,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6341 to 2541. [2021-10-16 22:47:07,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2541 states, 2537 states have (on average 1.9121009065825778) internal successors, (4851), 2540 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-16 22:47:07,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 4851 transitions. [2021-10-16 22:47:07,913 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 4851 transitions. Word has length 166 [2021-10-16 22:47:07,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:47:07,914 INFO L470 AbstractCegarLoop]: Abstraction has 2541 states and 4851 transitions. [2021-10-16 22:47:07,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 4851 transitions. [2021-10-16 22:47:07,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:47:07,916 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:47:07,916 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:47:07,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-16 22:47:07,916 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:47:07,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:47:07,917 INFO L82 PathProgramCache]: Analyzing trace with hash -916855517, now seen corresponding path program 5 times [2021-10-16 22:47:07,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:47:07,917 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209623052] [2021-10-16 22:47:07,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:47:07,917 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:47:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:47:08,382 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-16 22:47:08,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:47:08,383 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209623052] [2021-10-16 22:47:08,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209623052] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:47:08,383 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:47:08,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:47:08,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293182310] [2021-10-16 22:47:08,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:47:08,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:47:08,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:47:08,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:47:08,384 INFO L87 Difference]: Start difference. First operand 2541 states and 4851 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:10,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:47:10,909 INFO L93 Difference]: Finished difference Result 6417 states and 12407 transitions. [2021-10-16 22:47:10,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-10-16 22:47:10,910 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:47:10,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:47:10,920 INFO L225 Difference]: With dead ends: 6417 [2021-10-16 22:47:10,920 INFO L226 Difference]: Without dead ends: 6417 [2021-10-16 22:47:10,921 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1681 ImplicationChecksByTransitivity, 1508.9ms TimeCoverageRelationStatistics Valid=1027, Invalid=5453, Unknown=0, NotChecked=0, Total=6480 [2021-10-16 22:47:10,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6417 states. [2021-10-16 22:47:10,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6417 to 2541. [2021-10-16 22:47:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2541 states, 2537 states have (on average 1.9121009065825778) internal successors, (4851), 2540 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-16 22:47:10,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 4851 transitions. [2021-10-16 22:47:10,961 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 4851 transitions. Word has length 166 [2021-10-16 22:47:10,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:47:10,961 INFO L470 AbstractCegarLoop]: Abstraction has 2541 states and 4851 transitions. [2021-10-16 22:47:10,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:10,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 4851 transitions. [2021-10-16 22:47:10,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:47:10,963 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:47:10,963 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:47:10,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-16 22:47:10,964 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:47:10,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:47:10,964 INFO L82 PathProgramCache]: Analyzing trace with hash 491757381, now seen corresponding path program 6 times [2021-10-16 22:47:10,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:47:10,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384438720] [2021-10-16 22:47:10,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:47:10,964 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:47:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:47:11,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 22:47:11,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:47:11,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384438720] [2021-10-16 22:47:11,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384438720] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:47:11,401 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:47:11,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:47:11,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867062195] [2021-10-16 22:47:11,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:47:11,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:47:11,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:47:11,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:47:11,402 INFO L87 Difference]: Start difference. First operand 2541 states and 4851 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:13,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:47:13,975 INFO L93 Difference]: Finished difference Result 5088 states and 9838 transitions. [2021-10-16 22:47:13,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-10-16 22:47:13,975 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:47:13,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:47:13,983 INFO L225 Difference]: With dead ends: 5088 [2021-10-16 22:47:13,983 INFO L226 Difference]: Without dead ends: 5088 [2021-10-16 22:47:13,985 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1876 ImplicationChecksByTransitivity, 1550.1ms TimeCoverageRelationStatistics Valid=1039, Invalid=5933, Unknown=0, NotChecked=0, Total=6972 [2021-10-16 22:47:13,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5088 states. [2021-10-16 22:47:14,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5088 to 2541. [2021-10-16 22:47:14,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2541 states, 2537 states have (on average 1.9121009065825778) internal successors, (4851), 2540 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-16 22:47:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 4851 transitions. [2021-10-16 22:47:14,038 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 4851 transitions. Word has length 166 [2021-10-16 22:47:14,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:47:14,039 INFO L470 AbstractCegarLoop]: Abstraction has 2541 states and 4851 transitions. [2021-10-16 22:47:14,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:14,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 4851 transitions. [2021-10-16 22:47:14,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:47:14,042 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:47:14,042 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:47:14,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-16 22:47:14,043 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:47:14,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:47:14,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1436531529, now seen corresponding path program 7 times [2021-10-16 22:47:14,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:47:14,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451759830] [2021-10-16 22:47:14,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:47:14,044 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:47:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:47:14,650 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-16 22:47:14,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:47:14,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451759830] [2021-10-16 22:47:14,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451759830] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:47:14,654 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:47:14,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:47:14,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464880126] [2021-10-16 22:47:14,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:47:14,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:47:14,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:47:14,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:47:14,656 INFO L87 Difference]: Start difference. First operand 2541 states and 4851 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:17,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:47:17,228 INFO L93 Difference]: Finished difference Result 4710 states and 9150 transitions. [2021-10-16 22:47:17,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-10-16 22:47:17,229 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:47:17,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:47:17,236 INFO L225 Difference]: With dead ends: 4710 [2021-10-16 22:47:17,236 INFO L226 Difference]: Without dead ends: 4710 [2021-10-16 22:47:17,237 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 1634.6ms TimeCoverageRelationStatistics Valid=827, Invalid=3595, Unknown=0, NotChecked=0, Total=4422 [2021-10-16 22:47:17,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4710 states. [2021-10-16 22:47:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4710 to 2561. [2021-10-16 22:47:17,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2561 states, 2557 states have (on average 1.912788423934298) internal successors, (4891), 2560 states have internal predecessors, (4891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 4891 transitions. [2021-10-16 22:47:17,272 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 4891 transitions. Word has length 166 [2021-10-16 22:47:17,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:47:17,272 INFO L470 AbstractCegarLoop]: Abstraction has 2561 states and 4891 transitions. [2021-10-16 22:47:17,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 4891 transitions. [2021-10-16 22:47:17,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:47:17,274 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:47:17,274 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:47:17,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-16 22:47:17,274 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:47:17,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:47:17,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1830104005, now seen corresponding path program 8 times [2021-10-16 22:47:17,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:47:17,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936955879] [2021-10-16 22:47:17,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:47:17,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:47:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:47:17,792 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-16 22:47:17,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:47:17,792 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936955879] [2021-10-16 22:47:17,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936955879] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:47:17,792 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:47:17,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:47:17,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468409253] [2021-10-16 22:47:17,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:47:17,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:47:17,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:47:17,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:47:17,793 INFO L87 Difference]: Start difference. First operand 2561 states and 4891 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:20,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:47:20,006 INFO L93 Difference]: Finished difference Result 3260 states and 6237 transitions. [2021-10-16 22:47:20,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-10-16 22:47:20,006 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:47:20,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:47:20,012 INFO L225 Difference]: With dead ends: 3260 [2021-10-16 22:47:20,012 INFO L226 Difference]: Without dead ends: 3260 [2021-10-16 22:47:20,014 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2149 ImplicationChecksByTransitivity, 1488.8ms TimeCoverageRelationStatistics Valid=1228, Invalid=5912, Unknown=0, NotChecked=0, Total=7140 [2021-10-16 22:47:20,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3260 states. [2021-10-16 22:47:20,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3260 to 2591. [2021-10-16 22:47:20,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2591 states, 2587 states have (on average 1.913799768071125) internal successors, (4951), 2590 states have internal predecessors, (4951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:20,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 2591 states and 4951 transitions. [2021-10-16 22:47:20,049 INFO L78 Accepts]: Start accepts. Automaton has 2591 states and 4951 transitions. Word has length 166 [2021-10-16 22:47:20,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:47:20,049 INFO L470 AbstractCegarLoop]: Abstraction has 2591 states and 4951 transitions. [2021-10-16 22:47:20,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:20,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 4951 transitions. [2021-10-16 22:47:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:47:20,051 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:47:20,052 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:47:20,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-16 22:47:20,052 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:47:20,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:47:20,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2085906815, now seen corresponding path program 9 times [2021-10-16 22:47:20,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:47:20,052 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456557015] [2021-10-16 22:47:20,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:47:20,052 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:47:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:47:20,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-16 22:47:20,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:47:20,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456557015] [2021-10-16 22:47:20,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456557015] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:47:20,696 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:47:20,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:47:20,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808297439] [2021-10-16 22:47:20,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:47:20,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:47:20,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:47:20,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:47:20,697 INFO L87 Difference]: Start difference. First operand 2591 states and 4951 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:47:23,711 INFO L93 Difference]: Finished difference Result 3336 states and 6385 transitions. [2021-10-16 22:47:23,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-10-16 22:47:23,711 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:47:23,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:47:23,715 INFO L225 Difference]: With dead ends: 3336 [2021-10-16 22:47:23,715 INFO L226 Difference]: Without dead ends: 3336 [2021-10-16 22:47:23,716 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2419 ImplicationChecksByTransitivity, 1907.0ms TimeCoverageRelationStatistics Valid=1334, Invalid=6498, Unknown=0, NotChecked=0, Total=7832 [2021-10-16 22:47:23,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2021-10-16 22:47:23,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 2585. [2021-10-16 22:47:23,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2585 states, 2581 states have (on average 1.9135993800852382) internal successors, (4939), 2584 states have internal predecessors, (4939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:23,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 4939 transitions. [2021-10-16 22:47:23,742 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 4939 transitions. Word has length 166 [2021-10-16 22:47:23,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:47:23,742 INFO L470 AbstractCegarLoop]: Abstraction has 2585 states and 4939 transitions. [2021-10-16 22:47:23,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:23,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 4939 transitions. [2021-10-16 22:47:23,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:47:23,744 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:47:23,744 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:47:23,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-16 22:47:23,745 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:47:23,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:47:23,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1742952891, now seen corresponding path program 10 times [2021-10-16 22:47:23,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:47:23,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289208368] [2021-10-16 22:47:23,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:47:23,745 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:47:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:47:24,193 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-16 22:47:24,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:47:24,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289208368] [2021-10-16 22:47:24,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289208368] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:47:24,194 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:47:24,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:47:24,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855546116] [2021-10-16 22:47:24,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:47:24,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:47:24,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:47:24,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:47:24,195 INFO L87 Difference]: Start difference. First operand 2585 states and 4939 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:26,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:47:26,380 INFO L93 Difference]: Finished difference Result 4106 states and 7883 transitions. [2021-10-16 22:47:26,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-10-16 22:47:26,380 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:47:26,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:47:26,385 INFO L225 Difference]: With dead ends: 4106 [2021-10-16 22:47:26,385 INFO L226 Difference]: Without dead ends: 4106 [2021-10-16 22:47:26,387 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1401 ImplicationChecksByTransitivity, 1149.9ms TimeCoverageRelationStatistics Valid=695, Invalid=4855, Unknown=0, NotChecked=0, Total=5550 [2021-10-16 22:47:26,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2021-10-16 22:47:26,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 2573. [2021-10-16 22:47:26,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2573 states, 2569 states have (on average 1.9131957960295836) internal successors, (4915), 2572 states have internal predecessors, (4915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2573 states and 4915 transitions. [2021-10-16 22:47:26,433 INFO L78 Accepts]: Start accepts. Automaton has 2573 states and 4915 transitions. Word has length 166 [2021-10-16 22:47:26,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:47:26,433 INFO L470 AbstractCegarLoop]: Abstraction has 2573 states and 4915 transitions. [2021-10-16 22:47:26,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:26,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 4915 transitions. [2021-10-16 22:47:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:47:26,435 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:47:26,435 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:47:26,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-16 22:47:26,435 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:47:26,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:47:26,436 INFO L82 PathProgramCache]: Analyzing trace with hash -182643621, now seen corresponding path program 11 times [2021-10-16 22:47:26,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:47:26,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272853409] [2021-10-16 22:47:26,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:47:26,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:47:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:47:26,847 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-16 22:47:26,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:47:26,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272853409] [2021-10-16 22:47:26,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272853409] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:47:26,847 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:47:26,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:47:26,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944317500] [2021-10-16 22:47:26,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:47:26,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:47:26,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:47:26,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:47:26,848 INFO L87 Difference]: Start difference. First operand 2573 states and 4915 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:28,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:47:28,907 INFO L93 Difference]: Finished difference Result 4372 states and 8379 transitions. [2021-10-16 22:47:28,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-10-16 22:47:28,908 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:47:28,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:47:28,913 INFO L225 Difference]: With dead ends: 4372 [2021-10-16 22:47:28,913 INFO L226 Difference]: Without dead ends: 4372 [2021-10-16 22:47:28,914 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2097 ImplicationChecksByTransitivity, 1152.2ms TimeCoverageRelationStatistics Valid=1126, Invalid=5846, Unknown=0, NotChecked=0, Total=6972 [2021-10-16 22:47:28,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4372 states. [2021-10-16 22:47:28,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4372 to 2561. [2021-10-16 22:47:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2561 states, 2557 states have (on average 1.912788423934298) internal successors, (4891), 2560 states have internal predecessors, (4891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:28,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 4891 transitions. [2021-10-16 22:47:28,999 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 4891 transitions. Word has length 166 [2021-10-16 22:47:28,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:47:28,999 INFO L470 AbstractCegarLoop]: Abstraction has 2561 states and 4891 transitions. [2021-10-16 22:47:28,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:28,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 4891 transitions. [2021-10-16 22:47:29,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:47:29,001 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:47:29,001 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:47:29,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-16 22:47:29,002 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:47:29,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:47:29,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1095325373, now seen corresponding path program 12 times [2021-10-16 22:47:29,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:47:29,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20902469] [2021-10-16 22:47:29,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:47:29,003 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:47:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:47:29,477 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-16 22:47:29,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:47:29,477 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20902469] [2021-10-16 22:47:29,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20902469] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:47:29,477 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:47:29,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:47:29,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227440168] [2021-10-16 22:47:29,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:47:29,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:47:29,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:47:29,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:47:29,479 INFO L87 Difference]: Start difference. First operand 2561 states and 4891 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:47:31,971 INFO L93 Difference]: Finished difference Result 2893 states and 5507 transitions. [2021-10-16 22:47:31,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-10-16 22:47:31,972 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:47:31,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:47:31,975 INFO L225 Difference]: With dead ends: 2893 [2021-10-16 22:47:31,975 INFO L226 Difference]: Without dead ends: 2893 [2021-10-16 22:47:31,976 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 1628.4ms TimeCoverageRelationStatistics Valid=1515, Invalid=6675, Unknown=0, NotChecked=0, Total=8190 [2021-10-16 22:47:31,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2021-10-16 22:47:32,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 2567. [2021-10-16 22:47:32,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2567 states, 2563 states have (on average 1.9129925868123292) internal successors, (4903), 2566 states have internal predecessors, (4903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:32,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 4903 transitions. [2021-10-16 22:47:32,041 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 4903 transitions. Word has length 166 [2021-10-16 22:47:32,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:47:32,042 INFO L470 AbstractCegarLoop]: Abstraction has 2567 states and 4903 transitions. [2021-10-16 22:47:32,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 4903 transitions. [2021-10-16 22:47:32,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:47:32,060 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:47:32,060 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:47:32,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-16 22:47:32,061 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:47:32,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:47:32,061 INFO L82 PathProgramCache]: Analyzing trace with hash 839522563, now seen corresponding path program 13 times [2021-10-16 22:47:32,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:47:32,061 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014942421] [2021-10-16 22:47:32,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:47:32,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:47:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:47:32,479 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-16 22:47:32,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:47:32,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014942421] [2021-10-16 22:47:32,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014942421] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:47:32,480 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:47:32,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:47:32,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650053685] [2021-10-16 22:47:32,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:47:32,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:47:32,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:47:32,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:47:32,481 INFO L87 Difference]: Start difference. First operand 2567 states and 4903 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:34,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:47:34,620 INFO L93 Difference]: Finished difference Result 2959 states and 5635 transitions. [2021-10-16 22:47:34,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-10-16 22:47:34,621 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:47:34,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:47:34,624 INFO L225 Difference]: With dead ends: 2959 [2021-10-16 22:47:34,624 INFO L226 Difference]: Without dead ends: 2959 [2021-10-16 22:47:34,626 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2555 ImplicationChecksByTransitivity, 1358.2ms TimeCoverageRelationStatistics Valid=1477, Invalid=6713, Unknown=0, NotChecked=0, Total=8190 [2021-10-16 22:47:34,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2021-10-16 22:47:34,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 2561. [2021-10-16 22:47:34,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2561 states, 2557 states have (on average 1.912788423934298) internal successors, (4891), 2560 states have internal predecessors, (4891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:34,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 4891 transitions. [2021-10-16 22:47:34,690 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 4891 transitions. Word has length 166 [2021-10-16 22:47:34,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:47:34,691 INFO L470 AbstractCegarLoop]: Abstraction has 2561 states and 4891 transitions. [2021-10-16 22:47:34,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:34,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 4891 transitions. [2021-10-16 22:47:34,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:47:34,696 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:47:34,696 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:47:34,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-16 22:47:34,696 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:47:34,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:47:34,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1417423517, now seen corresponding path program 14 times [2021-10-16 22:47:34,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:47:34,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551540661] [2021-10-16 22:47:34,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:47:34,697 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:47:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:47:35,134 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-16 22:47:35,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:47:35,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551540661] [2021-10-16 22:47:35,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551540661] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:47:35,135 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:47:35,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:47:35,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622543165] [2021-10-16 22:47:35,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:47:35,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:47:35,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:47:35,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:47:35,136 INFO L87 Difference]: Start difference. First operand 2561 states and 4891 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:36,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:47:36,995 INFO L93 Difference]: Finished difference Result 4217 states and 8132 transitions. [2021-10-16 22:47:36,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-10-16 22:47:36,995 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:47:36,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:47:37,026 INFO L225 Difference]: With dead ends: 4217 [2021-10-16 22:47:37,026 INFO L226 Difference]: Without dead ends: 4217 [2021-10-16 22:47:37,034 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2251 ImplicationChecksByTransitivity, 1124.3ms TimeCoverageRelationStatistics Valid=1175, Invalid=6307, Unknown=0, NotChecked=0, Total=7482 [2021-10-16 22:47:37,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4217 states. [2021-10-16 22:47:37,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4217 to 2603. [2021-10-16 22:47:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2603 states, 2599 states have (on average 1.914197768372451) internal successors, (4975), 2602 states have internal predecessors, (4975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2603 states and 4975 transitions. [2021-10-16 22:47:37,077 INFO L78 Accepts]: Start accepts. Automaton has 2603 states and 4975 transitions. Word has length 166 [2021-10-16 22:47:37,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:47:37,077 INFO L470 AbstractCegarLoop]: Abstraction has 2603 states and 4975 transitions. [2021-10-16 22:47:37,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:37,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2603 states and 4975 transitions. [2021-10-16 22:47:37,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:47:37,101 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:47:37,101 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:47:37,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-16 22:47:37,101 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:47:37,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:47:37,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1161620707, now seen corresponding path program 15 times [2021-10-16 22:47:37,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:47:37,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365237810] [2021-10-16 22:47:37,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:47:37,102 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:47:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:47:37,639 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-16 22:47:37,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:47:37,640 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365237810] [2021-10-16 22:47:37,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365237810] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:47:37,640 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:47:37,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:47:37,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070290885] [2021-10-16 22:47:37,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:47:37,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:47:37,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:47:37,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:47:37,641 INFO L87 Difference]: Start difference. First operand 2603 states and 4975 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:40,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:47:40,477 INFO L93 Difference]: Finished difference Result 4293 states and 8280 transitions. [2021-10-16 22:47:40,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-10-16 22:47:40,482 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:47:40,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:47:40,487 INFO L225 Difference]: With dead ends: 4293 [2021-10-16 22:47:40,487 INFO L226 Difference]: Without dead ends: 4293 [2021-10-16 22:47:40,487 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2528 ImplicationChecksByTransitivity, 1738.2ms TimeCoverageRelationStatistics Valid=1271, Invalid=6919, Unknown=0, NotChecked=0, Total=8190 [2021-10-16 22:47:40,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4293 states. [2021-10-16 22:47:40,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4293 to 2597. [2021-10-16 22:47:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2597 states, 2593 states have (on average 1.913999228692634) internal successors, (4963), 2596 states have internal predecessors, (4963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:40,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 4963 transitions. [2021-10-16 22:47:40,518 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 4963 transitions. Word has length 166 [2021-10-16 22:47:40,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:47:40,518 INFO L470 AbstractCegarLoop]: Abstraction has 2597 states and 4963 transitions. [2021-10-16 22:47:40,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:40,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 4963 transitions. [2021-10-16 22:47:40,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:47:40,521 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:47:40,521 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:47:40,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-16 22:47:40,521 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:47:40,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:47:40,521 INFO L82 PathProgramCache]: Analyzing trace with hash 695513117, now seen corresponding path program 16 times [2021-10-16 22:47:40,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:47:40,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118281783] [2021-10-16 22:47:40,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:47:40,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:47:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:47:40,929 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-16 22:47:40,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:47:40,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118281783] [2021-10-16 22:47:40,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118281783] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:47:40,930 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:47:40,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:47:40,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450867582] [2021-10-16 22:47:40,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:47:40,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:47:40,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:47:40,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:47:40,931 INFO L87 Difference]: Start difference. First operand 2597 states and 4963 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:42,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:47:42,775 INFO L93 Difference]: Finished difference Result 4626 states and 8913 transitions. [2021-10-16 22:47:42,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-10-16 22:47:42,775 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:47:42,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:47:42,780 INFO L225 Difference]: With dead ends: 4626 [2021-10-16 22:47:42,781 INFO L226 Difference]: Without dead ends: 4626 [2021-10-16 22:47:42,781 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1660 ImplicationChecksByTransitivity, 966.8ms TimeCoverageRelationStatistics Valid=776, Invalid=5544, Unknown=0, NotChecked=0, Total=6320 [2021-10-16 22:47:42,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4626 states. [2021-10-16 22:47:42,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 2573. [2021-10-16 22:47:42,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2573 states, 2569 states have (on average 1.9131957960295836) internal successors, (4915), 2572 states have internal predecessors, (4915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:42,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2573 states and 4915 transitions. [2021-10-16 22:47:42,808 INFO L78 Accepts]: Start accepts. Automaton has 2573 states and 4915 transitions. Word has length 166 [2021-10-16 22:47:42,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:47:42,808 INFO L470 AbstractCegarLoop]: Abstraction has 2573 states and 4915 transitions. [2021-10-16 22:47:42,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 4915 transitions. [2021-10-16 22:47:42,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:47:42,810 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:47:42,810 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:47:42,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-16 22:47:42,810 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:47:42,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:47:42,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1120400611, now seen corresponding path program 17 times [2021-10-16 22:47:42,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:47:42,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559067314] [2021-10-16 22:47:42,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:47:42,811 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:47:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:47:43,261 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-16 22:47:43,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:47:43,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559067314] [2021-10-16 22:47:43,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559067314] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:47:43,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:47:43,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:47:43,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013710618] [2021-10-16 22:47:43,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:47:43,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:47:43,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:47:43,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:47:43,263 INFO L87 Difference]: Start difference. First operand 2573 states and 4915 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:47:45,453 INFO L93 Difference]: Finished difference Result 5097 states and 9792 transitions. [2021-10-16 22:47:45,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-10-16 22:47:45,453 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:47:45,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:47:45,458 INFO L225 Difference]: With dead ends: 5097 [2021-10-16 22:47:45,458 INFO L226 Difference]: Without dead ends: 5097 [2021-10-16 22:47:45,459 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1855 ImplicationChecksByTransitivity, 1276.5ms TimeCoverageRelationStatistics Valid=816, Invalid=5990, Unknown=0, NotChecked=0, Total=6806 [2021-10-16 22:47:45,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5097 states. [2021-10-16 22:47:45,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5097 to 2561. [2021-10-16 22:47:45,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2561 states, 2557 states have (on average 1.912788423934298) internal successors, (4891), 2560 states have internal predecessors, (4891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:45,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 4891 transitions. [2021-10-16 22:47:45,486 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 4891 transitions. Word has length 166 [2021-10-16 22:47:45,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:47:45,487 INFO L470 AbstractCegarLoop]: Abstraction has 2561 states and 4891 transitions. [2021-10-16 22:47:45,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:45,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 4891 transitions. [2021-10-16 22:47:45,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:47:45,488 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:47:45,488 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:47:45,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-16 22:47:45,489 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:47:45,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:47:45,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1796134911, now seen corresponding path program 18 times [2021-10-16 22:47:45,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:47:45,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508929221] [2021-10-16 22:47:45,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:47:45,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:47:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:47:45,991 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-16 22:47:45,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:47:45,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508929221] [2021-10-16 22:47:45,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508929221] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:47:45,991 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:47:45,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:47:45,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892298334] [2021-10-16 22:47:45,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:47:45,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:47:45,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:47:45,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:47:45,992 INFO L87 Difference]: Start difference. First operand 2561 states and 4891 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:47,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:47:47,798 INFO L93 Difference]: Finished difference Result 4249 states and 8196 transitions. [2021-10-16 22:47:47,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-10-16 22:47:47,799 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:47:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:47:47,803 INFO L225 Difference]: With dead ends: 4249 [2021-10-16 22:47:47,803 INFO L226 Difference]: Without dead ends: 4249 [2021-10-16 22:47:47,804 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2218 ImplicationChecksByTransitivity, 1199.2ms TimeCoverageRelationStatistics Valid=1146, Invalid=6336, Unknown=0, NotChecked=0, Total=7482 [2021-10-16 22:47:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4249 states. [2021-10-16 22:47:47,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4249 to 2615. [2021-10-16 22:47:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2615 states, 2611 states have (on average 1.914592110302566) internal successors, (4999), 2614 states have internal predecessors, (4999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:47,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2615 states and 4999 transitions. [2021-10-16 22:47:47,849 INFO L78 Accepts]: Start accepts. Automaton has 2615 states and 4999 transitions. Word has length 166 [2021-10-16 22:47:47,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:47:47,849 INFO L470 AbstractCegarLoop]: Abstraction has 2615 states and 4999 transitions. [2021-10-16 22:47:47,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:47,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 4999 transitions. [2021-10-16 22:47:47,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:47:47,862 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:47:47,862 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:47:47,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-16 22:47:47,863 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:47:47,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:47:47,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1540332101, now seen corresponding path program 19 times [2021-10-16 22:47:47,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:47:47,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149008109] [2021-10-16 22:47:47,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:47:47,864 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:47:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:47:48,274 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-16 22:47:48,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:47:48,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149008109] [2021-10-16 22:47:48,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149008109] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:47:48,274 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:47:48,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:47:48,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830208287] [2021-10-16 22:47:48,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:47:48,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:47:48,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:47:48,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:47:48,275 INFO L87 Difference]: Start difference. First operand 2615 states and 4999 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:47:50,562 INFO L93 Difference]: Finished difference Result 4325 states and 8344 transitions. [2021-10-16 22:47:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-10-16 22:47:50,563 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:47:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:47:50,567 INFO L225 Difference]: With dead ends: 4325 [2021-10-16 22:47:50,567 INFO L226 Difference]: Without dead ends: 4325 [2021-10-16 22:47:50,568 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2494 ImplicationChecksByTransitivity, 1302.4ms TimeCoverageRelationStatistics Valid=1231, Invalid=6959, Unknown=0, NotChecked=0, Total=8190 [2021-10-16 22:47:50,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4325 states. [2021-10-16 22:47:50,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4325 to 2609. [2021-10-16 22:47:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2609 states, 2605 states have (on average 1.9143953934740883) internal successors, (4987), 2608 states have internal predecessors, (4987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:50,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 4987 transitions. [2021-10-16 22:47:50,595 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 4987 transitions. Word has length 166 [2021-10-16 22:47:50,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:47:50,595 INFO L470 AbstractCegarLoop]: Abstraction has 2609 states and 4987 transitions. [2021-10-16 22:47:50,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:50,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 4987 transitions. [2021-10-16 22:47:50,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:47:50,597 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:47:50,598 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:47:50,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-16 22:47:50,599 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:47:50,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:47:50,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1074224511, now seen corresponding path program 20 times [2021-10-16 22:47:50,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:47:50,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343390787] [2021-10-16 22:47:50,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:47:50,600 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:47:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:47:51,144 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-16 22:47:51,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:47:51,144 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343390787] [2021-10-16 22:47:51,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343390787] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:47:51,144 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:47:51,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:47:51,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086169417] [2021-10-16 22:47:51,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:47:51,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:47:51,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:47:51,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:47:51,145 INFO L87 Difference]: Start difference. First operand 2609 states and 4987 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:53,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:47:53,951 INFO L93 Difference]: Finished difference Result 4658 states and 8977 transitions. [2021-10-16 22:47:53,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-10-16 22:47:53,952 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:47:53,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:47:53,956 INFO L225 Difference]: With dead ends: 4658 [2021-10-16 22:47:53,956 INFO L226 Difference]: Without dead ends: 4658 [2021-10-16 22:47:53,956 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1654 ImplicationChecksByTransitivity, 1392.8ms TimeCoverageRelationStatistics Valid=811, Invalid=5509, Unknown=0, NotChecked=0, Total=6320 [2021-10-16 22:47:53,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4658 states. [2021-10-16 22:47:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4658 to 2585. [2021-10-16 22:47:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2585 states, 2581 states have (on average 1.9135993800852382) internal successors, (4939), 2584 states have internal predecessors, (4939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:53,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 4939 transitions. [2021-10-16 22:47:53,979 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 4939 transitions. Word has length 166 [2021-10-16 22:47:53,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:47:53,979 INFO L470 AbstractCegarLoop]: Abstraction has 2585 states and 4939 transitions. [2021-10-16 22:47:53,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:53,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 4939 transitions. [2021-10-16 22:47:53,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:47:53,980 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:47:53,980 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:47:53,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-16 22:47:53,981 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:47:53,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:47:53,981 INFO L82 PathProgramCache]: Analyzing trace with hash -741689217, now seen corresponding path program 21 times [2021-10-16 22:47:53,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:47:53,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123578693] [2021-10-16 22:47:53,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:47:53,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:47:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:47:54,455 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-16 22:47:54,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:47:54,455 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123578693] [2021-10-16 22:47:54,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123578693] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:47:54,455 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:47:54,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:47:54,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436566861] [2021-10-16 22:47:54,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:47:54,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:47:54,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:47:54,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:47:54,456 INFO L87 Difference]: Start difference. First operand 2585 states and 4939 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:56,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:47:56,650 INFO L93 Difference]: Finished difference Result 5649 states and 10886 transitions. [2021-10-16 22:47:56,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-10-16 22:47:56,650 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:47:56,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:47:56,655 INFO L225 Difference]: With dead ends: 5649 [2021-10-16 22:47:56,655 INFO L226 Difference]: Without dead ends: 5649 [2021-10-16 22:47:56,656 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2287 ImplicationChecksByTransitivity, 1230.0ms TimeCoverageRelationStatistics Valid=955, Invalid=7055, Unknown=0, NotChecked=0, Total=8010 [2021-10-16 22:47:56,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5649 states. [2021-10-16 22:47:56,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5649 to 2573. [2021-10-16 22:47:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2573 states, 2569 states have (on average 1.9131957960295836) internal successors, (4915), 2572 states have internal predecessors, (4915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2573 states and 4915 transitions. [2021-10-16 22:47:56,685 INFO L78 Accepts]: Start accepts. Automaton has 2573 states and 4915 transitions. Word has length 166 [2021-10-16 22:47:56,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:47:56,685 INFO L470 AbstractCegarLoop]: Abstraction has 2573 states and 4915 transitions. [2021-10-16 22:47:56,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 4915 transitions. [2021-10-16 22:47:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:47:56,687 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:47:56,687 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:47:56,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-16 22:47:56,687 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:47:56,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:47:56,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1148554751, now seen corresponding path program 22 times [2021-10-16 22:47:56,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:47:56,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658396738] [2021-10-16 22:47:56,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:47:56,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:47:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:47:57,141 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-16 22:47:57,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:47:57,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658396738] [2021-10-16 22:47:57,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658396738] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:47:57,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:47:57,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:47:57,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882469717] [2021-10-16 22:47:57,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:47:57,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:47:57,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:47:57,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:47:57,142 INFO L87 Difference]: Start difference. First operand 2573 states and 4915 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:58,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:47:58,970 INFO L93 Difference]: Finished difference Result 5185 states and 9964 transitions. [2021-10-16 22:47:58,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-10-16 22:47:58,970 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:47:58,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:47:58,975 INFO L225 Difference]: With dead ends: 5185 [2021-10-16 22:47:58,975 INFO L226 Difference]: Without dead ends: 5185 [2021-10-16 22:47:58,976 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2181 ImplicationChecksByTransitivity, 1156.3ms TimeCoverageRelationStatistics Valid=934, Invalid=6722, Unknown=0, NotChecked=0, Total=7656 [2021-10-16 22:47:58,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5185 states. [2021-10-16 22:47:59,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5185 to 2561. [2021-10-16 22:47:59,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2561 states, 2557 states have (on average 1.912788423934298) internal successors, (4891), 2560 states have internal predecessors, (4891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 4891 transitions. [2021-10-16 22:47:59,004 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 4891 transitions. Word has length 166 [2021-10-16 22:47:59,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:47:59,004 INFO L470 AbstractCegarLoop]: Abstraction has 2561 states and 4891 transitions. [2021-10-16 22:47:59,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:47:59,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 4891 transitions. [2021-10-16 22:47:59,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:47:59,005 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:47:59,006 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:47:59,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-16 22:47:59,006 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:47:59,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:47:59,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1846723487, now seen corresponding path program 23 times [2021-10-16 22:47:59,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:47:59,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630200825] [2021-10-16 22:47:59,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:47:59,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:47:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:47:59,447 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-16 22:47:59,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:47:59,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630200825] [2021-10-16 22:47:59,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630200825] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:47:59,448 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:47:59,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:47:59,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259868418] [2021-10-16 22:47:59,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:47:59,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:47:59,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:47:59,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:47:59,450 INFO L87 Difference]: Start difference. First operand 2561 states and 4891 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:01,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:01,225 INFO L93 Difference]: Finished difference Result 3539 states and 6832 transitions. [2021-10-16 22:48:01,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-10-16 22:48:01,226 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:48:01,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:01,230 INFO L225 Difference]: With dead ends: 3539 [2021-10-16 22:48:01,230 INFO L226 Difference]: Without dead ends: 3539 [2021-10-16 22:48:01,232 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1460 ImplicationChecksByTransitivity, 1155.1ms TimeCoverageRelationStatistics Valid=883, Invalid=4667, Unknown=0, NotChecked=0, Total=5550 [2021-10-16 22:48:01,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3539 states. [2021-10-16 22:48:01,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3539 to 2543. [2021-10-16 22:48:01,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2543 states, 2539 states have (on average 1.912170145726664) internal successors, (4855), 2542 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-16 22:48:01,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 4855 transitions. [2021-10-16 22:48:01,258 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 4855 transitions. Word has length 166 [2021-10-16 22:48:01,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:01,258 INFO L470 AbstractCegarLoop]: Abstraction has 2543 states and 4855 transitions. [2021-10-16 22:48:01,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:01,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 4855 transitions. [2021-10-16 22:48:01,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:48:01,260 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:01,260 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:01,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-16 22:48:01,260 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:01,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:01,260 INFO L82 PathProgramCache]: Analyzing trace with hash -2102526297, now seen corresponding path program 24 times [2021-10-16 22:48:01,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:01,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616812026] [2021-10-16 22:48:01,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:01,261 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:01,655 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-16 22:48:01,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:01,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616812026] [2021-10-16 22:48:01,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616812026] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:01,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:01,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:01,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957829306] [2021-10-16 22:48:01,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:01,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:01,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:01,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:01,657 INFO L87 Difference]: Start difference. First operand 2543 states and 4855 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:03,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:03,320 INFO L93 Difference]: Finished difference Result 3615 states and 6980 transitions. [2021-10-16 22:48:03,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-10-16 22:48:03,320 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:48:03,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:03,324 INFO L225 Difference]: With dead ends: 3615 [2021-10-16 22:48:03,324 INFO L226 Difference]: Without dead ends: 3615 [2021-10-16 22:48:03,325 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 998.4ms TimeCoverageRelationStatistics Valid=939, Invalid=5067, Unknown=0, NotChecked=0, Total=6006 [2021-10-16 22:48:03,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2021-10-16 22:48:03,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 2537. [2021-10-16 22:48:03,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 2533 states have (on average 1.911962100276352) internal successors, (4843), 2536 states have internal predecessors, (4843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:03,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 4843 transitions. [2021-10-16 22:48:03,347 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 4843 transitions. Word has length 166 [2021-10-16 22:48:03,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:03,347 INFO L470 AbstractCegarLoop]: Abstraction has 2537 states and 4843 transitions. [2021-10-16 22:48:03,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:03,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 4843 transitions. [2021-10-16 22:48:03,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:48:03,349 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:03,349 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:03,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-16 22:48:03,349 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:03,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:03,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1726333409, now seen corresponding path program 25 times [2021-10-16 22:48:03,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:03,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57446132] [2021-10-16 22:48:03,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:03,350 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:03,727 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-16 22:48:03,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:03,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57446132] [2021-10-16 22:48:03,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57446132] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:03,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:03,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:03,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074684948] [2021-10-16 22:48:03,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:03,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:03,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:03,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:03,728 INFO L87 Difference]: Start difference. First operand 2537 states and 4843 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:05,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:05,245 INFO L93 Difference]: Finished difference Result 4120 states and 7914 transitions. [2021-10-16 22:48:05,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-10-16 22:48:05,245 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:48:05,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:05,249 INFO L225 Difference]: With dead ends: 4120 [2021-10-16 22:48:05,249 INFO L226 Difference]: Without dead ends: 4120 [2021-10-16 22:48:05,250 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 807.3ms TimeCoverageRelationStatistics Valid=638, Invalid=4054, Unknown=0, NotChecked=0, Total=4692 [2021-10-16 22:48:05,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4120 states. [2021-10-16 22:48:05,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4120 to 2513. [2021-10-16 22:48:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2509 states have (on average 1.9111199681147868) internal successors, (4795), 2512 states have internal predecessors, (4795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:05,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 4795 transitions. [2021-10-16 22:48:05,275 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 4795 transitions. Word has length 166 [2021-10-16 22:48:05,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:05,276 INFO L470 AbstractCegarLoop]: Abstraction has 2513 states and 4795 transitions. [2021-10-16 22:48:05,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:05,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 4795 transitions. [2021-10-16 22:48:05,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:48:05,277 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:05,277 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:05,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-16 22:48:05,278 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:05,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:05,278 INFO L82 PathProgramCache]: Analyzing trace with hash -89580319, now seen corresponding path program 26 times [2021-10-16 22:48:05,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:05,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969361946] [2021-10-16 22:48:05,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:05,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:05,756 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-16 22:48:05,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:05,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969361946] [2021-10-16 22:48:05,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969361946] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:05,757 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:05,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:05,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485474300] [2021-10-16 22:48:05,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:05,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:05,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:05,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:05,757 INFO L87 Difference]: Start difference. First operand 2513 states and 4795 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:07,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:07,321 INFO L93 Difference]: Finished difference Result 5111 states and 9823 transitions. [2021-10-16 22:48:07,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-10-16 22:48:07,321 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:48:07,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:07,326 INFO L225 Difference]: With dead ends: 5111 [2021-10-16 22:48:07,326 INFO L226 Difference]: Without dead ends: 5111 [2021-10-16 22:48:07,327 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 983.5ms TimeCoverageRelationStatistics Valid=754, Invalid=5098, Unknown=0, NotChecked=0, Total=5852 [2021-10-16 22:48:07,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5111 states. [2021-10-16 22:48:07,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5111 to 2501. [2021-10-16 22:48:07,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2497 states have (on average 1.9106928313976772) internal successors, (4771), 2500 states have internal predecessors, (4771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 4771 transitions. [2021-10-16 22:48:07,354 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 4771 transitions. Word has length 166 [2021-10-16 22:48:07,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:07,355 INFO L470 AbstractCegarLoop]: Abstraction has 2501 states and 4771 transitions. [2021-10-16 22:48:07,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:07,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 4771 transitions. [2021-10-16 22:48:07,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:48:07,356 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:07,356 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:07,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-16 22:48:07,356 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:07,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:07,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1800663649, now seen corresponding path program 27 times [2021-10-16 22:48:07,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:07,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779161475] [2021-10-16 22:48:07,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:07,357 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:07,831 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-16 22:48:07,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:07,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779161475] [2021-10-16 22:48:07,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779161475] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:07,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:07,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:07,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735405533] [2021-10-16 22:48:07,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:07,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:07,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:07,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:07,832 INFO L87 Difference]: Start difference. First operand 2501 states and 4771 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:10,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:10,346 INFO L93 Difference]: Finished difference Result 5187 states and 9971 transitions. [2021-10-16 22:48:10,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-10-16 22:48:10,346 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:48:10,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:10,352 INFO L225 Difference]: With dead ends: 5187 [2021-10-16 22:48:10,352 INFO L226 Difference]: Without dead ends: 5187 [2021-10-16 22:48:10,352 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1862 ImplicationChecksByTransitivity, 1394.5ms TimeCoverageRelationStatistics Valid=862, Invalid=5944, Unknown=0, NotChecked=0, Total=6806 [2021-10-16 22:48:10,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5187 states. [2021-10-16 22:48:10,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5187 to 2489. [2021-10-16 22:48:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2489 states, 2485 states have (on average 1.910261569416499) internal successors, (4747), 2488 states have internal predecessors, (4747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:10,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 4747 transitions. [2021-10-16 22:48:10,381 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 4747 transitions. Word has length 166 [2021-10-16 22:48:10,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:10,381 INFO L470 AbstractCegarLoop]: Abstraction has 2489 states and 4747 transitions. [2021-10-16 22:48:10,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 4747 transitions. [2021-10-16 22:48:10,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-16 22:48:10,383 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:10,383 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:10,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-16 22:48:10,383 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:10,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:10,385 INFO L82 PathProgramCache]: Analyzing trace with hash -31836191, now seen corresponding path program 28 times [2021-10-16 22:48:10,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:10,385 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464005081] [2021-10-16 22:48:10,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:10,385 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:10,767 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-16 22:48:10,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:10,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464005081] [2021-10-16 22:48:10,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464005081] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:10,767 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:10,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:10,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794576751] [2021-10-16 22:48:10,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:10,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:10,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:10,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:10,768 INFO L87 Difference]: Start difference. First operand 2489 states and 4747 transitions. Second operand has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:12,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:12,384 INFO L93 Difference]: Finished difference Result 3564 states and 6814 transitions. [2021-10-16 22:48:12,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-10-16 22:48:12,385 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2021-10-16 22:48:12,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:12,388 INFO L225 Difference]: With dead ends: 3564 [2021-10-16 22:48:12,388 INFO L226 Difference]: Without dead ends: 3564 [2021-10-16 22:48:12,389 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1548 ImplicationChecksByTransitivity, 951.5ms TimeCoverageRelationStatistics Valid=836, Invalid=5016, Unknown=0, NotChecked=0, Total=5852 [2021-10-16 22:48:12,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2021-10-16 22:48:12,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 2293. [2021-10-16 22:48:12,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2293 states, 2290 states have (on average 1.9039301310043668) internal successors, (4360), 2292 states have internal predecessors, (4360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:12,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 4360 transitions. [2021-10-16 22:48:12,408 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 4360 transitions. Word has length 166 [2021-10-16 22:48:12,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:12,408 INFO L470 AbstractCegarLoop]: Abstraction has 2293 states and 4360 transitions. [2021-10-16 22:48:12,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.916666666666667) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:12,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 4360 transitions. [2021-10-16 22:48:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:48:12,410 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:12,410 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:12,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-16 22:48:12,410 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:12,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:12,410 INFO L82 PathProgramCache]: Analyzing trace with hash 2119837204, now seen corresponding path program 1 times [2021-10-16 22:48:12,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:12,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003541911] [2021-10-16 22:48:12,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:12,411 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:12,795 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-16 22:48:12,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:12,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003541911] [2021-10-16 22:48:12,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003541911] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:12,795 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:12,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:12,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356473787] [2021-10-16 22:48:12,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:12,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:12,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:12,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:12,797 INFO L87 Difference]: Start difference. First operand 2293 states and 4360 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:14,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:14,923 INFO L93 Difference]: Finished difference Result 4851 states and 9314 transitions. [2021-10-16 22:48:14,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-10-16 22:48:14,923 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:48:14,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:14,929 INFO L225 Difference]: With dead ends: 4851 [2021-10-16 22:48:14,929 INFO L226 Difference]: Without dead ends: 4851 [2021-10-16 22:48:14,929 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1902 ImplicationChecksByTransitivity, 1331.0ms TimeCoverageRelationStatistics Valid=1052, Invalid=5920, Unknown=0, NotChecked=0, Total=6972 [2021-10-16 22:48:14,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4851 states. [2021-10-16 22:48:14,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4851 to 2419. [2021-10-16 22:48:14,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2419 states, 2416 states have (on average 1.9089403973509933) internal successors, (4612), 2418 states have internal predecessors, (4612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:14,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 4612 transitions. [2021-10-16 22:48:14,960 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 4612 transitions. Word has length 174 [2021-10-16 22:48:14,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:14,960 INFO L470 AbstractCegarLoop]: Abstraction has 2419 states and 4612 transitions. [2021-10-16 22:48:14,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:14,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 4612 transitions. [2021-10-16 22:48:14,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:48:14,962 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:14,962 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:14,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-16 22:48:14,962 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:14,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:14,962 INFO L82 PathProgramCache]: Analyzing trace with hash -2117931372, now seen corresponding path program 2 times [2021-10-16 22:48:14,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:14,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020021719] [2021-10-16 22:48:14,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:14,962 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:15,296 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-16 22:48:15,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:15,296 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020021719] [2021-10-16 22:48:15,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020021719] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:15,296 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:15,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:15,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077841414] [2021-10-16 22:48:15,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:15,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:15,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:15,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:15,297 INFO L87 Difference]: Start difference. First operand 2419 states and 4612 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:17,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:17,120 INFO L93 Difference]: Finished difference Result 3867 states and 7424 transitions. [2021-10-16 22:48:17,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-10-16 22:48:17,120 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:48:17,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:17,124 INFO L225 Difference]: With dead ends: 3867 [2021-10-16 22:48:17,124 INFO L226 Difference]: Without dead ends: 3867 [2021-10-16 22:48:17,125 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 967.6ms TimeCoverageRelationStatistics Valid=780, Invalid=4050, Unknown=0, NotChecked=0, Total=4830 [2021-10-16 22:48:17,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3867 states. [2021-10-16 22:48:17,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3867 to 2497. [2021-10-16 22:48:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2497 states, 2494 states have (on average 1.9117882919005613) internal successors, (4768), 2496 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2497 states to 2497 states and 4768 transitions. [2021-10-16 22:48:17,149 INFO L78 Accepts]: Start accepts. Automaton has 2497 states and 4768 transitions. Word has length 174 [2021-10-16 22:48:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:17,149 INFO L470 AbstractCegarLoop]: Abstraction has 2497 states and 4768 transitions. [2021-10-16 22:48:17,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:17,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2497 states and 4768 transitions. [2021-10-16 22:48:17,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:48:17,151 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:17,151 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:17,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-16 22:48:17,152 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:17,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:17,152 INFO L82 PathProgramCache]: Analyzing trace with hash -18659158, now seen corresponding path program 3 times [2021-10-16 22:48:17,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:17,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2433627] [2021-10-16 22:48:17,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:17,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:17,785 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-16 22:48:17,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:17,785 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2433627] [2021-10-16 22:48:17,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2433627] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:17,785 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:17,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:17,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637800805] [2021-10-16 22:48:17,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:17,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:17,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:17,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:17,786 INFO L87 Difference]: Start difference. First operand 2497 states and 4768 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:19,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:19,770 INFO L93 Difference]: Finished difference Result 4447 states and 8635 transitions. [2021-10-16 22:48:19,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-16 22:48:19,770 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:48:19,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:19,775 INFO L225 Difference]: With dead ends: 4447 [2021-10-16 22:48:19,775 INFO L226 Difference]: Without dead ends: 4447 [2021-10-16 22:48:19,775 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1231.7ms TimeCoverageRelationStatistics Valid=533, Invalid=2329, Unknown=0, NotChecked=0, Total=2862 [2021-10-16 22:48:19,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4447 states. [2021-10-16 22:48:19,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4447 to 2605. [2021-10-16 22:48:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2605 states, 2602 states have (on average 1.9154496541122215) internal successors, (4984), 2604 states have internal predecessors, (4984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:19,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 4984 transitions. [2021-10-16 22:48:19,802 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 4984 transitions. Word has length 174 [2021-10-16 22:48:19,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:19,802 INFO L470 AbstractCegarLoop]: Abstraction has 2605 states and 4984 transitions. [2021-10-16 22:48:19,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:19,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 4984 transitions. [2021-10-16 22:48:19,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:48:19,804 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:19,804 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:19,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-16 22:48:19,805 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:19,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:19,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1571275592, now seen corresponding path program 4 times [2021-10-16 22:48:19,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:19,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870872646] [2021-10-16 22:48:19,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:19,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:20,405 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-16 22:48:20,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:20,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870872646] [2021-10-16 22:48:20,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870872646] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:20,405 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:20,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:20,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335409057] [2021-10-16 22:48:20,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:20,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:20,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:20,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:20,406 INFO L87 Difference]: Start difference. First operand 2605 states and 4984 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:22,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:22,604 INFO L93 Difference]: Finished difference Result 4484 states and 8707 transitions. [2021-10-16 22:48:22,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-10-16 22:48:22,604 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:48:22,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:22,608 INFO L225 Difference]: With dead ends: 4484 [2021-10-16 22:48:22,609 INFO L226 Difference]: Without dead ends: 4484 [2021-10-16 22:48:22,611 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 1353.6ms TimeCoverageRelationStatistics Valid=593, Invalid=2599, Unknown=0, NotChecked=0, Total=3192 [2021-10-16 22:48:22,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4484 states. [2021-10-16 22:48:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4484 to 2604. [2021-10-16 22:48:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2604 states, 2601 states have (on average 1.9154171472510573) internal successors, (4982), 2603 states have internal predecessors, (4982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:22,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2604 states to 2604 states and 4982 transitions. [2021-10-16 22:48:22,634 INFO L78 Accepts]: Start accepts. Automaton has 2604 states and 4982 transitions. Word has length 174 [2021-10-16 22:48:22,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:22,634 INFO L470 AbstractCegarLoop]: Abstraction has 2604 states and 4982 transitions. [2021-10-16 22:48:22,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:22,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2604 states and 4982 transitions. [2021-10-16 22:48:22,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:48:22,636 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:22,637 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:22,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-16 22:48:22,637 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:22,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:22,637 INFO L82 PathProgramCache]: Analyzing trace with hash 2014174732, now seen corresponding path program 5 times [2021-10-16 22:48:22,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:22,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880438661] [2021-10-16 22:48:22,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:22,637 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:23,211 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-16 22:48:23,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:23,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880438661] [2021-10-16 22:48:23,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880438661] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:23,212 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:23,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:23,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623965826] [2021-10-16 22:48:23,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:23,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:23,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:23,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:23,213 INFO L87 Difference]: Start difference. First operand 2604 states and 4982 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:25,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:25,382 INFO L93 Difference]: Finished difference Result 4549 states and 8833 transitions. [2021-10-16 22:48:25,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-10-16 22:48:25,383 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:48:25,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:25,388 INFO L225 Difference]: With dead ends: 4549 [2021-10-16 22:48:25,388 INFO L226 Difference]: Without dead ends: 4549 [2021-10-16 22:48:25,389 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 1396.0ms TimeCoverageRelationStatistics Valid=628, Invalid=2794, Unknown=0, NotChecked=0, Total=3422 [2021-10-16 22:48:25,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4549 states. [2021-10-16 22:48:25,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4549 to 2603. [2021-10-16 22:48:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2603 states, 2600 states have (on average 1.9153846153846155) internal successors, (4980), 2602 states have internal predecessors, (4980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:25,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2603 states and 4980 transitions. [2021-10-16 22:48:25,414 INFO L78 Accepts]: Start accepts. Automaton has 2603 states and 4980 transitions. Word has length 174 [2021-10-16 22:48:25,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:25,414 INFO L470 AbstractCegarLoop]: Abstraction has 2603 states and 4980 transitions. [2021-10-16 22:48:25,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2603 states and 4980 transitions. [2021-10-16 22:48:25,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:48:25,417 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:25,417 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:25,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-16 22:48:25,417 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:25,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:25,417 INFO L82 PathProgramCache]: Analyzing trace with hash 490212966, now seen corresponding path program 6 times [2021-10-16 22:48:25,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:25,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063064525] [2021-10-16 22:48:25,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:25,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:25,949 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-16 22:48:25,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:25,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063064525] [2021-10-16 22:48:25,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063064525] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:25,949 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:25,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:25,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529129077] [2021-10-16 22:48:25,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:25,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:25,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:25,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:25,950 INFO L87 Difference]: Start difference. First operand 2603 states and 4980 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:27,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:27,847 INFO L93 Difference]: Finished difference Result 4537 states and 8806 transitions. [2021-10-16 22:48:27,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-10-16 22:48:27,847 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:48:27,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:27,852 INFO L225 Difference]: With dead ends: 4537 [2021-10-16 22:48:27,852 INFO L226 Difference]: Without dead ends: 4537 [2021-10-16 22:48:27,853 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 1155.5ms TimeCoverageRelationStatistics Valid=672, Invalid=2988, Unknown=0, NotChecked=0, Total=3660 [2021-10-16 22:48:27,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4537 states. [2021-10-16 22:48:27,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4537 to 2602. [2021-10-16 22:48:27,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2602 states, 2599 states have (on average 1.9153520584840322) internal successors, (4978), 2601 states have internal predecessors, (4978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:27,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 4978 transitions. [2021-10-16 22:48:27,880 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 4978 transitions. Word has length 174 [2021-10-16 22:48:27,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:27,880 INFO L470 AbstractCegarLoop]: Abstraction has 2602 states and 4978 transitions. [2021-10-16 22:48:27,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:27,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 4978 transitions. [2021-10-16 22:48:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:48:27,882 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:27,882 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:27,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-16 22:48:27,882 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:27,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:27,882 INFO L82 PathProgramCache]: Analyzing trace with hash 121574632, now seen corresponding path program 7 times [2021-10-16 22:48:27,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:27,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359671883] [2021-10-16 22:48:27,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:27,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:28,331 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-16 22:48:28,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:28,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359671883] [2021-10-16 22:48:28,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359671883] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:28,332 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:28,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:28,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920029074] [2021-10-16 22:48:28,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:28,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:28,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:28,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:28,333 INFO L87 Difference]: Start difference. First operand 2602 states and 4978 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:30,531 INFO L93 Difference]: Finished difference Result 3289 states and 6301 transitions. [2021-10-16 22:48:30,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-10-16 22:48:30,531 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:48:30,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:30,534 INFO L225 Difference]: With dead ends: 3289 [2021-10-16 22:48:30,534 INFO L226 Difference]: Without dead ends: 3289 [2021-10-16 22:48:30,534 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1525 ImplicationChecksByTransitivity, 1266.1ms TimeCoverageRelationStatistics Valid=947, Invalid=4603, Unknown=0, NotChecked=0, Total=5550 [2021-10-16 22:48:30,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2021-10-16 22:48:30,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 2680. [2021-10-16 22:48:30,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2680 states, 2677 states have (on average 1.9178184534927156) internal successors, (5134), 2679 states have internal predecessors, (5134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:30,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 5134 transitions. [2021-10-16 22:48:30,578 INFO L78 Accepts]: Start accepts. Automaton has 2680 states and 5134 transitions. Word has length 174 [2021-10-16 22:48:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:30,578 INFO L470 AbstractCegarLoop]: Abstraction has 2680 states and 5134 transitions. [2021-10-16 22:48:30,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:30,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 5134 transitions. [2021-10-16 22:48:30,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:48:30,581 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:30,581 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:30,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-16 22:48:30,581 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:30,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:30,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1711509382, now seen corresponding path program 8 times [2021-10-16 22:48:30,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:30,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460506212] [2021-10-16 22:48:30,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:30,581 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:30,976 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-16 22:48:30,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:30,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460506212] [2021-10-16 22:48:30,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460506212] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:30,976 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:30,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:30,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057665571] [2021-10-16 22:48:30,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:30,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:30,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:30,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:30,977 INFO L87 Difference]: Start difference. First operand 2680 states and 5134 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:33,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:33,022 INFO L93 Difference]: Finished difference Result 3326 states and 6373 transitions. [2021-10-16 22:48:33,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-10-16 22:48:33,023 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:48:33,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:33,026 INFO L225 Difference]: With dead ends: 3326 [2021-10-16 22:48:33,026 INFO L226 Difference]: Without dead ends: 3326 [2021-10-16 22:48:33,026 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1185.1ms TimeCoverageRelationStatistics Valid=1033, Invalid=5129, Unknown=0, NotChecked=0, Total=6162 [2021-10-16 22:48:33,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2021-10-16 22:48:33,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 2674. [2021-10-16 22:48:33,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2671 states have (on average 1.917633845001872) internal successors, (5122), 2673 states have internal predecessors, (5122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:33,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 5122 transitions. [2021-10-16 22:48:33,049 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 5122 transitions. Word has length 174 [2021-10-16 22:48:33,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:33,050 INFO L470 AbstractCegarLoop]: Abstraction has 2674 states and 5122 transitions. [2021-10-16 22:48:33,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:33,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 5122 transitions. [2021-10-16 22:48:33,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:48:33,052 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:33,052 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:33,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-16 22:48:33,052 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:33,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:33,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2140558774, now seen corresponding path program 9 times [2021-10-16 22:48:33,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:33,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410151217] [2021-10-16 22:48:33,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:33,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:33,594 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-16 22:48:33,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:33,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410151217] [2021-10-16 22:48:33,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410151217] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:33,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:33,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:33,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489488639] [2021-10-16 22:48:33,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:33,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:33,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:33,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:33,595 INFO L87 Difference]: Start difference. First operand 2674 states and 5122 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:36,402 INFO L93 Difference]: Finished difference Result 3391 states and 6499 transitions. [2021-10-16 22:48:36,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-10-16 22:48:36,402 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:48:36,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:36,405 INFO L225 Difference]: With dead ends: 3391 [2021-10-16 22:48:36,405 INFO L226 Difference]: Without dead ends: 3391 [2021-10-16 22:48:36,406 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1863 ImplicationChecksByTransitivity, 1707.0ms TimeCoverageRelationStatistics Valid=1055, Invalid=5425, Unknown=0, NotChecked=0, Total=6480 [2021-10-16 22:48:36,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3391 states. [2021-10-16 22:48:36,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3391 to 2668. [2021-10-16 22:48:36,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2665 states have (on average 1.9174484052532832) internal successors, (5110), 2667 states have internal predecessors, (5110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:36,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 5110 transitions. [2021-10-16 22:48:36,427 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 5110 transitions. Word has length 174 [2021-10-16 22:48:36,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:36,428 INFO L470 AbstractCegarLoop]: Abstraction has 2668 states and 5110 transitions. [2021-10-16 22:48:36,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:36,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 5110 transitions. [2021-10-16 22:48:36,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:48:36,430 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:36,430 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:36,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-10-16 22:48:36,430 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:36,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:36,430 INFO L82 PathProgramCache]: Analyzing trace with hash 630446756, now seen corresponding path program 10 times [2021-10-16 22:48:36,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:36,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664416911] [2021-10-16 22:48:36,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:36,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 22:48:36,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:36,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664416911] [2021-10-16 22:48:36,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664416911] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:36,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:36,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:36,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204268813] [2021-10-16 22:48:36,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:36,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:36,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:36,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:36,827 INFO L87 Difference]: Start difference. First operand 2668 states and 5110 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:39,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:39,022 INFO L93 Difference]: Finished difference Result 3447 states and 6608 transitions. [2021-10-16 22:48:39,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-10-16 22:48:39,022 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:48:39,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:39,050 INFO L225 Difference]: With dead ends: 3447 [2021-10-16 22:48:39,051 INFO L226 Difference]: Without dead ends: 3447 [2021-10-16 22:48:39,051 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 1287.9ms TimeCoverageRelationStatistics Valid=1094, Invalid=5712, Unknown=0, NotChecked=0, Total=6806 [2021-10-16 22:48:39,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2021-10-16 22:48:39,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 2602. [2021-10-16 22:48:39,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2602 states, 2599 states have (on average 1.9153520584840322) internal successors, (4978), 2601 states have internal predecessors, (4978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:39,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 4978 transitions. [2021-10-16 22:48:39,075 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 4978 transitions. Word has length 174 [2021-10-16 22:48:39,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:39,075 INFO L470 AbstractCegarLoop]: Abstraction has 2602 states and 4978 transitions. [2021-10-16 22:48:39,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:39,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 4978 transitions. [2021-10-16 22:48:39,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:48:39,077 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:39,077 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:39,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-10-16 22:48:39,078 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:39,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:39,078 INFO L82 PathProgramCache]: Analyzing trace with hash -577590360, now seen corresponding path program 11 times [2021-10-16 22:48:39,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:39,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874673656] [2021-10-16 22:48:39,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:39,078 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:39,606 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-16 22:48:39,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:39,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874673656] [2021-10-16 22:48:39,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874673656] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:39,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:39,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:39,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092181205] [2021-10-16 22:48:39,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:39,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:39,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:39,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:39,607 INFO L87 Difference]: Start difference. First operand 2602 states and 4978 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:42,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:42,453 INFO L93 Difference]: Finished difference Result 4111 states and 7905 transitions. [2021-10-16 22:48:42,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-10-16 22:48:42,453 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:48:42,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:42,458 INFO L225 Difference]: With dead ends: 4111 [2021-10-16 22:48:42,458 INFO L226 Difference]: Without dead ends: 4111 [2021-10-16 22:48:42,459 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1495 ImplicationChecksByTransitivity, 1674.2ms TimeCoverageRelationStatistics Valid=1059, Invalid=4491, Unknown=0, NotChecked=0, Total=5550 [2021-10-16 22:48:42,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4111 states. [2021-10-16 22:48:42,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4111 to 2615. [2021-10-16 22:48:42,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2615 states, 2612 states have (on average 1.9157733537519142) internal successors, (5004), 2614 states have internal predecessors, (5004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:42,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2615 states and 5004 transitions. [2021-10-16 22:48:42,483 INFO L78 Accepts]: Start accepts. Automaton has 2615 states and 5004 transitions. Word has length 174 [2021-10-16 22:48:42,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:42,483 INFO L470 AbstractCegarLoop]: Abstraction has 2615 states and 5004 transitions. [2021-10-16 22:48:42,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:42,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 5004 transitions. [2021-10-16 22:48:42,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:48:42,485 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:42,485 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:42,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-16 22:48:42,486 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:42,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:42,486 INFO L82 PathProgramCache]: Analyzing trace with hash -520391640, now seen corresponding path program 12 times [2021-10-16 22:48:42,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:42,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036415426] [2021-10-16 22:48:42,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:42,487 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:42,909 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-16 22:48:42,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:42,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036415426] [2021-10-16 22:48:42,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036415426] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:42,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:42,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:42,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561587080] [2021-10-16 22:48:42,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:42,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:42,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:42,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:42,910 INFO L87 Difference]: Start difference. First operand 2615 states and 5004 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:44,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:44,873 INFO L93 Difference]: Finished difference Result 4311 states and 8267 transitions. [2021-10-16 22:48:44,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-10-16 22:48:44,874 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:48:44,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:44,878 INFO L225 Difference]: With dead ends: 4311 [2021-10-16 22:48:44,878 INFO L226 Difference]: Without dead ends: 4311 [2021-10-16 22:48:44,880 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 1109.8ms TimeCoverageRelationStatistics Valid=1126, Invalid=5846, Unknown=0, NotChecked=0, Total=6972 [2021-10-16 22:48:44,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4311 states. [2021-10-16 22:48:44,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4311 to 2447. [2021-10-16 22:48:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 2444 states have (on average 1.9099836333878888) internal successors, (4668), 2446 states have internal predecessors, (4668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:44,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 4668 transitions. [2021-10-16 22:48:44,955 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 4668 transitions. Word has length 174 [2021-10-16 22:48:44,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:44,955 INFO L470 AbstractCegarLoop]: Abstraction has 2447 states and 4668 transitions. [2021-10-16 22:48:44,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 4668 transitions. [2021-10-16 22:48:44,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:48:44,957 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:44,957 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:44,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-10-16 22:48:44,957 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:44,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:44,958 INFO L82 PathProgramCache]: Analyzing trace with hash -588525444, now seen corresponding path program 13 times [2021-10-16 22:48:44,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:44,958 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385845690] [2021-10-16 22:48:44,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:44,958 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:45,734 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-16 22:48:45,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:45,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385845690] [2021-10-16 22:48:45,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385845690] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:45,734 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:45,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:45,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298826835] [2021-10-16 22:48:45,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:45,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:45,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:45,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:45,735 INFO L87 Difference]: Start difference. First operand 2447 states and 4668 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:47,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:47,432 INFO L93 Difference]: Finished difference Result 2713 states and 5154 transitions. [2021-10-16 22:48:47,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-10-16 22:48:47,432 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:48:47,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:47,435 INFO L225 Difference]: With dead ends: 2713 [2021-10-16 22:48:47,435 INFO L226 Difference]: Without dead ends: 2713 [2021-10-16 22:48:47,436 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1611 ImplicationChecksByTransitivity, 1260.5ms TimeCoverageRelationStatistics Valid=1000, Invalid=4700, Unknown=0, NotChecked=0, Total=5700 [2021-10-16 22:48:47,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2021-10-16 22:48:47,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2447. [2021-10-16 22:48:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 2444 states have (on average 1.9099836333878888) internal successors, (4668), 2446 states have internal predecessors, (4668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 4668 transitions. [2021-10-16 22:48:47,475 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 4668 transitions. Word has length 174 [2021-10-16 22:48:47,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:47,476 INFO L470 AbstractCegarLoop]: Abstraction has 2447 states and 4668 transitions. [2021-10-16 22:48:47,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:47,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 4668 transitions. [2021-10-16 22:48:47,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:48:47,477 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:47,478 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:47,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-10-16 22:48:47,478 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:47,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:47,478 INFO L82 PathProgramCache]: Analyzing trace with hash 132996216, now seen corresponding path program 14 times [2021-10-16 22:48:47,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:47,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306083239] [2021-10-16 22:48:47,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:47,479 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:48,080 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-16 22:48:48,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:48,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306083239] [2021-10-16 22:48:48,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306083239] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:48,081 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:48,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:48,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403051410] [2021-10-16 22:48:48,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:48,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:48,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:48,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:48,082 INFO L87 Difference]: Start difference. First operand 2447 states and 4668 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:50,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:50,544 INFO L93 Difference]: Finished difference Result 2750 states and 5227 transitions. [2021-10-16 22:48:50,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-10-16 22:48:50,545 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:48:50,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:50,548 INFO L225 Difference]: With dead ends: 2750 [2021-10-16 22:48:50,548 INFO L226 Difference]: Without dead ends: 2750 [2021-10-16 22:48:50,548 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1781 ImplicationChecksByTransitivity, 1559.2ms TimeCoverageRelationStatistics Valid=1115, Invalid=5047, Unknown=0, NotChecked=0, Total=6162 [2021-10-16 22:48:50,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2021-10-16 22:48:50,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2453. [2021-10-16 22:48:50,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 2450 states have (on average 1.910204081632653) internal successors, (4680), 2452 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:50,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 4680 transitions. [2021-10-16 22:48:50,567 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 4680 transitions. Word has length 174 [2021-10-16 22:48:50,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:50,567 INFO L470 AbstractCegarLoop]: Abstraction has 2453 states and 4680 transitions. [2021-10-16 22:48:50,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:50,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 4680 transitions. [2021-10-16 22:48:50,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:48:50,569 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:50,569 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:50,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-10-16 22:48:50,569 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:50,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:50,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1226232706, now seen corresponding path program 15 times [2021-10-16 22:48:50,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:50,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225585459] [2021-10-16 22:48:50,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:50,570 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:51,175 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-16 22:48:51,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:51,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225585459] [2021-10-16 22:48:51,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225585459] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:51,175 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:51,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:51,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311553121] [2021-10-16 22:48:51,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:51,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:51,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:51,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:51,177 INFO L87 Difference]: Start difference. First operand 2453 states and 4680 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:52,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:52,940 INFO L93 Difference]: Finished difference Result 2757 states and 5240 transitions. [2021-10-16 22:48:52,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-10-16 22:48:52,940 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:48:52,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:52,943 INFO L225 Difference]: With dead ends: 2757 [2021-10-16 22:48:52,943 INFO L226 Difference]: Without dead ends: 2757 [2021-10-16 22:48:52,943 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1889 ImplicationChecksByTransitivity, 1179.7ms TimeCoverageRelationStatistics Valid=1156, Invalid=5324, Unknown=0, NotChecked=0, Total=6480 [2021-10-16 22:48:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2021-10-16 22:48:52,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2447. [2021-10-16 22:48:52,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 2444 states have (on average 1.9099836333878888) internal successors, (4668), 2446 states have internal predecessors, (4668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:52,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 4668 transitions. [2021-10-16 22:48:52,961 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 4668 transitions. Word has length 174 [2021-10-16 22:48:52,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:52,962 INFO L470 AbstractCegarLoop]: Abstraction has 2447 states and 4668 transitions. [2021-10-16 22:48:52,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:52,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 4668 transitions. [2021-10-16 22:48:52,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:48:52,963 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:52,963 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:52,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-10-16 22:48:52,964 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:52,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:52,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1405792226, now seen corresponding path program 16 times [2021-10-16 22:48:52,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:52,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838470296] [2021-10-16 22:48:52,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:52,964 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:53,425 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-16 22:48:53,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:53,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838470296] [2021-10-16 22:48:53,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838470296] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:53,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:53,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:53,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604376281] [2021-10-16 22:48:53,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:53,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:53,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:53,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:53,427 INFO L87 Difference]: Start difference. First operand 2447 states and 4668 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:55,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:55,226 INFO L93 Difference]: Finished difference Result 2754 states and 5236 transitions. [2021-10-16 22:48:55,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-10-16 22:48:55,227 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:48:55,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:55,229 INFO L225 Difference]: With dead ends: 2754 [2021-10-16 22:48:55,229 INFO L226 Difference]: Without dead ends: 2754 [2021-10-16 22:48:55,230 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1664 ImplicationChecksByTransitivity, 1158.8ms TimeCoverageRelationStatistics Valid=1046, Invalid=4806, Unknown=0, NotChecked=0, Total=5852 [2021-10-16 22:48:55,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2754 states. [2021-10-16 22:48:55,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2459. [2021-10-16 22:48:55,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 2456 states have (on average 1.9104234527687296) internal successors, (4692), 2458 states have internal predecessors, (4692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 4692 transitions. [2021-10-16 22:48:55,250 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 4692 transitions. Word has length 174 [2021-10-16 22:48:55,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:55,250 INFO L470 AbstractCegarLoop]: Abstraction has 2459 states and 4692 transitions. [2021-10-16 22:48:55,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:55,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 4692 transitions. [2021-10-16 22:48:55,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:48:55,253 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:55,253 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:55,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-10-16 22:48:55,253 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:55,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:55,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1529946148, now seen corresponding path program 17 times [2021-10-16 22:48:55,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:55,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523488107] [2021-10-16 22:48:55,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:55,254 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:55,656 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-16 22:48:55,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:55,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523488107] [2021-10-16 22:48:55,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523488107] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:55,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:55,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:55,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122529822] [2021-10-16 22:48:55,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:55,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:55,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:55,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:55,657 INFO L87 Difference]: Start difference. First operand 2459 states and 4692 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:48:57,916 INFO L93 Difference]: Finished difference Result 2792 states and 5310 transitions. [2021-10-16 22:48:57,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-10-16 22:48:57,916 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:48:57,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:48:57,919 INFO L225 Difference]: With dead ends: 2792 [2021-10-16 22:48:57,919 INFO L226 Difference]: Without dead ends: 2792 [2021-10-16 22:48:57,920 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1884 ImplicationChecksByTransitivity, 1387.1ms TimeCoverageRelationStatistics Valid=1155, Invalid=5325, Unknown=0, NotChecked=0, Total=6480 [2021-10-16 22:48:57,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2021-10-16 22:48:57,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2453. [2021-10-16 22:48:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 2450 states have (on average 1.910204081632653) internal successors, (4680), 2452 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 4680 transitions. [2021-10-16 22:48:57,952 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 4680 transitions. Word has length 174 [2021-10-16 22:48:57,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:48:57,952 INFO L470 AbstractCegarLoop]: Abstraction has 2453 states and 4680 transitions. [2021-10-16 22:48:57,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:48:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 4680 transitions. [2021-10-16 22:48:57,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:48:57,954 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:48:57,954 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:48:57,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-10-16 22:48:57,954 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:48:57,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:48:57,955 INFO L82 PathProgramCache]: Analyzing trace with hash 2029501854, now seen corresponding path program 18 times [2021-10-16 22:48:57,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:48:57,955 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557432502] [2021-10-16 22:48:57,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:48:57,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:48:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:48:58,760 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-16 22:48:58,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:48:58,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557432502] [2021-10-16 22:48:58,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557432502] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:48:58,761 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:48:58,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:48:58,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774806890] [2021-10-16 22:48:58,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:48:58,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:48:58,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:48:58,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:48:58,762 INFO L87 Difference]: Start difference. First operand 2453 states and 4680 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:01,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:49:01,630 INFO L93 Difference]: Finished difference Result 2801 states and 5326 transitions. [2021-10-16 22:49:01,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-10-16 22:49:01,630 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:49:01,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:49:01,633 INFO L225 Difference]: With dead ends: 2801 [2021-10-16 22:49:01,633 INFO L226 Difference]: Without dead ends: 2801 [2021-10-16 22:49:01,633 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1886 ImplicationChecksByTransitivity, 2073.6ms TimeCoverageRelationStatistics Valid=1123, Invalid=5357, Unknown=0, NotChecked=0, Total=6480 [2021-10-16 22:49:01,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2801 states. [2021-10-16 22:49:01,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2801 to 2447. [2021-10-16 22:49:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 2444 states have (on average 1.9099836333878888) internal successors, (4668), 2446 states have internal predecessors, (4668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:01,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 4668 transitions. [2021-10-16 22:49:01,651 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 4668 transitions. Word has length 174 [2021-10-16 22:49:01,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:49:01,651 INFO L470 AbstractCegarLoop]: Abstraction has 2447 states and 4668 transitions. [2021-10-16 22:49:01,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:01,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 4668 transitions. [2021-10-16 22:49:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:49:01,652 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:49:01,652 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:49:01,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-10-16 22:49:01,653 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:49:01,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:49:01,653 INFO L82 PathProgramCache]: Analyzing trace with hash 80991574, now seen corresponding path program 19 times [2021-10-16 22:49:01,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:49:01,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383256328] [2021-10-16 22:49:01,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:49:01,653 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:49:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:49:02,240 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-16 22:49:02,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:49:02,240 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383256328] [2021-10-16 22:49:02,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383256328] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:49:02,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:49:02,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:49:02,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062913120] [2021-10-16 22:49:02,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:49:02,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:49:02,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:49:02,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:49:02,241 INFO L87 Difference]: Start difference. First operand 2447 states and 4668 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:04,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:49:04,624 INFO L93 Difference]: Finished difference Result 2762 states and 5252 transitions. [2021-10-16 22:49:04,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-10-16 22:49:04,624 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:49:04,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:49:04,627 INFO L225 Difference]: With dead ends: 2762 [2021-10-16 22:49:04,627 INFO L226 Difference]: Without dead ends: 2762 [2021-10-16 22:49:04,627 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1547 ImplicationChecksByTransitivity, 1558.5ms TimeCoverageRelationStatistics Valid=980, Invalid=4570, Unknown=0, NotChecked=0, Total=5550 [2021-10-16 22:49:04,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2021-10-16 22:49:04,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2459. [2021-10-16 22:49:04,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 2456 states have (on average 1.9104234527687296) internal successors, (4692), 2458 states have internal predecessors, (4692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 4692 transitions. [2021-10-16 22:49:04,645 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 4692 transitions. Word has length 174 [2021-10-16 22:49:04,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:49:04,646 INFO L470 AbstractCegarLoop]: Abstraction has 2459 states and 4692 transitions. [2021-10-16 22:49:04,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:04,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 4692 transitions. [2021-10-16 22:49:04,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:49:04,647 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:49:04,647 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:49:04,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-10-16 22:49:04,647 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:49:04,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:49:04,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1278237348, now seen corresponding path program 20 times [2021-10-16 22:49:04,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:49:04,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074507773] [2021-10-16 22:49:04,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:49:04,648 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:49:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:49:05,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 22:49:05,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:49:05,215 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074507773] [2021-10-16 22:49:05,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074507773] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:49:05,215 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:49:05,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:49:05,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554054573] [2021-10-16 22:49:05,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:49:05,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:49:05,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:49:05,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:49:05,216 INFO L87 Difference]: Start difference. First operand 2459 states and 4692 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:07,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:49:07,205 INFO L93 Difference]: Finished difference Result 2800 states and 5326 transitions. [2021-10-16 22:49:07,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-10-16 22:49:07,205 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:49:07,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:49:07,208 INFO L225 Difference]: With dead ends: 2800 [2021-10-16 22:49:07,208 INFO L226 Difference]: Without dead ends: 2800 [2021-10-16 22:49:07,209 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1762 ImplicationChecksByTransitivity, 1368.7ms TimeCoverageRelationStatistics Valid=1077, Invalid=5085, Unknown=0, NotChecked=0, Total=6162 [2021-10-16 22:49:07,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2021-10-16 22:49:07,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 2453. [2021-10-16 22:49:07,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 2450 states have (on average 1.910204081632653) internal successors, (4680), 2452 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:07,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 4680 transitions. [2021-10-16 22:49:07,227 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 4680 transitions. Word has length 174 [2021-10-16 22:49:07,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:49:07,228 INFO L470 AbstractCegarLoop]: Abstraction has 2453 states and 4680 transitions. [2021-10-16 22:49:07,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:07,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 4680 transitions. [2021-10-16 22:49:07,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:49:07,229 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:49:07,229 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:49:07,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-10-16 22:49:07,229 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:49:07,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:49:07,230 INFO L82 PathProgramCache]: Analyzing trace with hash -778681642, now seen corresponding path program 21 times [2021-10-16 22:49:07,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:49:07,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374660068] [2021-10-16 22:49:07,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:49:07,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:49:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:49:07,940 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-16 22:49:07,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:49:07,940 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374660068] [2021-10-16 22:49:07,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374660068] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:49:07,941 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:49:07,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:49:07,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102803626] [2021-10-16 22:49:07,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:49:07,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:49:07,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:49:07,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:49:07,941 INFO L87 Difference]: Start difference. First operand 2453 states and 4680 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:49:11,638 INFO L93 Difference]: Finished difference Result 2833 states and 5390 transitions. [2021-10-16 22:49:11,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-10-16 22:49:11,638 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:49:11,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:49:11,641 INFO L225 Difference]: With dead ends: 2833 [2021-10-16 22:49:11,641 INFO L226 Difference]: Without dead ends: 2833 [2021-10-16 22:49:11,641 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1884 ImplicationChecksByTransitivity, 2450.2ms TimeCoverageRelationStatistics Valid=1110, Invalid=5370, Unknown=0, NotChecked=0, Total=6480 [2021-10-16 22:49:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2833 states. [2021-10-16 22:49:11,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2833 to 2447. [2021-10-16 22:49:11,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 2444 states have (on average 1.9099836333878888) internal successors, (4668), 2446 states have internal predecessors, (4668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 4668 transitions. [2021-10-16 22:49:11,661 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 4668 transitions. Word has length 174 [2021-10-16 22:49:11,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:49:11,661 INFO L470 AbstractCegarLoop]: Abstraction has 2447 states and 4668 transitions. [2021-10-16 22:49:11,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:11,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 4668 transitions. [2021-10-16 22:49:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:49:11,662 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:49:11,662 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:49:11,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-10-16 22:49:11,663 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:49:11,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:49:11,663 INFO L82 PathProgramCache]: Analyzing trace with hash 677937116, now seen corresponding path program 22 times [2021-10-16 22:49:11,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:49:11,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946330109] [2021-10-16 22:49:11,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:49:11,663 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:49:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:49:12,058 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-16 22:49:12,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:49:12,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946330109] [2021-10-16 22:49:12,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946330109] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:49:12,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:49:12,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:49:12,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200421680] [2021-10-16 22:49:12,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:49:12,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:49:12,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:49:12,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:49:12,060 INFO L87 Difference]: Start difference. First operand 2447 states and 4668 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:13,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:49:13,860 INFO L93 Difference]: Finished difference Result 2831 states and 5384 transitions. [2021-10-16 22:49:13,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-10-16 22:49:13,860 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:49:13,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:49:13,863 INFO L225 Difference]: With dead ends: 2831 [2021-10-16 22:49:13,863 INFO L226 Difference]: Without dead ends: 2831 [2021-10-16 22:49:13,864 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1887 ImplicationChecksByTransitivity, 1147.3ms TimeCoverageRelationStatistics Valid=1094, Invalid=5386, Unknown=0, NotChecked=0, Total=6480 [2021-10-16 22:49:13,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states. [2021-10-16 22:49:13,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2831 to 2430. [2021-10-16 22:49:13,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2430 states, 2427 states have (on average 1.9093531108364237) internal successors, (4634), 2429 states have internal predecessors, (4634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 4634 transitions. [2021-10-16 22:49:13,884 INFO L78 Accepts]: Start accepts. Automaton has 2430 states and 4634 transitions. Word has length 174 [2021-10-16 22:49:13,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:49:13,884 INFO L470 AbstractCegarLoop]: Abstraction has 2430 states and 4634 transitions. [2021-10-16 22:49:13,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:13,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 4634 transitions. [2021-10-16 22:49:13,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:49:13,885 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:49:13,885 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:49:13,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-10-16 22:49:13,885 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:49:13,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:49:13,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1733093706, now seen corresponding path program 23 times [2021-10-16 22:49:13,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:49:13,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912792782] [2021-10-16 22:49:13,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:49:13,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:49:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:49:14,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-16 22:49:14,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:49:14,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912792782] [2021-10-16 22:49:14,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912792782] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:49:14,260 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:49:14,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:49:14,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656598912] [2021-10-16 22:49:14,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:49:14,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:49:14,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:49:14,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:49:14,261 INFO L87 Difference]: Start difference. First operand 2430 states and 4634 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:16,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:49:16,094 INFO L93 Difference]: Finished difference Result 4034 states and 7777 transitions. [2021-10-16 22:49:16,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-10-16 22:49:16,094 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:49:16,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:49:16,098 INFO L225 Difference]: With dead ends: 4034 [2021-10-16 22:49:16,099 INFO L226 Difference]: Without dead ends: 4034 [2021-10-16 22:49:16,099 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1623 ImplicationChecksByTransitivity, 1038.0ms TimeCoverageRelationStatistics Valid=920, Invalid=4932, Unknown=0, NotChecked=0, Total=5852 [2021-10-16 22:49:16,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states. [2021-10-16 22:49:16,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 2518. [2021-10-16 22:49:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2515 states have (on average 1.9125248508946322) internal successors, (4810), 2517 states have internal predecessors, (4810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 4810 transitions. [2021-10-16 22:49:16,124 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 4810 transitions. Word has length 174 [2021-10-16 22:49:16,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:49:16,124 INFO L470 AbstractCegarLoop]: Abstraction has 2518 states and 4810 transitions. [2021-10-16 22:49:16,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:16,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 4810 transitions. [2021-10-16 22:49:16,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:49:16,125 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:49:16,126 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:49:16,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-10-16 22:49:16,126 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:49:16,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:49:16,126 INFO L82 PathProgramCache]: Analyzing trace with hash -971938840, now seen corresponding path program 24 times [2021-10-16 22:49:16,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:49:16,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360793352] [2021-10-16 22:49:16,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:49:16,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:49:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:49:16,425 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-16 22:49:16,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:49:16,425 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360793352] [2021-10-16 22:49:16,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360793352] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:49:16,425 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:49:16,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:49:16,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863970714] [2021-10-16 22:49:16,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:49:16,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:49:16,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:49:16,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:49:16,426 INFO L87 Difference]: Start difference. First operand 2518 states and 4810 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:18,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:49:18,533 INFO L93 Difference]: Finished difference Result 4071 states and 7849 transitions. [2021-10-16 22:49:18,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-10-16 22:49:18,533 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:49:18,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:49:18,537 INFO L225 Difference]: With dead ends: 4071 [2021-10-16 22:49:18,537 INFO L226 Difference]: Without dead ends: 4071 [2021-10-16 22:49:18,537 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1847 ImplicationChecksByTransitivity, 1077.3ms TimeCoverageRelationStatistics Valid=996, Invalid=5484, Unknown=0, NotChecked=0, Total=6480 [2021-10-16 22:49:18,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4071 states. [2021-10-16 22:49:18,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4071 to 2512. [2021-10-16 22:49:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2512 states, 2509 states have (on average 1.9123156636110004) internal successors, (4798), 2511 states have internal predecessors, (4798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2512 states and 4798 transitions. [2021-10-16 22:49:18,560 INFO L78 Accepts]: Start accepts. Automaton has 2512 states and 4798 transitions. Word has length 174 [2021-10-16 22:49:18,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:49:18,560 INFO L470 AbstractCegarLoop]: Abstraction has 2512 states and 4798 transitions. [2021-10-16 22:49:18,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:18,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 4798 transitions. [2021-10-16 22:49:18,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:49:18,561 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:49:18,561 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:49:18,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-10-16 22:49:18,562 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:49:18,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:49:18,562 INFO L82 PathProgramCache]: Analyzing trace with hash -529039700, now seen corresponding path program 25 times [2021-10-16 22:49:18,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:49:18,562 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922437519] [2021-10-16 22:49:18,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:49:18,562 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:49:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:49:18,898 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-16 22:49:18,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:49:18,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922437519] [2021-10-16 22:49:18,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922437519] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:49:18,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:49:18,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:49:18,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217716321] [2021-10-16 22:49:18,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:49:18,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:49:18,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:49:18,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:49:18,900 INFO L87 Difference]: Start difference. First operand 2512 states and 4798 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:20,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:49:20,871 INFO L93 Difference]: Finished difference Result 4136 states and 7975 transitions. [2021-10-16 22:49:20,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-10-16 22:49:20,872 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:49:20,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:49:20,876 INFO L225 Difference]: With dead ends: 4136 [2021-10-16 22:49:20,876 INFO L226 Difference]: Without dead ends: 4136 [2021-10-16 22:49:20,877 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1973 ImplicationChecksByTransitivity, 1110.5ms TimeCoverageRelationStatistics Valid=1009, Invalid=5797, Unknown=0, NotChecked=0, Total=6806 [2021-10-16 22:49:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4136 states. [2021-10-16 22:49:20,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4136 to 2506. [2021-10-16 22:49:20,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2506 states, 2503 states have (on average 1.9121054734318816) internal successors, (4786), 2505 states have internal predecessors, (4786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:20,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 4786 transitions. [2021-10-16 22:49:20,902 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 4786 transitions. Word has length 174 [2021-10-16 22:49:20,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:49:20,902 INFO L470 AbstractCegarLoop]: Abstraction has 2506 states and 4786 transitions. [2021-10-16 22:49:20,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:20,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 4786 transitions. [2021-10-16 22:49:20,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:49:20,903 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:49:20,903 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:49:20,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-10-16 22:49:20,904 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:49:20,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:49:20,904 INFO L82 PathProgramCache]: Analyzing trace with hash -2053001466, now seen corresponding path program 26 times [2021-10-16 22:49:20,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:49:20,904 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272355170] [2021-10-16 22:49:20,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:49:20,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:49:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:49:21,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-16 22:49:21,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:49:21,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272355170] [2021-10-16 22:49:21,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272355170] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:49:21,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:49:21,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:49:21,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120415533] [2021-10-16 22:49:21,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:49:21,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:49:21,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:49:21,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:49:21,342 INFO L87 Difference]: Start difference. First operand 2506 states and 4786 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:23,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:49:23,385 INFO L93 Difference]: Finished difference Result 4104 states and 7913 transitions. [2021-10-16 22:49:23,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-10-16 22:49:23,385 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:49:23,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:49:23,389 INFO L225 Difference]: With dead ends: 4104 [2021-10-16 22:49:23,390 INFO L226 Difference]: Without dead ends: 4104 [2021-10-16 22:49:23,390 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2105 ImplicationChecksByTransitivity, 1225.5ms TimeCoverageRelationStatistics Valid=1039, Invalid=6101, Unknown=0, NotChecked=0, Total=7140 [2021-10-16 22:49:23,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4104 states. [2021-10-16 22:49:23,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4104 to 2430. [2021-10-16 22:49:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2430 states, 2427 states have (on average 1.9093531108364237) internal successors, (4634), 2429 states have internal predecessors, (4634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 4634 transitions. [2021-10-16 22:49:23,413 INFO L78 Accepts]: Start accepts. Automaton has 2430 states and 4634 transitions. Word has length 174 [2021-10-16 22:49:23,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:49:23,413 INFO L470 AbstractCegarLoop]: Abstraction has 2430 states and 4634 transitions. [2021-10-16 22:49:23,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:23,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 4634 transitions. [2021-10-16 22:49:23,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:49:23,415 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:49:23,415 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:49:23,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-10-16 22:49:23,416 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:49:23,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:49:23,417 INFO L82 PathProgramCache]: Analyzing trace with hash -854256468, now seen corresponding path program 27 times [2021-10-16 22:49:23,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:49:23,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881669156] [2021-10-16 22:49:23,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:49:23,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:49:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:49:23,742 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-16 22:49:23,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:49:23,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881669156] [2021-10-16 22:49:23,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881669156] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:49:23,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:49:23,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:49:23,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574650942] [2021-10-16 22:49:23,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:49:23,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:49:23,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:49:23,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:49:23,744 INFO L87 Difference]: Start difference. First operand 2430 states and 4634 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:25,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:49:25,496 INFO L93 Difference]: Finished difference Result 4066 states and 7841 transitions. [2021-10-16 22:49:25,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-10-16 22:49:25,496 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:49:25,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:49:25,500 INFO L225 Difference]: With dead ends: 4066 [2021-10-16 22:49:25,500 INFO L226 Difference]: Without dead ends: 4066 [2021-10-16 22:49:25,501 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1605 ImplicationChecksByTransitivity, 965.2ms TimeCoverageRelationStatistics Valid=921, Invalid=4931, Unknown=0, NotChecked=0, Total=5852 [2021-10-16 22:49:25,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4066 states. [2021-10-16 22:49:25,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4066 to 2528. [2021-10-16 22:49:25,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2528 states, 2525 states have (on average 1.9128712871287128) internal successors, (4830), 2527 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 4830 transitions. [2021-10-16 22:49:25,524 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 4830 transitions. Word has length 174 [2021-10-16 22:49:25,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:49:25,524 INFO L470 AbstractCegarLoop]: Abstraction has 2528 states and 4830 transitions. [2021-10-16 22:49:25,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 4830 transitions. [2021-10-16 22:49:25,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:49:25,526 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:49:25,526 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:49:25,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-10-16 22:49:25,526 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:49:25,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:49:25,526 INFO L82 PathProgramCache]: Analyzing trace with hash 735678282, now seen corresponding path program 28 times [2021-10-16 22:49:25,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:49:25,526 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480178656] [2021-10-16 22:49:25,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:49:25,526 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:49:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:49:25,941 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-16 22:49:25,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:49:25,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480178656] [2021-10-16 22:49:25,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480178656] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:49:25,942 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:49:25,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:49:25,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682383878] [2021-10-16 22:49:25,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:49:25,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:49:25,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:49:25,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:49:25,943 INFO L87 Difference]: Start difference. First operand 2528 states and 4830 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:49:27,889 INFO L93 Difference]: Finished difference Result 4103 states and 7913 transitions. [2021-10-16 22:49:27,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-10-16 22:49:27,889 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:49:27,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:49:27,894 INFO L225 Difference]: With dead ends: 4103 [2021-10-16 22:49:27,894 INFO L226 Difference]: Without dead ends: 4103 [2021-10-16 22:49:27,894 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1832 ImplicationChecksByTransitivity, 1191.4ms TimeCoverageRelationStatistics Valid=986, Invalid=5494, Unknown=0, NotChecked=0, Total=6480 [2021-10-16 22:49:27,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2021-10-16 22:49:27,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 2522. [2021-10-16 22:49:27,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2522 states, 2519 states have (on average 1.9126637554585153) internal successors, (4818), 2521 states have internal predecessors, (4818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 4818 transitions. [2021-10-16 22:49:27,918 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 4818 transitions. Word has length 174 [2021-10-16 22:49:27,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:49:27,918 INFO L470 AbstractCegarLoop]: Abstraction has 2522 states and 4818 transitions. [2021-10-16 22:49:27,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:27,918 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 4818 transitions. [2021-10-16 22:49:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:49:27,919 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:49:27,920 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:49:27,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-10-16 22:49:27,920 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:49:27,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:49:27,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1178577422, now seen corresponding path program 29 times [2021-10-16 22:49:27,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:49:27,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730949997] [2021-10-16 22:49:27,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:49:27,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:49:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:49:28,348 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-16 22:49:28,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:49:28,349 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730949997] [2021-10-16 22:49:28,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730949997] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:49:28,349 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:49:28,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:49:28,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161800609] [2021-10-16 22:49:28,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:49:28,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:49:28,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:49:28,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:49:28,349 INFO L87 Difference]: Start difference. First operand 2522 states and 4818 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:30,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:49:30,290 INFO L93 Difference]: Finished difference Result 4168 states and 8039 transitions. [2021-10-16 22:49:30,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-10-16 22:49:30,290 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:49:30,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:49:30,295 INFO L225 Difference]: With dead ends: 4168 [2021-10-16 22:49:30,295 INFO L226 Difference]: Without dead ends: 4168 [2021-10-16 22:49:30,296 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 1185.2ms TimeCoverageRelationStatistics Valid=992, Invalid=5814, Unknown=0, NotChecked=0, Total=6806 [2021-10-16 22:49:30,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4168 states. [2021-10-16 22:49:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4168 to 2516. [2021-10-16 22:49:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2516 states, 2513 states have (on average 1.9124552327894946) internal successors, (4806), 2515 states have internal predecessors, (4806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:30,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2516 states and 4806 transitions. [2021-10-16 22:49:30,343 INFO L78 Accepts]: Start accepts. Automaton has 2516 states and 4806 transitions. Word has length 174 [2021-10-16 22:49:30,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:49:30,343 INFO L470 AbstractCegarLoop]: Abstraction has 2516 states and 4806 transitions. [2021-10-16 22:49:30,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:30,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 4806 transitions. [2021-10-16 22:49:30,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:49:30,344 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:49:30,345 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:49:30,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-10-16 22:49:30,345 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:49:30,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:49:30,345 INFO L82 PathProgramCache]: Analyzing trace with hash -345384344, now seen corresponding path program 30 times [2021-10-16 22:49:30,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:49:30,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967824702] [2021-10-16 22:49:30,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:49:30,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:49:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:49:30,642 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-16 22:49:30,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:49:30,643 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967824702] [2021-10-16 22:49:30,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967824702] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:49:30,643 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:49:30,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:49:30,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330132114] [2021-10-16 22:49:30,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:49:30,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:49:30,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:49:30,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:49:30,644 INFO L87 Difference]: Start difference. First operand 2516 states and 4806 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:32,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:49:32,696 INFO L93 Difference]: Finished difference Result 4136 states and 7977 transitions. [2021-10-16 22:49:32,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-10-16 22:49:32,696 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:49:32,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:49:32,700 INFO L225 Difference]: With dead ends: 4136 [2021-10-16 22:49:32,700 INFO L226 Difference]: Without dead ends: 4136 [2021-10-16 22:49:32,701 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2098 ImplicationChecksByTransitivity, 1074.2ms TimeCoverageRelationStatistics Valid=1015, Invalid=6125, Unknown=0, NotChecked=0, Total=7140 [2021-10-16 22:49:32,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4136 states. [2021-10-16 22:49:32,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4136 to 2430. [2021-10-16 22:49:32,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2430 states, 2427 states have (on average 1.9093531108364237) internal successors, (4634), 2429 states have internal predecessors, (4634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:32,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 4634 transitions. [2021-10-16 22:49:32,723 INFO L78 Accepts]: Start accepts. Automaton has 2430 states and 4634 transitions. Word has length 174 [2021-10-16 22:49:32,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:49:32,724 INFO L470 AbstractCegarLoop]: Abstraction has 2430 states and 4634 transitions. [2021-10-16 22:49:32,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:32,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 4634 transitions. [2021-10-16 22:49:32,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:49:32,725 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:49:32,725 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:49:32,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-10-16 22:49:32,725 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:49:32,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:49:32,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1283328242, now seen corresponding path program 31 times [2021-10-16 22:49:32,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:49:32,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762706848] [2021-10-16 22:49:32,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:49:32,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:49:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:49:33,030 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-16 22:49:33,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:49:33,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762706848] [2021-10-16 22:49:33,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762706848] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:49:33,030 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:49:33,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:49:33,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017386532] [2021-10-16 22:49:33,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:49:33,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:49:33,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:49:33,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:49:33,031 INFO L87 Difference]: Start difference. First operand 2430 states and 4634 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:34,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:49:34,629 INFO L93 Difference]: Finished difference Result 3303 states and 6366 transitions. [2021-10-16 22:49:34,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-10-16 22:49:34,630 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:49:34,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:49:34,633 INFO L225 Difference]: With dead ends: 3303 [2021-10-16 22:49:34,633 INFO L226 Difference]: Without dead ends: 3303 [2021-10-16 22:49:34,633 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 924.8ms TimeCoverageRelationStatistics Valid=700, Invalid=3460, Unknown=0, NotChecked=0, Total=4160 [2021-10-16 22:49:34,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3303 states. [2021-10-16 22:49:34,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3303 to 2424. [2021-10-16 22:49:34,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2424 states, 2421 states have (on average 1.909128459314333) internal successors, (4622), 2423 states have internal predecessors, (4622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:34,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 4622 transitions. [2021-10-16 22:49:34,653 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 4622 transitions. Word has length 174 [2021-10-16 22:49:34,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:49:34,653 INFO L470 AbstractCegarLoop]: Abstraction has 2424 states and 4622 transitions. [2021-10-16 22:49:34,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:34,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 4622 transitions. [2021-10-16 22:49:34,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:49:34,655 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:49:34,655 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:49:34,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-10-16 22:49:34,655 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:49:34,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:49:34,655 INFO L82 PathProgramCache]: Analyzing trace with hash 306606508, now seen corresponding path program 32 times [2021-10-16 22:49:34,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:49:34,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735604858] [2021-10-16 22:49:34,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:49:34,655 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:49:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:49:35,078 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-16 22:49:35,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:49:35,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735604858] [2021-10-16 22:49:35,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735604858] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:49:35,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:49:35,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:49:35,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892203162] [2021-10-16 22:49:35,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:49:35,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:49:35,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:49:35,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:49:35,079 INFO L87 Difference]: Start difference. First operand 2424 states and 4622 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:37,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:49:37,018 INFO L93 Difference]: Finished difference Result 3340 states and 6438 transitions. [2021-10-16 22:49:37,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-10-16 22:49:37,018 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:49:37,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:49:37,021 INFO L225 Difference]: With dead ends: 3340 [2021-10-16 22:49:37,021 INFO L226 Difference]: Without dead ends: 3340 [2021-10-16 22:49:37,021 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1095 ImplicationChecksByTransitivity, 1126.7ms TimeCoverageRelationStatistics Valid=744, Invalid=3812, Unknown=0, NotChecked=0, Total=4556 [2021-10-16 22:49:37,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3340 states. [2021-10-16 22:49:37,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3340 to 2418. [2021-10-16 22:49:37,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 2415 states have (on average 1.9089026915113871) internal successors, (4610), 2417 states have internal predecessors, (4610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 4610 transitions. [2021-10-16 22:49:37,041 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 4610 transitions. Word has length 174 [2021-10-16 22:49:37,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:49:37,041 INFO L470 AbstractCegarLoop]: Abstraction has 2418 states and 4610 transitions. [2021-10-16 22:49:37,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:37,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 4610 transitions. [2021-10-16 22:49:37,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:49:37,043 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:49:37,043 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:49:37,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-10-16 22:49:37,043 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:49:37,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:49:37,043 INFO L82 PathProgramCache]: Analyzing trace with hash 749505648, now seen corresponding path program 33 times [2021-10-16 22:49:37,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:49:37,043 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915779284] [2021-10-16 22:49:37,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:49:37,043 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:49:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:49:37,325 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-16 22:49:37,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:49:37,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915779284] [2021-10-16 22:49:37,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915779284] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:49:37,325 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:49:37,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:49:37,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244217912] [2021-10-16 22:49:37,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:49:37,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:49:37,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:49:37,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:49:37,326 INFO L87 Difference]: Start difference. First operand 2418 states and 4610 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:39,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:49:39,088 INFO L93 Difference]: Finished difference Result 3405 states and 6564 transitions. [2021-10-16 22:49:39,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-10-16 22:49:39,088 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:49:39,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:49:39,092 INFO L225 Difference]: With dead ends: 3405 [2021-10-16 22:49:39,092 INFO L226 Difference]: Without dead ends: 3405 [2021-10-16 22:49:39,092 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 873.4ms TimeCoverageRelationStatistics Valid=734, Invalid=3958, Unknown=0, NotChecked=0, Total=4692 [2021-10-16 22:49:39,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2021-10-16 22:49:39,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 2412. [2021-10-16 22:49:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2412 states, 2409 states have (on average 1.908675799086758) internal successors, (4598), 2411 states have internal predecessors, (4598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:39,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2412 states and 4598 transitions. [2021-10-16 22:49:39,113 INFO L78 Accepts]: Start accepts. Automaton has 2412 states and 4598 transitions. Word has length 174 [2021-10-16 22:49:39,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:49:39,113 INFO L470 AbstractCegarLoop]: Abstraction has 2412 states and 4598 transitions. [2021-10-16 22:49:39,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 4598 transitions. [2021-10-16 22:49:39,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-16 22:49:39,114 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:49:39,114 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:49:39,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-10-16 22:49:39,115 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:49:39,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:49:39,115 INFO L82 PathProgramCache]: Analyzing trace with hash -774456118, now seen corresponding path program 34 times [2021-10-16 22:49:39,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:49:39,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138977741] [2021-10-16 22:49:39,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:49:39,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:49:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:49:39,529 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-16 22:49:39,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:49:39,529 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138977741] [2021-10-16 22:49:39,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138977741] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:49:39,529 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:49:39,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-16 22:49:39,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382291445] [2021-10-16 22:49:39,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-16 22:49:39,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:49:39,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-16 22:49:39,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-10-16 22:49:39,530 INFO L87 Difference]: Start difference. First operand 2412 states and 4598 transitions. Second operand has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:41,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:49:41,291 INFO L93 Difference]: Finished difference Result 3373 states and 6502 transitions. [2021-10-16 22:49:41,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-10-16 22:49:41,292 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2021-10-16 22:49:41,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:49:41,295 INFO L225 Difference]: With dead ends: 3373 [2021-10-16 22:49:41,295 INFO L226 Difference]: Without dead ends: 3373 [2021-10-16 22:49:41,295 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 1017.7ms TimeCoverageRelationStatistics Valid=736, Invalid=4094, Unknown=0, NotChecked=0, Total=4830 [2021-10-16 22:49:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2021-10-16 22:49:41,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 2233. [2021-10-16 22:49:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2233 states, 2231 states have (on average 1.9027341999103542) internal successors, (4245), 2232 states have internal predecessors, (4245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:41,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 4245 transitions. [2021-10-16 22:49:41,315 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 4245 transitions. Word has length 174 [2021-10-16 22:49:41,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:49:41,315 INFO L470 AbstractCegarLoop]: Abstraction has 2233 states and 4245 transitions. [2021-10-16 22:49:41,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.25) internal successors, (174), 25 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:41,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 4245 transitions. [2021-10-16 22:49:41,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-10-16 22:49:41,316 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:49:41,316 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:49:41,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-10-16 22:49:41,316 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:49:41,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:49:41,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1857823955, now seen corresponding path program 1 times [2021-10-16 22:49:41,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:49:41,317 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597963972] [2021-10-16 22:49:41,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:49:41,317 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:49:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:49:41,396 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-16 22:49:41,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:49:41,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597963972] [2021-10-16 22:49:41,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597963972] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:49:41,396 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:49:41,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-16 22:49:41,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390005485] [2021-10-16 22:49:41,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-16 22:49:41,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:49:41,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-16 22:49:41,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-16 22:49:41,397 INFO L87 Difference]: Start difference. First operand 2233 states and 4245 transitions. Second operand has 6 states, 5 states have (on average 35.2) internal successors, (176), 6 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:41,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:49:41,589 INFO L93 Difference]: Finished difference Result 2497 states and 4767 transitions. [2021-10-16 22:49:41,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-16 22:49:41,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 35.2) internal successors, (176), 6 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2021-10-16 22:49:41,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:49:41,591 INFO L225 Difference]: With dead ends: 2497 [2021-10-16 22:49:41,591 INFO L226 Difference]: Without dead ends: 2497 [2021-10-16 22:49:41,592 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.0ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-16 22:49:41,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2497 states. [2021-10-16 22:49:41,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2497 to 2314. [2021-10-16 22:49:41,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2314 states, 2312 states have (on average 1.9044117647058822) internal successors, (4403), 2313 states have internal predecessors, (4403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 4403 transitions. [2021-10-16 22:49:41,610 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 4403 transitions. Word has length 176 [2021-10-16 22:49:41,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:49:41,610 INFO L470 AbstractCegarLoop]: Abstraction has 2314 states and 4403 transitions. [2021-10-16 22:49:41,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 35.2) internal successors, (176), 6 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:41,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 4403 transitions. [2021-10-16 22:49:41,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-10-16 22:49:41,611 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:49:41,612 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:49:41,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-10-16 22:49:41,612 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:49:41,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:49:41,612 INFO L82 PathProgramCache]: Analyzing trace with hash -349357528, now seen corresponding path program 1 times [2021-10-16 22:49:41,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:49:41,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043353169] [2021-10-16 22:49:41,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:49:41,612 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:49:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 22:49:41,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 22:49:41,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-16 22:49:41,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043353169] [2021-10-16 22:49:41,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043353169] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 22:49:41,659 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 22:49:41,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-16 22:49:41,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775523586] [2021-10-16 22:49:41,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-16 22:49:41,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-16 22:49:41,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-16 22:49:41,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-16 22:49:41,660 INFO L87 Difference]: Start difference. First operand 2314 states and 4403 transitions. Second operand has 6 states, 5 states have (on average 37.0) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:41,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 22:49:41,736 INFO L93 Difference]: Finished difference Result 2395 states and 4538 transitions. [2021-10-16 22:49:41,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-16 22:49:41,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 37.0) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 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 185 [2021-10-16 22:49:41,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 22:49:41,744 INFO L225 Difference]: With dead ends: 2395 [2021-10-16 22:49:41,744 INFO L226 Difference]: Without dead ends: 1855 [2021-10-16 22:49:41,744 INFO L842 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-16 22:49:41,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2021-10-16 22:49:41,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1855. [2021-10-16 22:49:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1855 states, 1853 states have (on average 1.8704803022126282) internal successors, (3466), 1854 states have internal predecessors, (3466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:41,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1855 states and 3466 transitions. [2021-10-16 22:49:41,762 INFO L78 Accepts]: Start accepts. Automaton has 1855 states and 3466 transitions. Word has length 185 [2021-10-16 22:49:41,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 22:49:41,762 INFO L470 AbstractCegarLoop]: Abstraction has 1855 states and 3466 transitions. [2021-10-16 22:49:41,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 37.0) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-16 22:49:41,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 3466 transitions. [2021-10-16 22:49:41,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-10-16 22:49:41,764 INFO L509 BasicCegarLoop]: Found error trace [2021-10-16 22:49:41,764 INFO L517 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 22:49:41,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-10-16 22:49:41,764 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2021-10-16 22:49:41,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 22:49:41,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1496031762, now seen corresponding path program 1 times [2021-10-16 22:49:41,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-16 22:49:41,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631300377] [2021-10-16 22:49:41,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 22:49:41,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 22:49:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-16 22:49:41,791 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-16 22:49:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-16 22:49:41,902 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-16 22:49:41,902 INFO L631 BasicCegarLoop]: Counterexample is feasible [2021-10-16 22:49:41,904 WARN L676 BasicCegarLoop]: Found a data race, but unable to determine exactly which statements and variables are involved. [2021-10-16 22:49:41,905 WARN L679 BasicCegarLoop]: C: A->next = sp [1234] might race with any of C: p = A->next [1254], or C: t = A->next [1233], or C: t = A->next [1233], or C: t = A->next [1233], or C: t = A->next [1233], or C: p -> next = ((void *)0) [1223], or C: p -> next = ((void *)0) [1223], or C: p -> next = ((void *)0) [1223], or C: p -> next = ((void *)0) [1223], or C: p -> datum = x [1222], or C: p -> datum = x [1222], or C: p -> datum = x [1222], or C: p -> datum = x [1222], or C: A->next = p [1247], or C: A->next = p [1247], or C: A->next = p [1247], or C: A->next = p [1247] [2021-10-16 22:49:41,906 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE [2021-10-16 22:49:41,907 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE [2021-10-16 22:49:41,907 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE [2021-10-16 22:49:41,908 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE [2021-10-16 22:49:41,908 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE [2021-10-16 22:49:41,908 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE [2021-10-16 22:49:41,908 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE [2021-10-16 22:49:41,908 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE [2021-10-16 22:49:41,908 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE [2021-10-16 22:49:41,908 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE [2021-10-16 22:49:41,908 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-16 22:49:41,908 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE [2021-10-16 22:49:41,908 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE [2021-10-16 22:49:41,909 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE [2021-10-16 22:49:41,909 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE [2021-10-16 22:49:41,909 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE [2021-10-16 22:49:41,909 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE [2021-10-16 22:49:41,909 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE [2021-10-16 22:49:41,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-10-16 22:49:41,915 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-16 22:49:41,915 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-16 22:49:41,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 10:49:41 BasicIcfg [2021-10-16 22:49:41,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-16 22:49:41,994 INFO L168 Benchmark]: Toolchain (without parser) took 171264.07 ms. Allocated memory was 239.1 MB in the beginning and 625.0 MB in the end (delta: 385.9 MB). Free memory was 210.9 MB in the beginning and 262.6 MB in the end (delta: -51.7 MB). Peak memory consumption was 334.0 MB. Max. memory is 8.0 GB. [2021-10-16 22:49:41,994 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 239.1 MB. Free memory was 201.7 MB in the beginning and 201.6 MB in the end (delta: 63.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-10-16 22:49:41,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 540.90 ms. Allocated memory is still 239.1 MB. Free memory was 210.7 MB in the beginning and 183.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 29.6 MB. Max. memory is 8.0 GB. [2021-10-16 22:49:41,995 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.56 ms. Allocated memory is still 239.1 MB. Free memory was 183.9 MB in the beginning and 180.3 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-10-16 22:49:41,995 INFO L168 Benchmark]: Boogie Preprocessor took 26.09 ms. Allocated memory is still 239.1 MB. Free memory was 180.3 MB in the beginning and 177.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-10-16 22:49:41,995 INFO L168 Benchmark]: RCFGBuilder took 470.76 ms. Allocated memory is still 239.1 MB. Free memory was 177.4 MB in the beginning and 155.6 MB in the end (delta: 21.7 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. [2021-10-16 22:49:41,995 INFO L168 Benchmark]: TraceAbstraction took 170176.37 ms. Allocated memory was 239.1 MB in the beginning and 625.0 MB in the end (delta: 385.9 MB). Free memory was 155.1 MB in the beginning and 262.6 MB in the end (delta: -107.5 MB). Peak memory consumption was 279.2 MB. Max. memory is 8.0 GB. [2021-10-16 22:49:41,996 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.10 ms. Allocated memory is still 239.1 MB. Free memory was 201.7 MB in the beginning and 201.6 MB in the end (delta: 63.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 540.90 ms. Allocated memory is still 239.1 MB. Free memory was 210.7 MB in the beginning and 183.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 29.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 44.56 ms. Allocated memory is still 239.1 MB. Free memory was 183.9 MB in the beginning and 180.3 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 26.09 ms. Allocated memory is still 239.1 MB. Free memory was 180.3 MB in the beginning and 177.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 470.76 ms. Allocated memory is still 239.1 MB. Free memory was 177.4 MB in the beginning and 155.6 MB in the end (delta: 21.7 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 170176.37 ms. Allocated memory was 239.1 MB in the beginning and 625.0 MB in the end (delta: 385.9 MB). Free memory was 155.1 MB in the beginning and 262.6 MB in the end (delta: -107.5 MB). Peak memory consumption was 279.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1234]: the program contains a data race the program contains a data race We found a FailurePath: [L1217-L1220] 0 struct s { int datum; struct s *next; } *A, *B; VAL [A={0:0}, B={0:0}] [L1225] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={15:0}, B={0:0}] [L1226] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={15:0}, B={0:0}, B_mutex={17:0}] [L1240] 0 pthread_t t1; VAL [A={0:0}, A_mutex={15:0}, B={0:0}, B_mutex={17:0}] [L1241] 0 int *ip; VAL [A={0:0}, A_mutex={15:0}, B={0:0}, B_mutex={17:0}] [L1242] 0 struct s *sp; VAL [A={0:0}, A_mutex={15:0}, B={0:0}, B_mutex={17:0}] [L1243] 0 struct s *p = malloc(sizeof(struct s)); VAL [A={0:0}, A_mutex={15:0}, B={0:0}, B_mutex={17:0}] [L1222] 0 p -> datum = x VAL [A={0:0}, A_mutex={15:0}, B={0:0}, B_mutex={17:0}] [L1223] 0 p -> next = ((void *)0) VAL [A={0:0}, A_mutex={15:0}, B={0:0}, B_mutex={17:0}] [L1245] 0 A = malloc(sizeof(struct s)) VAL [A={11:0}, A_mutex={15:0}, B={0:0}, B_mutex={17:0}] [L1222] 0 p -> datum = x VAL [A={11:0}, A_mutex={15:0}, B={0:0}, B_mutex={17:0}] [L1223] 0 p -> next = ((void *)0) VAL [A={11:0}, A_mutex={15:0}, B={0:0}, B_mutex={17:0}] [L1247] 0 A->next = p VAL [A={11:0}, A_mutex={15:0}, B={0:0}, B_mutex={17:0}] [L1248] 0 B = malloc(sizeof(struct s)) VAL [A={11:0}, A_mutex={15:0}, B={-3:0}, B_mutex={17:0}] [L1222] 0 p -> datum = x VAL [A={11:0}, A_mutex={15:0}, B={-3:0}, B_mutex={17:0}] [L1223] 0 p -> next = ((void *)0) VAL [A={11:0}, A_mutex={15:0}, B={-3:0}, B_mutex={17:0}] [L1250] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={11:0}, A_mutex={15:0}, B={-3:0}, B_mutex={17:0}] [L1228] 1 int *ip; VAL [A={11:0}, A_mutex={15:0}, B={-3:0}, B_mutex={17:0}] [L1229] 1 struct s *t, *sp = __VERIFIER_nondet_pointer(); VAL [A={11:0}, A_mutex={15:0}, B={-3:0}, B_mutex={17:0}] [L1251] 0 ip = &p->datum VAL [A={11:0}, A_mutex={15:0}, B={-3:0}, B_mutex={17:0}] [L1252] 0 sp = ((struct s *)((char *)(ip)-(unsigned long)(&((struct s *)0)->datum))) VAL [A={11:0}, A_mutex={15:0}, B={-3:0}, B_mutex={17:0}] [L1229] 1 struct s *t, *sp = __VERIFIER_nondet_pointer(); VAL [A={11:0}, A_mutex={15:0}, B={-3:0}, B_mutex={17:0}] [L1230] 1 struct s *p = malloc(sizeof(struct s)); VAL [A={11:0}, A_mutex={15:0}, B={-3:0}, B_mutex={17:0}] [L1222] 1 p -> datum = x VAL [A={11:0}, A_mutex={15:0}, B={-3:0}, B_mutex={17:0}] [L1223] 1 p -> next = ((void *)0) VAL [A={11:0}, A_mutex={15:0}, B={-3:0}, B_mutex={17:0}] [L1234] 1 A->next = sp VAL [A={11:0}, A_mutex={15:0}, B={-3:0}, B_mutex={17:0}] [L1254] 0 p = A->next VAL [A={11:0}, A_mutex={15:0}, B={-3:0}, B_mutex={17:0}] [L1234] 1 A->next = sp VAL [A={11:0}, A_mutex={15:0}, B={-3:0}, B_mutex={17:0}] - UnprovableResult [Line: 1222]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1223]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1245]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1222]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1223]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1247]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1222]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1223]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1250]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1222]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1223]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 307 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 169936.7ms, OverallIterations: 74, TraceHistogramMax: 1, EmptinessCheckTime: 182.5ms, AutomataDifference: 136297.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 59.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 24765 SDtfs, 104971 SDslu, 271839 SDs, 0 SdLazy, 176333 SolverSat, 11399 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 55467.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5138 GetRequests, 194 SyntacticMatches, 132 SemanticMatches, 4812 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105273 ImplicationChecksByTransitivity, 81026.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2680occurred in iteration=44, InterpolantAutomatonStates: 3917, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2366.3ms AutomataMinimizationTime, 73 MinimizatonAttempts, 92099 StatesRemovedByMinimization, 67 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 269.2ms SsaConstructionTime, 1155.6ms SatisfiabilityAnalysisTime, 28874.4ms InterpolantComputationTime, 12056 NumberOfCodeBlocks, 12056 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 11796 ConstructedInterpolants, 0 QuantifiedInterpolants, 176614 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 73 InterpolantComputations, 73 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-16 22:49:42,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...