/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-MCRwithDepranks-Lazy-NoForkJoinOpt-wrwc.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/06-symbeq_03-funloop_simple.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-16 05:13:09,391 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-16 05:13:09,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-16 05:13:09,474 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-16 05:13:09,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-16 05:13:09,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-16 05:13:09,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-16 05:13:09,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-16 05:13:09,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-16 05:13:09,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-16 05:13:09,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-16 05:13:09,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-16 05:13:09,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-16 05:13:09,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-16 05:13:09,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-16 05:13:09,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-16 05:13:09,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-16 05:13:09,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-16 05:13:09,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-16 05:13:09,493 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-16 05:13:09,494 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-16 05:13:09,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-16 05:13:09,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-16 05:13:09,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-16 05:13:09,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-16 05:13:09,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-16 05:13:09,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-16 05:13:09,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-16 05:13:09,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-16 05:13:09,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-16 05:13:09,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-16 05:13:09,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-16 05:13:09,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-16 05:13:09,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-16 05:13:09,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-16 05:13:09,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-16 05:13:09,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-16 05:13:09,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-16 05:13:09,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-16 05:13:09,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-16 05:13:09,527 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-16 05:13:09,528 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-MCRwithDepranks-Lazy-NoForkJoinOpt-wrwc.epf [2022-03-16 05:13:09,562 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-16 05:13:09,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-16 05:13:09,563 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-16 05:13:09,563 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-16 05:13:09,564 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-16 05:13:09,565 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-16 05:13:09,565 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-16 05:13:09,565 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-16 05:13:09,565 INFO L138 SettingsManager]: * Use SBE=true [2022-03-16 05:13:09,565 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-16 05:13:09,566 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-16 05:13:09,566 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-16 05:13:09,566 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-16 05:13:09,566 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-16 05:13:09,566 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-16 05:13:09,566 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-16 05:13:09,566 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-16 05:13:09,566 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-16 05:13:09,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-16 05:13:09,567 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-16 05:13:09,567 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-16 05:13:09,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-16 05:13:09,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-16 05:13:09,567 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-16 05:13:09,567 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-16 05:13:09,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-16 05:13:09,567 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-16 05:13:09,568 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-03-16 05:13:09,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-16 05:13:09,568 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-16 05:13:09,568 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-16 05:13:09,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-16 05:13:09,568 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-16 05:13:09,568 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-03-16 05:13:09,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-16 05:13:09,575 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITH_DEPRANKS [2022-03-16 05:13:09,575 INFO L138 SettingsManager]: * MCR: Overapproximate write-read-write conflicts=false [2022-03-16 05:13:09,575 INFO L138 SettingsManager]: * MCR: Optimize fork and join=false [2022-03-16 05:13:09,575 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-03-16 05:13:09,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-16 05:13:09,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-16 05:13:09,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-16 05:13:09,817 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-16 05:13:09,818 INFO L275 PluginConnector]: CDTParser initialized [2022-03-16 05:13:09,819 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_03-funloop_simple.i [2022-03-16 05:13:09,909 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c660fde09/6fb03fa7c214421995a3d64ed020bbca/FLAGdb7e83753 [2022-03-16 05:13:10,419 INFO L306 CDTParser]: Found 1 translation units. [2022-03-16 05:13:10,420 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_03-funloop_simple.i [2022-03-16 05:13:10,444 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c660fde09/6fb03fa7c214421995a3d64ed020bbca/FLAGdb7e83753 [2022-03-16 05:13:10,752 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c660fde09/6fb03fa7c214421995a3d64ed020bbca [2022-03-16 05:13:10,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-16 05:13:10,757 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-16 05:13:10,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-16 05:13:10,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-16 05:13:10,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-16 05:13:10,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:13:10" (1/1) ... [2022-03-16 05:13:10,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@158af652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:13:10, skipping insertion in model container [2022-03-16 05:13:10,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:13:10" (1/1) ... [2022-03-16 05:13:10,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-16 05:13:10,816 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-16 05:13:11,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-16 05:13:11,276 INFO L203 MainTranslator]: Completed pre-run [2022-03-16 05:13:11,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-16 05:13:11,378 INFO L208 MainTranslator]: Completed translation [2022-03-16 05:13:11,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:13:11 WrapperNode [2022-03-16 05:13:11,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-16 05:13:11,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-16 05:13:11,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-16 05:13:11,380 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-16 05:13:11,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:13:11" (1/1) ... [2022-03-16 05:13:11,418 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:13:11" (1/1) ... [2022-03-16 05:13:11,473 INFO L137 Inliner]: procedures = 262, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 112 [2022-03-16 05:13:11,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-16 05:13:11,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-16 05:13:11,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-16 05:13:11,475 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-16 05:13:11,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:13:11" (1/1) ... [2022-03-16 05:13:11,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:13:11" (1/1) ... [2022-03-16 05:13:11,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:13:11" (1/1) ... [2022-03-16 05:13:11,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:13:11" (1/1) ... [2022-03-16 05:13:11,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:13:11" (1/1) ... [2022-03-16 05:13:11,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:13:11" (1/1) ... [2022-03-16 05:13:11,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:13:11" (1/1) ... [2022-03-16 05:13:11,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-16 05:13:11,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-16 05:13:11,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-16 05:13:11,528 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-16 05:13:11,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:13:11" (1/1) ... [2022-03-16 05:13:11,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-16 05:13:11,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 05:13:11,558 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-16 05:13:11,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-16 05:13:11,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-16 05:13:11,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-16 05:13:11,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-16 05:13:11,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-16 05:13:11,597 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-16 05:13:11,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-16 05:13:11,597 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-16 05:13:11,598 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-16 05:13:11,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-16 05:13:11,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-16 05:13:11,599 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-16 05:13:11,710 INFO L234 CfgBuilder]: Building ICFG [2022-03-16 05:13:11,712 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-16 05:13:11,967 INFO L275 CfgBuilder]: Performing block encoding [2022-03-16 05:13:11,973 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-16 05:13:11,974 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-16 05:13:11,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.03 05:13:11 BoogieIcfgContainer [2022-03-16 05:13:11,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-16 05:13:11,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-16 05:13:11,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-16 05:13:11,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-16 05:13:11,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:13:10" (1/3) ... [2022-03-16 05:13:11,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c038e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:13:11, skipping insertion in model container [2022-03-16 05:13:11,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:13:11" (2/3) ... [2022-03-16 05:13:11,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c038e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:13:11, skipping insertion in model container [2022-03-16 05:13:11,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.03 05:13:11" (3/3) ... [2022-03-16 05:13:11,986 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_03-funloop_simple.i [2022-03-16 05:13:11,990 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-16 05:13:11,990 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-16 05:13:11,990 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-03-16 05:13:11,990 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-16 05:13:12,036 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,036 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,036 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,037 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,037 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,037 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,037 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,037 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,038 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,038 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,038 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,038 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,038 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,039 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,039 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,039 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,039 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,039 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,040 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,040 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,040 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,040 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,040 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,040 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,045 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,045 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,045 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,045 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,045 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,045 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,047 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,047 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,050 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,050 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,050 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,051 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,051 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,051 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,052 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,052 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,052 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,056 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,057 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,058 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,058 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,059 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,059 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,060 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,061 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,061 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,064 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,064 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,067 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,070 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,070 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,070 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,070 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,070 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,070 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,070 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,071 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,071 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,071 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,071 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,071 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,071 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,072 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,073 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,073 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,073 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,073 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,073 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,073 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,073 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,073 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,074 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,074 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,074 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,074 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,074 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,074 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,074 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,075 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,075 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,075 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,075 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,075 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,075 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,076 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,076 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,076 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,076 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,076 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,076 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,076 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,081 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,082 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,082 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,082 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,082 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,082 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,082 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,082 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,083 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,083 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,084 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,084 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,084 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,084 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,084 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,084 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,085 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,085 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,116 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,116 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,116 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,116 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,117 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,117 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,117 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,117 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,117 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,117 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,117 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,117 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,117 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,117 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 05:13:12,122 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-16 05:13:12,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-03-16 05:13:12,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 05:13:12,158 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-03-16 05:13:12,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-03-16 05:13:12,197 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-16 05:13:12,205 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mLazyFiniteAutomaton=true, 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, mMcrOptimizeForkJoin=false, mMcrOverapproximateWrwc=false [2022-03-16 05:13:12,205 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-03-16 05:13:12,336 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 44 transitions and produced 45 states. [2022-03-16 05:13:12,338 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 05:13:12,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 05:13:12,345 INFO L85 PathProgramCache]: Analyzing trace with hash 397060765, now seen corresponding path program 1 times [2022-03-16 05:13:12,351 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 05:13:12,351 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860544103] [2022-03-16 05:13:12,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:13:12,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 05:13:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:13:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 05:13:12,512 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 05:13:12,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860544103] [2022-03-16 05:13:12,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860544103] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 05:13:12,513 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 05:13:12,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-16 05:13:12,514 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256940678] [2022-03-16 05:13:12,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 05:13:12,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-16 05:13:12,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 05:13:12,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-16 05:13:12,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-16 05:13:12,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:12,539 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 05:13:12,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 05:13:12,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:12,587 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 44 transitions and produced 45 states. [2022-03-16 05:13:12,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:12,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-16 05:13:12,588 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 05:13:12,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 05:13:12,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1657093153, now seen corresponding path program 1 times [2022-03-16 05:13:12,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 05:13:12,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120934313] [2022-03-16 05:13:12,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:13:12,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 05:13:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:13:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 05:13:12,655 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 05:13:12,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120934313] [2022-03-16 05:13:12,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120934313] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 05:13:12,655 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 05:13:12,655 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-16 05:13:12,656 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3052389] [2022-03-16 05:13:12,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 05:13:12,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-16 05:13:12,657 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 05:13:12,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-16 05:13:12,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-16 05:13:12,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:12,658 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 05:13:12,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 05:13:12,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:12,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:12,773 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 51 transitions and produced 52 states. [2022-03-16 05:13:12,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:12,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:12,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-16 05:13:12,775 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 05:13:12,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 05:13:12,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1891473138, now seen corresponding path program 1 times [2022-03-16 05:13:12,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 05:13:12,777 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006466157] [2022-03-16 05:13:12,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:13:12,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 05:13:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:13:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 05:13:12,882 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 05:13:12,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006466157] [2022-03-16 05:13:12,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006466157] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 05:13:12,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534126570] [2022-03-16 05:13:12,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:13:12,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 05:13:12,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 05:13:12,885 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-16 05:13:12,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-16 05:13:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:13:13,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-03-16 05:13:13,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 05:13:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-16 05:13:13,115 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-16 05:13:13,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534126570] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 05:13:13,116 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-16 05:13:13,116 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-03-16 05:13:13,116 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082232067] [2022-03-16 05:13:13,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 05:13:13,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-16 05:13:13,117 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 05:13:13,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-16 05:13:13,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-16 05:13:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:13,118 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 05:13:13,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 05:13:13,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:13,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:13,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:13,213 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 63 transitions and produced 64 states. [2022-03-16 05:13:13,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:13,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:13,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:13,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-16 05:13:13,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-03-16 05:13:13,436 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 05:13:13,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 05:13:13,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1317859348, now seen corresponding path program 1 times [2022-03-16 05:13:13,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 05:13:13,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487135473] [2022-03-16 05:13:13,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:13:13,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 05:13:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:13:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 05:13:13,501 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 05:13:13,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487135473] [2022-03-16 05:13:13,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487135473] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 05:13:13,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326546695] [2022-03-16 05:13:13,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:13:13,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 05:13:13,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 05:13:13,515 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-16 05:13:13,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-16 05:13:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:13:13,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-16 05:13:13,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 05:13:13,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 05:13:13,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 05:13:13,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 05:13:13,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326546695] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 05:13:13,853 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 05:13:13,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-16 05:13:13,854 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010743987] [2022-03-16 05:13:13,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 05:13:13,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-16 05:13:13,855 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 05:13:13,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-16 05:13:13,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-16 05:13:13,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:13,856 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 05:13:13,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 05:13:13,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:13,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:13,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:13,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:14,036 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 77 transitions and produced 78 states. [2022-03-16 05:13:14,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:14,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:14,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:14,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:13:14,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-16 05:13:14,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 05:13:14,260 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 05:13:14,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 05:13:14,261 INFO L85 PathProgramCache]: Analyzing trace with hash -626594124, now seen corresponding path program 2 times [2022-03-16 05:13:14,261 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 05:13:14,261 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284381203] [2022-03-16 05:13:14,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:13:14,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 05:13:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:13:14,395 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 05:13:14,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 05:13:14,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284381203] [2022-03-16 05:13:14,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284381203] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 05:13:14,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661904936] [2022-03-16 05:13:14,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-16 05:13:14,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 05:13:14,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 05:13:14,398 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-16 05:13:14,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-16 05:13:14,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-16 05:13:14,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-16 05:13:14,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-16 05:13:14,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 05:13:14,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-16 05:13:14,600 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-03-16 05:13:14,601 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-03-16 05:13:14,643 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-03-16 05:13:14,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2022-03-16 05:13:14,696 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-16 05:13:14,697 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2022-03-16 05:13:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-03-16 05:13:14,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-16 05:13:14,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661904936] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 05:13:14,716 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-16 05:13:14,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-03-16 05:13:14,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693245036] [2022-03-16 05:13:14,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 05:13:14,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-16 05:13:14,718 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 05:13:14,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-16 05:13:14,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-03-16 05:13:14,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:14,720 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 05:13:14,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 05:13:14,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:14,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:14,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:14,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:13:14,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:14,923 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 94 transitions and produced 95 states. [2022-03-16 05:13:14,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:14,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:14,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:14,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:13:14,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:14,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-16 05:13:15,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 05:13:15,148 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 05:13:15,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 05:13:15,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1568821428, now seen corresponding path program 1 times [2022-03-16 05:13:15,149 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 05:13:15,149 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066243754] [2022-03-16 05:13:15,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:13:15,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 05:13:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:13:15,294 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 05:13:15,294 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 05:13:15,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066243754] [2022-03-16 05:13:15,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066243754] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 05:13:15,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318135416] [2022-03-16 05:13:15,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:13:15,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 05:13:15,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 05:13:15,312 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-16 05:13:15,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-16 05:13:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:13:15,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-16 05:13:15,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 05:13:15,505 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 05:13:15,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 05:13:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 05:13:15,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318135416] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 05:13:15,629 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 05:13:15,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-16 05:13:15,630 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627658930] [2022-03-16 05:13:15,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 05:13:15,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-16 05:13:15,630 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 05:13:15,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-16 05:13:15,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-16 05:13:15,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:15,631 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 05:13:15,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.444444444444445) internal successors, (80), 18 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 05:13:15,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:15,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:15,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:15,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:13:15,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:15,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:15,902 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 122 transitions and produced 115 states. [2022-03-16 05:13:15,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:15,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:15,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:15,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:13:15,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:15,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:13:15,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-16 05:13:16,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 05:13:16,120 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 05:13:16,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 05:13:16,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1158747276, now seen corresponding path program 2 times [2022-03-16 05:13:16,121 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 05:13:16,121 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9750189] [2022-03-16 05:13:16,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:13:16,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 05:13:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:13:16,345 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 05:13:16,346 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 05:13:16,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9750189] [2022-03-16 05:13:16,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9750189] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 05:13:16,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261815591] [2022-03-16 05:13:16,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-16 05:13:16,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 05:13:16,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 05:13:16,348 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-16 05:13:16,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-16 05:13:16,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-16 05:13:16,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-16 05:13:16,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-16 05:13:16,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 05:13:16,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-16 05:13:16,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:13:16,646 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-16 05:13:16,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:13:16,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:13:16,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:13:16,697 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-16 05:13:16,698 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-03-16 05:13:16,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:13:16,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:13:16,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:13:16,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:13:16,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:13:16,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:13:16,735 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-16 05:13:16,735 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-03-16 05:13:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-03-16 05:13:16,761 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-16 05:13:16,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261815591] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 05:13:16,762 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-16 05:13:16,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 25 [2022-03-16 05:13:16,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957299627] [2022-03-16 05:13:16,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 05:13:16,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-16 05:13:16,763 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 05:13:16,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-16 05:13:16,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-03-16 05:13:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:16,764 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 05:13:16,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 05:13:16,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:16,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:16,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:16,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:13:16,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:16,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:13:16,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:17,289 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 155 transitions and produced 148 states. [2022-03-16 05:13:17,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:17,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:17,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:17,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:13:17,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:17,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:13:17,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-16 05:13:17,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-16 05:13:17,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 05:13:17,495 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 05:13:17,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 05:13:17,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1001729759, now seen corresponding path program 1 times [2022-03-16 05:13:17,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 05:13:17,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732245864] [2022-03-16 05:13:17,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:13:17,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 05:13:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:13:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-03-16 05:13:17,597 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 05:13:17,598 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732245864] [2022-03-16 05:13:17,598 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732245864] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 05:13:17,598 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779041295] [2022-03-16 05:13:17,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:13:17,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 05:13:17,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 05:13:17,605 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-16 05:13:17,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-16 05:13:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:13:17,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-16 05:13:17,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 05:13:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-16 05:13:17,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 05:13:18,240 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-16 05:13:18,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779041295] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 05:13:18,240 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 05:13:18,240 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 24 [2022-03-16 05:13:18,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249822651] [2022-03-16 05:13:18,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 05:13:18,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-16 05:13:18,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 05:13:18,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-16 05:13:18,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2022-03-16 05:13:18,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:18,243 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 05:13:18,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.291666666666667) internal successors, (151), 24 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 05:13:18,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:18,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:18,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:18,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:13:18,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:18,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:13:18,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-03-16 05:13:18,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:19,113 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 205 transitions and produced 193 states. [2022-03-16 05:13:19,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:19,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:19,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:19,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:13:19,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:19,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:13:19,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:13:19,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:13:19,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-16 05:13:19,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 05:13:19,319 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 05:13:19,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 05:13:19,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2116870732, now seen corresponding path program 1 times [2022-03-16 05:13:19,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 05:13:19,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328199282] [2022-03-16 05:13:19,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:13:19,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 05:13:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:13:19,567 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-03-16 05:13:19,567 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 05:13:19,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328199282] [2022-03-16 05:13:19,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328199282] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 05:13:19,568 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 05:13:19,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-16 05:13:19,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907052445] [2022-03-16 05:13:19,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 05:13:19,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-16 05:13:19,569 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 05:13:19,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-16 05:13:19,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-16 05:13:19,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:19,571 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 05:13:19,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 05:13:19,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:19,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:19,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:19,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:13:19,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:19,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:13:19,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:13:19,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:13:19,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:20,128 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 238 transitions and produced 226 states. [2022-03-16 05:13:20,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:20,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:20,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:20,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:13:20,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:20,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:13:20,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:13:20,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:13:20,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:20,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-16 05:13:20,140 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 05:13:20,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 05:13:20,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1162619167, now seen corresponding path program 2 times [2022-03-16 05:13:20,141 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 05:13:20,142 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853603903] [2022-03-16 05:13:20,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:13:20,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 05:13:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:13:20,270 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-16 05:13:20,271 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 05:13:20,271 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853603903] [2022-03-16 05:13:20,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853603903] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 05:13:20,272 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905876993] [2022-03-16 05:13:20,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-16 05:13:20,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 05:13:20,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 05:13:20,284 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-16 05:13:20,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-16 05:13:20,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-16 05:13:20,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-16 05:13:20,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-16 05:13:20,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 05:13:20,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-16 05:13:20,556 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-16 05:13:20,556 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-03-16 05:13:20,597 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-03-16 05:13:20,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-03-16 05:13:20,649 INFO L353 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-03-16 05:13:20,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 46 [2022-03-16 05:13:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2022-03-16 05:13:20,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-16 05:13:20,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905876993] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 05:13:20,669 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-16 05:13:20,669 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-03-16 05:13:20,669 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191453839] [2022-03-16 05:13:20,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 05:13:20,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-16 05:13:20,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 05:13:20,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-16 05:13:20,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-03-16 05:13:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:20,670 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 05:13:20,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 05:13:20,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:20,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:20,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:20,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:13:20,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:20,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:13:20,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:13:20,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:13:20,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:20,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:21,297 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 255 transitions and produced 243 states. [2022-03-16 05:13:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:13:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:21,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:13:21,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:13:21,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:13:21,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:21,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:21,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-16 05:13:21,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-16 05:13:21,516 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 05:13:21,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 05:13:21,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1757402922, now seen corresponding path program 1 times [2022-03-16 05:13:21,517 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 05:13:21,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664133241] [2022-03-16 05:13:21,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:13:21,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 05:13:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:13:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-16 05:13:21,605 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 05:13:21,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664133241] [2022-03-16 05:13:21,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664133241] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 05:13:21,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393085814] [2022-03-16 05:13:21,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:13:21,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 05:13:21,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 05:13:21,607 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-16 05:13:21,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-16 05:13:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:13:21,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-16 05:13:21,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 05:13:21,927 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-16 05:13:21,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 05:13:22,115 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-16 05:13:22,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393085814] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 05:13:22,116 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 05:13:22,116 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-03-16 05:13:22,116 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450187050] [2022-03-16 05:13:22,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 05:13:22,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-16 05:13:22,117 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 05:13:22,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-16 05:13:22,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-03-16 05:13:22,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:22,118 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 05:13:22,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.5) internal successors, (189), 14 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 05:13:22,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:22,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:22,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:22,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:13:22,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:22,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:13:22,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:13:22,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:13:22,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:22,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:22,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:23,482 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 441 transitions and produced 429 states. [2022-03-16 05:13:23,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:23,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:23,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:23,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:13:23,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:23,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:13:23,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:13:23,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:13:23,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:23,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-16 05:13:23,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-16 05:13:23,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 05:13:23,686 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 05:13:23,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 05:13:23,687 INFO L85 PathProgramCache]: Analyzing trace with hash -106070791, now seen corresponding path program 2 times [2022-03-16 05:13:23,687 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 05:13:23,687 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076533867] [2022-03-16 05:13:23,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:13:23,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 05:13:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:13:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-16 05:13:23,998 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 05:13:23,998 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076533867] [2022-03-16 05:13:23,999 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076533867] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 05:13:23,999 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125331622] [2022-03-16 05:13:23,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-16 05:13:23,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 05:13:23,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 05:13:24,002 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-16 05:13:24,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-16 05:13:24,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-16 05:13:24,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-16 05:13:24,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-16 05:13:24,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 05:13:24,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-16 05:13:24,437 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-16 05:13:24,438 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-03-16 05:13:24,478 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-03-16 05:13:24,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-03-16 05:13:24,530 INFO L353 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-03-16 05:13:24,531 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 46 [2022-03-16 05:13:24,557 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2022-03-16 05:13:24,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-16 05:13:24,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125331622] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 05:13:24,558 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-16 05:13:24,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2022-03-16 05:13:24,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798394637] [2022-03-16 05:13:24,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 05:13:24,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-16 05:13:24,559 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 05:13:24,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-16 05:13:24,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-03-16 05:13:24,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:24,560 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 05:13:24,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 05:13:24,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:24,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:24,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:24,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:13:24,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:24,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:13:24,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:13:24,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:13:24,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:24,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:24,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-16 05:13:24,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:26,247 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 476 transitions and produced 464 states. [2022-03-16 05:13:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:13:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:13:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:13:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:13:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-16 05:13:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:26,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-16 05:13:26,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-16 05:13:26,471 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 05:13:26,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 05:13:26,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1731045646, now seen corresponding path program 1 times [2022-03-16 05:13:26,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 05:13:26,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264338314] [2022-03-16 05:13:26,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:13:26,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 05:13:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:13:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-16 05:13:26,684 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 05:13:26,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264338314] [2022-03-16 05:13:26,684 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264338314] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 05:13:26,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869162933] [2022-03-16 05:13:26,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:13:26,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 05:13:26,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 05:13:26,686 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-16 05:13:26,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-16 05:13:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:13:26,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-16 05:13:26,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 05:13:27,286 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-16 05:13:27,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 05:13:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-16 05:13:27,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869162933] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 05:13:27,776 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 05:13:27,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2022-03-16 05:13:27,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507816187] [2022-03-16 05:13:27,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 05:13:27,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-16 05:13:27,779 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 05:13:27,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-16 05:13:27,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-16 05:13:27,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:27,780 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 05:13:27,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 15.608695652173912) internal successors, (359), 23 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 05:13:27,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:27,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:27,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:27,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:13:27,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:27,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:13:27,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:13:27,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:13:27,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:27,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:27,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-16 05:13:27,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:27,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:30,751 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 786 transitions and produced 774 states. [2022-03-16 05:13:30,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:13:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:13:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:13:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:13:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-16 05:13:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:30,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-16 05:13:30,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-03-16 05:13:30,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-16 05:13:30,954 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 05:13:30,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 05:13:30,955 INFO L85 PathProgramCache]: Analyzing trace with hash -986440607, now seen corresponding path program 2 times [2022-03-16 05:13:30,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 05:13:30,955 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452226893] [2022-03-16 05:13:30,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:13:30,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 05:13:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:13:31,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-16 05:13:31,234 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 05:13:31,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452226893] [2022-03-16 05:13:31,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452226893] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 05:13:31,234 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 05:13:31,234 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-16 05:13:31,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080091690] [2022-03-16 05:13:31,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 05:13:31,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-16 05:13:31,235 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 05:13:31,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-16 05:13:31,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-16 05:13:31,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:31,236 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 05:13:31,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.2) internal successors, (96), 6 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) [2022-03-16 05:13:31,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:31,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:31,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:31,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:13:31,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:31,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:13:31,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:13:31,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:13:31,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:31,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:31,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-16 05:13:31,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:31,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-16 05:13:31,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:33,861 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 795 transitions and produced 783 states. [2022-03-16 05:13:33,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:13:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:13:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:13:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:13:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-16 05:13:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-16 05:13:33,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:33,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-16 05:13:33,869 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 05:13:33,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 05:13:33,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1833760666, now seen corresponding path program 1 times [2022-03-16 05:13:33,871 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 05:13:33,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505013123] [2022-03-16 05:13:33,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:13:33,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 05:13:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:13:34,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-16 05:13:34,130 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 05:13:34,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505013123] [2022-03-16 05:13:34,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505013123] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 05:13:34,130 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 05:13:34,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-16 05:13:34,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219865062] [2022-03-16 05:13:34,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 05:13:34,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-16 05:13:34,131 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 05:13:34,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-16 05:13:34,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-16 05:13:34,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:34,132 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 05:13:34,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 05:13:34,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:13:34,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:34,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:13:34,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:13:34,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:34,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:13:34,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:13:34,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:13:34,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:34,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:34,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-16 05:13:34,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:34,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-16 05:13:34,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:13:34,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:14:12,929 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 18533 transitions and produced 10386 states. [2022-03-16 05:14:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:14:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:14:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:14:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:14:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:14:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:14:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:14:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-16 05:14:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-16 05:14:12,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:12,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:12,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-16 05:14:12,931 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 05:14:12,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 05:14:12,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1924795105, now seen corresponding path program 1 times [2022-03-16 05:14:12,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 05:14:12,932 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135876628] [2022-03-16 05:14:12,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:14:12,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 05:14:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:14:13,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-16 05:14:13,217 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 05:14:13,217 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135876628] [2022-03-16 05:14:13,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135876628] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 05:14:13,218 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 05:14:13,218 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-16 05:14:13,218 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515858613] [2022-03-16 05:14:13,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 05:14:13,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-16 05:14:13,219 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 05:14:13,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-16 05:14:13,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-03-16 05:14:13,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:14:13,220 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 05:14:13,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 05:14:13,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:14:13,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:14:13,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:14:13,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:14:13,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:13,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:14:13,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:14:13,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:14:13,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:13,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:13,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-16 05:14:13,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:13,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-16 05:14:13,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:13,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:13,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:14:51,337 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 18381 transitions and produced 10309 states. [2022-03-16 05:14:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:14:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:14:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:14:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:14:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:14:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:14:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:14:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-16 05:14:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-16 05:14:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:51,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:14:51,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-16 05:14:51,340 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 05:14:51,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 05:14:51,340 INFO L85 PathProgramCache]: Analyzing trace with hash -460892034, now seen corresponding path program 1 times [2022-03-16 05:14:51,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 05:14:51,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124006758] [2022-03-16 05:14:51,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:14:51,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 05:14:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:14:51,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-16 05:14:51,721 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 05:14:51,721 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124006758] [2022-03-16 05:14:51,721 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124006758] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 05:14:51,721 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 05:14:51,721 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-16 05:14:51,721 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891876224] [2022-03-16 05:14:51,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 05:14:51,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-16 05:14:51,722 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 05:14:51,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-16 05:14:51,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-03-16 05:14:51,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:14:51,723 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 05:14:51,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.5) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 05:14:51,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:14:51,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:14:51,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:14:51,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:14:51,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:51,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:14:51,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:14:51,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:14:51,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:51,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:51,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-16 05:14:51,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:51,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-16 05:14:51,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:51,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:14:51,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:14:51,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:15:30,964 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 18383 transitions and produced 10314 states. [2022-03-16 05:15:30,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:15:30,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:15:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:15:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:15:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:15:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:15:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:15:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:15:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:15:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:15:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-16 05:15:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:15:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-16 05:15:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:15:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:15:30,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:15:30,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:15:30,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-16 05:15:30,969 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 05:15:30,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 05:15:30,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1402749280, now seen corresponding path program 1 times [2022-03-16 05:15:30,970 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 05:15:30,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282252502] [2022-03-16 05:15:30,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:15:30,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 05:15:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:15:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-16 05:15:31,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 05:15:31,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282252502] [2022-03-16 05:15:31,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282252502] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 05:15:31,458 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 05:15:31,458 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-16 05:15:31,459 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670191252] [2022-03-16 05:15:31,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 05:15:31,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-16 05:15:31,459 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 05:15:31,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-16 05:15:31,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-03-16 05:15:31,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:15:31,460 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 05:15:31,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.625) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 05:15:31,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:15:31,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:15:31,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:15:31,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:15:31,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:15:31,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:15:31,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:15:31,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:15:31,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:15:31,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:15:31,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-16 05:15:31,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:15:31,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-16 05:15:31,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:15:31,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:15:31,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:15:31,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:15:31,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:16:10,925 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 18392 transitions and produced 10323 states. [2022-03-16 05:16:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:16:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:16:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:16:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:16:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:16:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:16:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:16:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:16:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:16:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:16:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-16 05:16:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:16:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-16 05:16:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:16:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:16:10,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:16:10,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:16:10,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:16:10,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-16 05:16:10,932 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 05:16:10,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 05:16:10,933 INFO L85 PathProgramCache]: Analyzing trace with hash -535552803, now seen corresponding path program 1 times [2022-03-16 05:16:10,933 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 05:16:10,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891024491] [2022-03-16 05:16:10,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:16:10,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 05:16:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:16:11,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-16 05:16:11,383 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 05:16:11,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891024491] [2022-03-16 05:16:11,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891024491] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 05:16:11,383 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 05:16:11,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-16 05:16:11,384 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219741899] [2022-03-16 05:16:11,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 05:16:11,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-16 05:16:11,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 05:16:11,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-16 05:16:11,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-03-16 05:16:11,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:16:11,385 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 05:16:11,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.75) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 05:16:11,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:16:11,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:16:11,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:16:11,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:16:11,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:16:11,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:16:11,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:16:11,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:16:11,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:16:11,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:16:11,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-16 05:16:11,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:16:11,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-16 05:16:11,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:16:11,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:16:11,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:16:11,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:16:11,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:16:11,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:19:59,547 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 87824 transitions and produced 48002 states. [2022-03-16 05:19:59,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:19:59,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:19:59,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:19:59,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:19:59,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:19:59,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:19:59,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:19:59,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:19:59,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:19:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:19:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-16 05:19:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:19:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-16 05:19:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:19:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:19:59,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:19:59,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:19:59,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:19:59,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-16 05:19:59,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-16 05:19:59,563 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-03-16 05:19:59,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 05:19:59,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2082690448, now seen corresponding path program 1 times [2022-03-16 05:19:59,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 05:19:59,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474936781] [2022-03-16 05:19:59,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:19:59,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 05:19:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:20:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-16 05:20:01,497 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 05:20:01,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474936781] [2022-03-16 05:20:01,497 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474936781] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 05:20:01,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745849649] [2022-03-16 05:20:01,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 05:20:01,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 05:20:01,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 05:20:01,500 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-16 05:20:01,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-16 05:20:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 05:20:02,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-16 05:20:02,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 05:20:02,721 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-16 05:20:02,742 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-16 05:20:02,743 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-03-16 05:20:02,791 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-03-16 05:20:02,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-03-16 05:20:02,838 INFO L353 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-03-16 05:20:02,839 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 46 [2022-03-16 05:20:03,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,162 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-16 05:20:03,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,203 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 05:20:03,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,240 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 05:20:03,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 05:20:03,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,378 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-16 05:20:03,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,427 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 05:20:03,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,459 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 05:20:03,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 05:20:03,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-16 05:20:03,971 INFO L353 Elim1Store]: treesize reduction 216, result has 14.6 percent of original size [2022-03-16 05:20:03,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 55 treesize of output 63 [2022-03-16 05:20:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-16 05:20:03,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 05:20:39,857 WARN L228 SmtUtils]: Spent 7.52s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-16 05:21:11,570 WARN L228 SmtUtils]: Spent 7.29s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-16 05:21:14,987 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28)))) is different from false [2022-03-16 05:21:17,208 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28)))) is different from false [2022-03-16 05:21:19,482 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|))) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)))) is different from false [2022-03-16 05:21:21,819 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28)))) is different from false [2022-03-16 05:21:25,582 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) .cse0 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) .cse1 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) .cse2 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) .cse3 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)))) is different from false [2022-03-16 05:21:27,856 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_3661) .cse1 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) .cse0 v_ArrVal_3668)) .cse1 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 v_ArrVal_3661) .cse3 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) .cse2 v_ArrVal_3668)) .cse3 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_3661) .cse5 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) .cse4 v_ArrVal_3668)) .cse5 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 v_ArrVal_3661) .cse7 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) .cse6 v_ArrVal_3668)) .cse7 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28)))) is different from false [2022-03-16 05:21:30,217 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_3658) .cse1 v_ArrVal_3661) .cse2 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse0 v_ArrVal_3666)) .cse1 v_ArrVal_3668)) .cse2 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 v_ArrVal_3658) .cse4 v_ArrVal_3661) .cse5 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse3 v_ArrVal_3666)) .cse4 v_ArrVal_3668)) .cse5 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse8 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 v_ArrVal_3658) .cse7 v_ArrVal_3661) .cse8 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse6 v_ArrVal_3666)) .cse7 v_ArrVal_3668)) .cse8 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse11 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse9 v_ArrVal_3658) .cse10 v_ArrVal_3661) .cse11 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse9 v_ArrVal_3666)) .cse10 v_ArrVal_3668)) .cse11 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28)))) is different from false [2022-03-16 05:21:32,518 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse0 v_ArrVal_3658) .cse1 v_ArrVal_3661) .cse2 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse0 v_ArrVal_3666)) .cse1 v_ArrVal_3668)) .cse2 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse3 v_ArrVal_3658) .cse4 v_ArrVal_3661) .cse5 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse3 v_ArrVal_3666)) .cse4 v_ArrVal_3668)) .cse5 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse8 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse6 v_ArrVal_3658) .cse7 v_ArrVal_3661) .cse8 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse6 v_ArrVal_3666)) .cse7 v_ArrVal_3668)) .cse8 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse11 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse9 v_ArrVal_3658) .cse10 v_ArrVal_3661) .cse11 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse9 v_ArrVal_3666)) .cse10 v_ArrVal_3668)) .cse11 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)))) is different from false [2022-03-16 05:21:35,907 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (and (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse0 v_ArrVal_3658) .cse1 v_ArrVal_3661) .cse2 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse0 v_ArrVal_3666)) .cse1 v_ArrVal_3668)) .cse2 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse5 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse4 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse3 v_ArrVal_3658) .cse4 v_ArrVal_3661) .cse5 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse3 v_ArrVal_3666)) .cse4 v_ArrVal_3668)) .cse5 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse8 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse7 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse6 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse6 v_ArrVal_3658) .cse7 v_ArrVal_3661) .cse8 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse6 v_ArrVal_3666)) .cse7 v_ArrVal_3668)) .cse8 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse11 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse10 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse9 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse9 v_ArrVal_3658) .cse10 v_ArrVal_3661) .cse11 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse9 v_ArrVal_3666)) .cse10 v_ArrVal_3668)) .cse11 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28)))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) is different from false [2022-03-16 05:21:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 0 proven. 0 refuted. 3 times theorem prover too weak. 1550 trivial. 6 not checked. [2022-03-16 05:21:58,740 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745849649] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 05:21:58,740 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 05:21:58,740 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 20] total 39 [2022-03-16 05:21:58,740 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282014409] [2022-03-16 05:21:58,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 05:21:58,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-16 05:21:58,741 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 05:21:58,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-16 05:21:58,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=650, Unknown=40, NotChecked=594, Total=1560 [2022-03-16 05:21:58,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:21:58,742 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 05:21:58,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 6.641025641025641) internal successors, (259), 40 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 05:21:58,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:21:58,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:21:58,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 05:21:58,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:21:58,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:21:58,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 05:21:58,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 05:21:58,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-16 05:21:58,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:21:58,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:21:58,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-16 05:21:58,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:21:58,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-16 05:21:58,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:21:58,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 05:21:58,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:21:58,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:21:58,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 05:21:58,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-03-16 05:21:58,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 05:22:31,306 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (and (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse1 v_ArrVal_3658) .cse2 v_ArrVal_3661) .cse3 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse1 v_ArrVal_3666)) .cse2 v_ArrVal_3668)) .cse3 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse6 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse5 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse4 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse4 v_ArrVal_3658) .cse5 v_ArrVal_3661) .cse6 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse4 v_ArrVal_3666)) .cse5 v_ArrVal_3668)) .cse6 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse9 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse8 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse7 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse7 v_ArrVal_3658) .cse8 v_ArrVal_3661) .cse9 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse7 v_ArrVal_3666)) .cse8 v_ArrVal_3668)) .cse9 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse12 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse11 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse10 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse10 v_ArrVal_3658) .cse11 v_ArrVal_3661) .cse12 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse10 v_ArrVal_3666)) .cse11 v_ArrVal_3668)) .cse12 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28)))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-03-16 05:22:43,377 WARN L228 SmtUtils]: Spent 12.01s on a formula simplification. DAG size of input: 115 DAG size of output: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-16 05:22:45,116 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 141 |c_~#cache~0.offset|)) (.cse1 (+ 140 |c_~#cache~0.offset|)) (.cse0 (select |c_#race| |c_~#cache~0.base|)) (.cse3 (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse4 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse6 (+ 142 |c_~#cache~0.offset|)) (.cse2 (+ 143 |c_~#cache~0.offset|))) (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (= (select .cse0 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 .cse2) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (not (= (+ 140 |c_~#cache~0.offset| .cse3) 0)) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (= (select .cse4 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select .cse4 .cse2)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (select .cse0 .cse5) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse4 .cse5) |c_ULTIMATE.start_main_#t~nondet41#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (not (= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) .cse1)) (not (= (+ 142 |c_~#cache~0.offset| .cse3) 0)) (not (= (+ 139 |c_~#cache~0.offset| .cse3) 0)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (not (= (+ 138 |c_~#cache~0.offset| .cse3) 0)) (= (select .cse0 .cse6) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (not (= (+ 141 |c_~#cache~0.offset| .cse3) 0)) (= (select .cse4 .cse6) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse2)))) is different from false [2022-03-16 05:22:47,055 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 141 |c_~#cache~0.offset|)) (.cse1 (+ 140 |c_~#cache~0.offset|)) (.cse0 (select |c_#race| |c_~#cache~0.base|)) (.cse3 (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse4 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse6 (+ 142 |c_~#cache~0.offset|)) (.cse2 (+ 143 |c_~#cache~0.offset|))) (and (= (select .cse0 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 .cse2) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= (+ 140 |c_~#cache~0.offset| .cse3) 0)) (= (select .cse4 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select .cse4 .cse2)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (select .cse0 .cse5) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse4 .cse5) |c_ULTIMATE.start_main_#t~nondet41#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (not (= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) .cse1)) (not (= (+ 142 |c_~#cache~0.offset| .cse3) 0)) (not (= (+ 139 |c_~#cache~0.offset| .cse3) 0)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (not (= (+ 138 |c_~#cache~0.offset| .cse3) 0)) (= (select .cse0 .cse6) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= (+ 141 |c_~#cache~0.offset| .cse3) 0)) (= (select .cse4 .cse6) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse2)) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))))) is different from false [2022-03-16 05:22:49,367 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 140 |c_~#cache~0.offset|)) (.cse17 (+ 141 |c_~#cache~0.offset|)) (.cse0 (select |c_#race| |c_~#cache~0.base|)) (.cse16 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse14 (+ 142 |c_~#cache~0.offset|)) (.cse15 (+ 143 |c_~#cache~0.offset|))) (and (<= |c_t_funThread1of1ForFork0_~i~0#1| 1) (= (select .cse0 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (and (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse4 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse2 v_ArrVal_3658) .cse3 v_ArrVal_3661) .cse4 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse2 v_ArrVal_3666)) .cse3 v_ArrVal_3668)) .cse4 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse7 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse6 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse5 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse5 v_ArrVal_3658) .cse6 v_ArrVal_3661) .cse7 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse5 v_ArrVal_3666)) .cse6 v_ArrVal_3668)) .cse7 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse10 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse9 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse8 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse8 v_ArrVal_3658) .cse9 v_ArrVal_3661) .cse10 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse8 v_ArrVal_3666)) .cse9 v_ArrVal_3668)) .cse10 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse13 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse12 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse11 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse11 v_ArrVal_3658) .cse12 v_ArrVal_3661) .cse13 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse11 v_ArrVal_3666)) .cse12 v_ArrVal_3668)) .cse13 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28)))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse14)) (= (select .cse0 .cse15) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (<= (div (+ (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) |c_~#cache~0.offset|) (- 28)) 1) (= (select .cse16 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select .cse16 .cse15)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse1)) (= (select .cse0 .cse17) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse17)) (= (select .cse16 .cse17) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 .cse14) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse16 .cse14) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse15)))) is different from false [2022-03-16 05:22:51,384 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (and (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse1 v_ArrVal_3658) .cse2 v_ArrVal_3661) .cse3 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse1 v_ArrVal_3666)) .cse2 v_ArrVal_3668)) .cse3 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse6 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse5 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse4 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse4 v_ArrVal_3658) .cse5 v_ArrVal_3661) .cse6 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse4 v_ArrVal_3666)) .cse5 v_ArrVal_3668)) .cse6 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse9 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse8 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse7 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse7 v_ArrVal_3658) .cse8 v_ArrVal_3661) .cse9 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse7 v_ArrVal_3666)) .cse8 v_ArrVal_3668)) .cse9 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse12 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse11 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse10 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse10 v_ArrVal_3658) .cse11 v_ArrVal_3661) .cse12 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse10 v_ArrVal_3666)) .cse11 v_ArrVal_3668)) .cse12 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28)))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (<= (div (+ (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) |c_~#cache~0.offset|) (- 28)) 1) (= |c_~#cache~0.base| 1) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-03-16 05:23:19,894 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse1 v_ArrVal_3658) .cse2 v_ArrVal_3661) .cse3 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse1 v_ArrVal_3666)) .cse2 v_ArrVal_3668)) .cse3 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse4 v_ArrVal_3658) .cse5 v_ArrVal_3661) .cse6 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse4 v_ArrVal_3666)) .cse5 v_ArrVal_3668)) .cse6 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse8 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse7 v_ArrVal_3658) .cse8 v_ArrVal_3661) .cse9 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse7 v_ArrVal_3666)) .cse8 v_ArrVal_3668)) .cse9 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (<= (div (+ |c_~#cache~0.offset| (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (- 28)) 1) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (and (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (let ((.cse12 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse11 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse10 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse10 v_ArrVal_3658) .cse11 v_ArrVal_3661) .cse12 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse10 v_ArrVal_3666)) .cse11 v_ArrVal_3668)) .cse12 v_ArrVal_3671)) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (let ((.cse15 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse14 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse13 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse13 v_ArrVal_3658) .cse14 v_ArrVal_3661) .cse15 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse13 v_ArrVal_3666)) .cse14 v_ArrVal_3668)) .cse15 v_ArrVal_3671)) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (store (let ((.cse18 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse17 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse16 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse16 v_ArrVal_3658) .cse17 v_ArrVal_3661) .cse18 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse16 v_ArrVal_3666)) .cse17 v_ArrVal_3668)) .cse18 v_ArrVal_3671)) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|))) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (let ((.cse21 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse20 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse19 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse19 v_ArrVal_3658) .cse20 v_ArrVal_3661) .cse21 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse19 v_ArrVal_3666)) .cse20 v_ArrVal_3668)) .cse21 v_ArrVal_3671)) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28)))) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46|))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse24 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse23 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse22 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse22 v_ArrVal_3658) .cse23 v_ArrVal_3661) .cse24 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse22 v_ArrVal_3666)) .cse23 v_ArrVal_3668)) .cse24 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-03-16 05:23:21,916 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_3658) .cse2 v_ArrVal_3661) .cse3 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse1 v_ArrVal_3666)) .cse2 v_ArrVal_3668)) .cse3 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| 1) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_3658) .cse5 v_ArrVal_3661) .cse6 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse4 v_ArrVal_3666)) .cse5 v_ArrVal_3668)) .cse6 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse8 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7 v_ArrVal_3658) .cse8 v_ArrVal_3661) .cse9 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse7 v_ArrVal_3666)) .cse8 v_ArrVal_3668)) .cse9 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse12 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse11 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse10 v_ArrVal_3658) .cse11 v_ArrVal_3661) .cse12 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse10 v_ArrVal_3666)) .cse11 v_ArrVal_3668)) .cse12 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))))) is different from false [2022-03-16 05:24:22,254 WARN L228 SmtUtils]: Spent 28.07s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-16 05:24:23,371 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (or (and (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_3672 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672)) |c_~#cache~0.base|) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672)) |c_~#cache~0.base|) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672)) |c_~#cache~0.base|) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672)) |c_~#cache~0.base|) (+ 143 |c_~#cache~0.offset|)))))))) is different from false [2022-03-16 05:24:25,469 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (<= (div (+ |c_~#cache~0.offset| (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (- 28)) 1) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (and (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (let ((.cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse1 v_ArrVal_3658) .cse2 v_ArrVal_3661) .cse3 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse1 v_ArrVal_3666)) .cse2 v_ArrVal_3668)) .cse3 v_ArrVal_3671)) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (let ((.cse6 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse5 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse4 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse4 v_ArrVal_3658) .cse5 v_ArrVal_3661) .cse6 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse4 v_ArrVal_3666)) .cse5 v_ArrVal_3668)) .cse6 v_ArrVal_3671)) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (store (let ((.cse9 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse8 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse7 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse7 v_ArrVal_3658) .cse8 v_ArrVal_3661) .cse9 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse7 v_ArrVal_3666)) .cse8 v_ArrVal_3668)) .cse9 v_ArrVal_3671)) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|))) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (let ((.cse12 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse11 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse10 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse10 v_ArrVal_3658) .cse11 v_ArrVal_3661) .cse12 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse10 v_ArrVal_3666)) .cse11 v_ArrVal_3668)) .cse12 v_ArrVal_3671)) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28)))) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46|))) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false Received shutdown request... [2022-03-16 05:24:57,756 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-16 05:24:57,756 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-16 05:24:57,756 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-16 05:24:57,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-16 05:24:57,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 05:24:57,957 WARN L594 AbstractCegarLoop]: Verification canceled: while executing DepthFirstTraversal. [2022-03-16 05:24:57,961 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2022-03-16 05:24:57,961 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2022-03-16 05:24:57,961 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2022-03-16 05:24:57,961 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2022-03-16 05:24:57,961 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 9 remaining) [2022-03-16 05:24:57,961 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2022-03-16 05:24:57,962 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2022-03-16 05:24:57,962 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2022-03-16 05:24:57,962 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2022-03-16 05:24:57,985 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-16 05:24:57,988 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-16 05:24:57,988 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-16 05:24:57,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 05:24:57 BasicIcfg [2022-03-16 05:24:57,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-16 05:24:57,996 INFO L158 Benchmark]: Toolchain (without parser) took 707239.52ms. Allocated memory was 204.5MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 154.8MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 6.0GB. Max. memory is 8.0GB. [2022-03-16 05:24:57,996 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 204.5MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-16 05:24:57,997 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.18ms. Allocated memory is still 204.5MB. Free memory was 154.6MB in the beginning and 164.5MB in the end (delta: -9.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-03-16 05:24:57,997 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.31ms. Allocated memory is still 204.5MB. Free memory was 164.5MB in the beginning and 161.5MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-16 05:24:57,997 INFO L158 Benchmark]: Boogie Preprocessor took 52.40ms. Allocated memory is still 204.5MB. Free memory was 161.5MB in the beginning and 159.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-16 05:24:57,997 INFO L158 Benchmark]: RCFGBuilder took 447.46ms. Allocated memory is still 204.5MB. Free memory was 159.4MB in the beginning and 144.0MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-03-16 05:24:57,997 INFO L158 Benchmark]: TraceAbstraction took 706019.32ms. Allocated memory was 204.5MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 143.3MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 6.0GB. Max. memory is 8.0GB. [2022-03-16 05:24:57,998 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.16ms. Allocated memory is still 204.5MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 618.18ms. Allocated memory is still 204.5MB. Free memory was 154.6MB in the beginning and 164.5MB in the end (delta: -9.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 94.31ms. Allocated memory is still 204.5MB. Free memory was 164.5MB in the beginning and 161.5MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.40ms. Allocated memory is still 204.5MB. Free memory was 161.5MB in the beginning and 159.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 447.46ms. Allocated memory is still 204.5MB. Free memory was 159.4MB in the beginning and 144.0MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 706019.32ms. Allocated memory was 204.5MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 143.3MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 6.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 940]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 940]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 937]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing DepthFirstTraversal. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 158 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 705.8s, OverallIterations: 20, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 575.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 239, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 124.9s InterpolantComputationTime, 5638 NumberOfCodeBlocks, 5285 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 6612 ConstructedInterpolants, 38 QuantifiedInterpolants, 25104 SizeOfPredicates, 50 NumberOfNonLiveVariables, 3371 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 37 InterpolantComputations, 14 PerfectInterpolantSequences, 17127/18871 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown [2022-03-16 05:24:58,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-03-16 05:24:58,303 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 !SESSION 2022-03-16 05:13:06.923 ----------------------------------------------- eclipse.buildId=unknown java.version=11.0.12 java.vendor=Debian BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks-Lazy-NoForkJoinOpt-wrwc.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/06-symbeq_03-funloop_simple.i Command-line arguments: -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks-Lazy-NoForkJoinOpt-wrwc.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/06-symbeq_03-funloop_simple.i !ENTRY org.eclipse.osgi 4 0 2022-03-16 05:24:58.456 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(/)[568]: java.io.FileNotFoundException: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c660fde09/.metadata/.plugins/org.eclipse.core.resources/.root/1.tree (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:298) at java.base/java.io.FileOutputStream.(FileOutputStream.java:237) at java.base/java.io.FileOutputStream.(FileOutputStream.java:187) at org.eclipse.core.internal.localstore.SafeFileOutputStream.(SafeFileOutputStream.java:55) at org.eclipse.core.internal.resources.SaveManager.saveTree(SaveManager.java:1381) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1168) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2333) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2322) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:191) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:657) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:594) at org.eclipse.equinox.launcher.Main.run(Main.java:1465) at org.eclipse.equinox.launcher.Main.main(Main.java:1438) An error has occurred. See the log file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c660fde09/.metadata/.log.