/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/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_26-alloc_region_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-44940e9-m [2022-11-09 16:50:08,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-09 16:50:08,871 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-09 16:50:08,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-09 16:50:08,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-09 16:50:08,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-09 16:50:08,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-09 16:50:08,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-09 16:50:08,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-09 16:50:08,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-09 16:50:08,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-09 16:50:08,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-09 16:50:08,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-09 16:50:08,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-09 16:50:08,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-09 16:50:08,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-09 16:50:08,931 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-09 16:50:08,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-09 16:50:08,933 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-09 16:50:08,934 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-09 16:50:08,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-09 16:50:08,940 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-09 16:50:08,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-09 16:50:08,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-09 16:50:08,952 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-09 16:50:08,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-09 16:50:08,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-09 16:50:08,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-09 16:50:08,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-09 16:50:08,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-09 16:50:08,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-09 16:50:08,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-09 16:50:08,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-09 16:50:08,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-09 16:50:08,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-09 16:50:08,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-09 16:50:08,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-09 16:50:08,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-09 16:50:08,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-09 16:50:08,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-09 16:50:08,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-09 16:50:08,963 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-09 16:50:08,996 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-09 16:50:08,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-09 16:50:08,996 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-09 16:50:08,996 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-09 16:50:08,997 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-09 16:50:08,997 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-09 16:50:08,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-09 16:50:08,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-09 16:50:08,998 INFO L138 SettingsManager]: * Use SBE=true [2022-11-09 16:50:08,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-09 16:50:08,998 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-09 16:50:08,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-09 16:50:08,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-09 16:50:08,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-09 16:50:08,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-09 16:50:08,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-09 16:50:09,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-09 16:50:09,001 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-09 16:50:09,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-09 16:50:09,001 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-09 16:50:09,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-09 16:50:09,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-09 16:50:09,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-09 16:50:09,002 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-09 16:50:09,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-09 16:50:09,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-09 16:50:09,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-09 16:50:09,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-09 16:50:09,007 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-09 16:50:09,007 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-09 16:50:09,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-09 16:50:09,007 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-09 16:50:09,008 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-09 16:50:09,008 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-09 16:50:09,008 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-09 16:50:09,008 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-09 16:50:09,009 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.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE 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-11-09 16:50:09,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-09 16:50:09,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-09 16:50:09,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-09 16:50:09,270 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-09 16:50:09,270 INFO L275 PluginConnector]: CDTParser initialized [2022-11-09 16:50:09,271 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_26-alloc_region_rc.i [2022-11-09 16:50:09,326 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/819f6c29b/be75216075234aa0b66679b2a60816bd/FLAG26092c1d0 [2022-11-09 16:50:09,851 INFO L306 CDTParser]: Found 1 translation units. [2022-11-09 16:50:09,852 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_26-alloc_region_rc.i [2022-11-09 16:50:09,873 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/819f6c29b/be75216075234aa0b66679b2a60816bd/FLAG26092c1d0 [2022-11-09 16:50:10,305 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/819f6c29b/be75216075234aa0b66679b2a60816bd [2022-11-09 16:50:10,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-09 16:50:10,310 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-09 16:50:10,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-09 16:50:10,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-09 16:50:10,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-09 16:50:10,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:50:10" (1/1) ... [2022-11-09 16:50:10,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1201b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:10, skipping insertion in model container [2022-11-09 16:50:10,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:50:10" (1/1) ... [2022-11-09 16:50:10,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-09 16:50:10,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-09 16:50:10,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-09 16:50:10,970 INFO L203 MainTranslator]: Completed pre-run [2022-11-09 16:50:11,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-09 16:50:11,085 INFO L208 MainTranslator]: Completed translation [2022-11-09 16:50:11,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:11 WrapperNode [2022-11-09 16:50:11,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-09 16:50:11,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-09 16:50:11,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-09 16:50:11,086 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-09 16:50:11,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:11" (1/1) ... [2022-11-09 16:50:11,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:11" (1/1) ... [2022-11-09 16:50:11,180 INFO L138 Inliner]: procedures = 370, calls = 51, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 241 [2022-11-09 16:50:11,180 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-09 16:50:11,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-09 16:50:11,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-09 16:50:11,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-09 16:50:11,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:11" (1/1) ... [2022-11-09 16:50:11,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:11" (1/1) ... [2022-11-09 16:50:11,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:11" (1/1) ... [2022-11-09 16:50:11,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:11" (1/1) ... [2022-11-09 16:50:11,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:11" (1/1) ... [2022-11-09 16:50:11,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:11" (1/1) ... [2022-11-09 16:50:11,247 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:11" (1/1) ... [2022-11-09 16:50:11,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:11" (1/1) ... [2022-11-09 16:50:11,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-09 16:50:11,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-09 16:50:11,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-09 16:50:11,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-09 16:50:11,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:11" (1/1) ... [2022-11-09 16:50:11,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-09 16:50:11,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 16:50:11,297 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-11-09 16:50:11,315 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-11-09 16:50:11,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-09 16:50:11,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-09 16:50:11,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-09 16:50:11,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-09 16:50:11,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-09 16:50:11,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-09 16:50:11,334 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-09 16:50:11,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-09 16:50:11,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-09 16:50:11,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-09 16:50:11,334 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-09 16:50:11,334 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-09 16:50:11,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-09 16:50:11,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-09 16:50:11,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-09 16:50:11,335 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-09 16:50:11,503 INFO L235 CfgBuilder]: Building ICFG [2022-11-09 16:50:11,505 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-09 16:50:12,010 INFO L276 CfgBuilder]: Performing block encoding [2022-11-09 16:50:12,020 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-09 16:50:12,020 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-09 16:50:12,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:50:12 BoogieIcfgContainer [2022-11-09 16:50:12,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-09 16:50:12,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-09 16:50:12,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-09 16:50:12,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-09 16:50:12,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:50:10" (1/3) ... [2022-11-09 16:50:12,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24bcb957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:50:12, skipping insertion in model container [2022-11-09 16:50:12,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:50:11" (2/3) ... [2022-11-09 16:50:12,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24bcb957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:50:12, skipping insertion in model container [2022-11-09 16:50:12,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:50:12" (3/3) ... [2022-11-09 16:50:12,036 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_26-alloc_region_rc.i [2022-11-09 16:50:12,044 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-09 16:50:12,052 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-09 16:50:12,053 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-11-09 16:50:12,053 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-09 16:50:12,204 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-09 16:50:12,259 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 16:50:12,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 16:50:12,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 16:50:12,264 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-11-09 16:50:12,274 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-11-09 16:50:12,303 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 16:50:12,315 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2022-11-09 16:50:12,321 INFO L357 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, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6780f465, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 16:50:12,321 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-09 16:50:13,589 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 16:50:13,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:50:13,594 INFO L85 PathProgramCache]: Analyzing trace with hash 337100362, now seen corresponding path program 1 times [2022-11-09 16:50:13,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:50:13,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645657984] [2022-11-09 16:50:13,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:50:13,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:50:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:50:14,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-11-09 16:50:14,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:50:14,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645657984] [2022-11-09 16:50:14,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645657984] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:50:14,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:50:14,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 16:50:14,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258646828] [2022-11-09 16:50:14,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:50:14,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 16:50:14,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:50:14,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 16:50:14,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 16:50:14,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:50:14,691 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:50:14,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 16:50:14,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:50:15,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:15,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-09 16:50:15,875 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 16:50:15,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:50:15,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1164186063, now seen corresponding path program 1 times [2022-11-09 16:50:15,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:50:15,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314798971] [2022-11-09 16:50:15,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:50:15,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:50:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:50:16,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 16:50:16,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:50:16,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314798971] [2022-11-09 16:50:16,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314798971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:50:16,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:50:16,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 16:50:16,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082729779] [2022-11-09 16:50:16,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:50:16,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 16:50:16,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:50:16,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 16:50:16,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 16:50:16,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:50:16,449 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:50:16,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 16:50:16,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:16,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:50:16,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:16,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:16,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-09 16:50:16,554 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 16:50:16,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:50:16,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1992822829, now seen corresponding path program 1 times [2022-11-09 16:50:16,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:50:16,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820091341] [2022-11-09 16:50:16,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:50:16,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:50:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:50:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 16:50:17,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:50:17,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820091341] [2022-11-09 16:50:17,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820091341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:50:17,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:50:17,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 16:50:17,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082622188] [2022-11-09 16:50:17,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:50:17,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 16:50:17,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:50:17,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 16:50:17,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 16:50:17,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:50:17,119 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:50:17,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 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-11-09 16:50:17,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:17,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:17,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:50:18,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:18,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:18,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:18,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-09 16:50:18,313 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 16:50:18,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:50:18,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1305679717, now seen corresponding path program 1 times [2022-11-09 16:50:18,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:50:18,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908017948] [2022-11-09 16:50:18,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:50:18,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:50:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:50:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 16:50:18,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:50:18,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908017948] [2022-11-09 16:50:18,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908017948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:50:18,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:50:18,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 16:50:18,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415551248] [2022-11-09 16:50:18,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:50:18,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 16:50:18,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:50:18,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 16:50:18,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 16:50:18,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:50:18,767 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:50:18,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.2) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 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-11-09 16:50:18,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:18,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:18,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:18,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:50:20,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:20,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:20,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:20,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:20,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-09 16:50:20,042 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 16:50:20,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:50:20,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1255392554, now seen corresponding path program 1 times [2022-11-09 16:50:20,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:50:20,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344219745] [2022-11-09 16:50:20,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:50:20,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:50:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:50:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 16:50:20,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:50:20,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344219745] [2022-11-09 16:50:20,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344219745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:50:20,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:50:20,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 16:50:20,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541998851] [2022-11-09 16:50:20,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:50:20,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 16:50:20,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:50:20,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 16:50:20,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 16:50:20,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:50:20,472 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:50:20,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.0) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 16:50:20,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:20,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:20,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:20,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:20,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:50:20,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:20,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:20,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:20,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:20,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:20,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-09 16:50:20,639 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 16:50:20,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:50:20,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1753638682, now seen corresponding path program 1 times [2022-11-09 16:50:20,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:50:20,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831230942] [2022-11-09 16:50:20,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:50:20,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:50:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:50:21,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 16:50:21,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:50:21,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831230942] [2022-11-09 16:50:21,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831230942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:50:21,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:50:21,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 16:50:21,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840277227] [2022-11-09 16:50:21,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:50:21,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 16:50:21,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:50:21,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 16:50:21,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 16:50:21,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:50:21,086 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:50:21,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 28.2) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 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-11-09 16:50:21,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:21,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:21,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:21,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:21,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:21,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:50:22,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:22,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:22,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:22,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:22,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:22,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:22,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-09 16:50:22,402 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 16:50:22,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:50:22,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2016257045, now seen corresponding path program 1 times [2022-11-09 16:50:22,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:50:22,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670738804] [2022-11-09 16:50:22,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:50:22,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:50:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:50:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 16:50:22,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:50:22,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670738804] [2022-11-09 16:50:22,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670738804] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:50:22,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:50:22,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 16:50:22,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077540468] [2022-11-09 16:50:22,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:50:22,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 16:50:22,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:50:22,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 16:50:22,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 16:50:22,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:50:22,935 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:50:22,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.8) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 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-11-09 16:50:22,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:22,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:22,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:22,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:22,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:22,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:22,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:50:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:23,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:23,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-09 16:50:23,076 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 16:50:23,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:50:23,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1673452426, now seen corresponding path program 1 times [2022-11-09 16:50:23,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:50:23,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880954955] [2022-11-09 16:50:23,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:50:23,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:50:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:50:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 16:50:24,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:50:24,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880954955] [2022-11-09 16:50:24,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880954955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:50:24,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:50:24,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-09 16:50:24,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859419381] [2022-11-09 16:50:24,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:50:24,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-09 16:50:24,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:50:24,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-09 16:50:24,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-11-09 16:50:24,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:50:24,048 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:50:24,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 12.461538461538462) internal successors, (162), 14 states have internal predecessors, (162), 0 states have call successors, (0), 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-11-09 16:50:24,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:24,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:24,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:24,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:24,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:24,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:24,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:24,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:50:24,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:24,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:24,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:24,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:24,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:24,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:24,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:24,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 16:50:24,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-09 16:50:24,885 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 16:50:24,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:50:24,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1664259767, now seen corresponding path program 1 times [2022-11-09 16:50:24,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:50:24,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016364570] [2022-11-09 16:50:24,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:50:24,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:50:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:50:26,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 16:50:26,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:50:26,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016364570] [2022-11-09 16:50:26,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016364570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:50:26,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:50:26,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-11-09 16:50:26,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859298489] [2022-11-09 16:50:26,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:50:26,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-09 16:50:26,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:50:26,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-09 16:50:26,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2022-11-09 16:50:26,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:50:26,785 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:50:26,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 8.409090909090908) internal successors, (185), 23 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 16:50:26,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:26,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:26,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:26,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:26,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:26,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:26,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:26,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 16:50:26,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:50:28,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:28,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:28,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:28,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:28,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:28,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:28,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:28,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 16:50:28,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-09 16:50:28,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-09 16:50:28,476 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 16:50:28,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:50:28,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1273044749, now seen corresponding path program 1 times [2022-11-09 16:50:28,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:50:28,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220244372] [2022-11-09 16:50:28,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:50:28,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:50:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:50:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 16:50:30,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:50:30,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220244372] [2022-11-09 16:50:30,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220244372] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:50:30,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:50:30,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-09 16:50:30,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946083307] [2022-11-09 16:50:30,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:50:30,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-09 16:50:30,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:50:30,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-09 16:50:30,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2022-11-09 16:50:30,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:50:30,568 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:50:30,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 8.347826086956522) internal successors, (192), 24 states have internal predecessors, (192), 0 states have call successors, (0), 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-11-09 16:50:30,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:30,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:30,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:30,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:30,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:30,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:30,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:30,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 16:50:30,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-09 16:50:30,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:50:32,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:32,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:32,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:32,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:32,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:32,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:32,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:32,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 16:50:32,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-09 16:50:32,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 16:50:32,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-09 16:50:32,886 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 16:50:32,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:50:32,886 INFO L85 PathProgramCache]: Analyzing trace with hash -15802286, now seen corresponding path program 1 times [2022-11-09 16:50:32,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:50:32,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580119947] [2022-11-09 16:50:32,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:50:32,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:50:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:50:35,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 16:50:35,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:50:35,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580119947] [2022-11-09 16:50:35,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580119947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:50:35,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:50:35,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-11-09 16:50:35,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219099823] [2022-11-09 16:50:35,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:50:35,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-09 16:50:35,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:50:35,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-09 16:50:35,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2022-11-09 16:50:35,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:50:35,942 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:50:35,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 8.148148148148149) internal successors, (220), 28 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 16:50:35,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:35,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:35,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:35,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:35,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:35,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:35,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:35,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 16:50:35,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-09 16:50:35,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 16:50:35,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:50:38,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:50:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 16:50:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-09 16:50:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 16:50:38,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-09 16:50:38,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-09 16:50:38,372 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 16:50:38,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:50:38,372 INFO L85 PathProgramCache]: Analyzing trace with hash 140542723, now seen corresponding path program 1 times [2022-11-09 16:50:38,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:50:38,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674053480] [2022-11-09 16:50:38,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:50:38,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:50:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:50:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 16:50:46,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:50:46,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674053480] [2022-11-09 16:50:46,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674053480] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 16:50:46,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532114193] [2022-11-09 16:50:46,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:50:46,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 16:50:46,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 16:50:46,258 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-11-09 16:50:46,262 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-11-09 16:50:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:50:46,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 185 conjunts are in the unsatisfiable core [2022-11-09 16:50:46,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 16:50:46,895 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-09 16:50:46,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 18 [2022-11-09 16:50:46,983 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-09 16:50:46,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-09 16:50:47,089 INFO L390 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-11-09 16:50:47,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2022-11-09 16:50:48,024 INFO L356 Elim1Store]: treesize reduction 62, result has 41.5 percent of original size [2022-11-09 16:50:48,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 case distinctions, treesize of input 37 treesize of output 71 [2022-11-09 16:50:50,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-11-09 16:50:50,330 INFO L390 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-11-09 16:50:51,177 INFO L390 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 14 treesize of output 16 [2022-11-09 16:50:51,183 INFO L390 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 14 treesize of output 16 [2022-11-09 16:50:51,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-11-09 16:50:51,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 16:50:51,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-11-09 16:50:51,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 16:50:51,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 16:50:51,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-09 16:50:51,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 16:50:51,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 16:50:51,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 16:50:51,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-09 16:50:52,081 INFO L356 Elim1Store]: treesize reduction 8, result has 89.0 percent of original size [2022-11-09 16:50:52,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 44 treesize of output 98 [2022-11-09 16:50:52,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 16:50:52,686 INFO L390 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 14 treesize of output 16 [2022-11-09 16:50:52,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 16:50:52,696 INFO L390 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 14 treesize of output 16 [2022-11-09 16:50:52,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:52,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:52,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:52,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:52,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 16:50:52,952 INFO L390 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 14 treesize of output 16 [2022-11-09 16:50:52,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 16:50:52,972 INFO L390 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 14 treesize of output 16 [2022-11-09 16:50:53,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:53,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:53,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:53,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:53,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 16:50:53,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:53,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 16:50:53,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:53,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 16:50:53,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:54,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 16:50:54,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:54,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-09 16:50:54,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-09 16:50:54,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:54,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:54,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:54,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:54,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2022-11-09 16:50:54,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-11-09 16:50:54,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 16:50:54,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:54,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 16:50:54,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:54,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 16:50:54,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:54,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:55,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:55,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:55,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:55,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:55,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:55,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:55,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:55,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:55,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:55,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:56,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:56,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:56,144 INFO L356 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2022-11-09 16:50:56,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 37 [2022-11-09 16:50:56,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2022-11-09 16:50:56,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:56,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:56,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:56,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 16:50:56,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 16:50:56,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 16:50:56,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 16:50:56,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 16:50:56,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 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-11-09 16:50:56,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 16:50:56,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 16:50:57,143 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem52#1.offset| 4))) (and (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179))) (store .cse0 |c_ULTIMATE.start_main_#t~mem52#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem52#1.base|) .cse1 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2180 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179))) (store .cse2 |c_ULTIMATE.start_main_#t~mem52#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem52#1.base|) .cse1 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)))) (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2180 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179))) (store .cse3 |c_ULTIMATE.start_main_#t~mem52#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem52#1.base|) .cse1 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2180 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179))) (store .cse4 |c_ULTIMATE.start_main_#t~mem52#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem52#1.base|) .cse1 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)))))) is different from false [2022-11-09 16:50:57,195 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~p~1#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base|) .cse6)) (.cse2 (+ 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base|) .cse6)))) (and (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179))) (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|))))) is different from false [2022-11-09 16:50:57,401 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_#t~mem49#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem49#1.base|) .cse6)) (.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem49#1.base|) .cse6) 4))) (and (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem49#1.base| v_ArrVal_2179))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_#t~mem49#1.base| v_ArrVal_2179))) (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2180 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_#t~mem49#1.base| v_ArrVal_2179))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)))) (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_#t~mem49#1.base| v_ArrVal_2179))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|))))) is different from false [2022-11-09 16:50:57,429 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_#t~mem49#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem49#1.base|) .cse6)) (.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem49#1.base|) .cse6) 4))) (and (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse0 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_#t~mem49#1.base| v_ArrVal_2179))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse3 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_#t~mem49#1.base| v_ArrVal_2179))) (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse4 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_#t~mem49#1.base| v_ArrVal_2179))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)))) (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_#t~mem49#1.base| v_ArrVal_2179))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|))))) is different from false [2022-11-09 16:50:57,486 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$.offset| |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse3) .cse7)) (.cse2 (+ (select (select |c_#memory_$Pointer$.offset| .cse3) .cse7) 4))) (and (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse0 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)))) (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse4 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse5 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)))) (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse6 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|)))))) is different from false [2022-11-09 16:50:57,581 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$.offset| |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse3) .cse7)) (.cse2 (+ (select (select |c_#memory_$Pointer$.offset| .cse3) .cse7) 4))) (and (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= (select (select (let ((.cse0 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= (select (select (let ((.cse6 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|))))) is different from false [2022-11-09 16:51:00,101 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.offset|))) (.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (let ((.cse3 (select (select .cse9 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse8 (+ (select (select .cse7 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse1 (select (select .cse9 .cse3) .cse8)) (.cse2 (+ 4 (select (select .cse7 .cse3) .cse8)))) (and (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse0 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)))) (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= (select (select (let ((.cse4 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse5 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= (select (select (let ((.cse6 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))))) is different from false [2022-11-09 16:51:00,283 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base|))) (and (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= (select (select (let ((.cse8 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse5 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse10 .cse8 |c_ULTIMATE.start_insert_#t~mem32#1.base|)))) (store .cse9 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse9 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse8 |c_ULTIMATE.start_insert_#t~mem32#1.offset|)))) (store .cse6 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse6 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse4 (+ (select (select .cse2 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse3 (select (select .cse5 |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse0 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179)) (.cse1 (select (select .cse5 .cse3) .cse4))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 .cse3) .cse4) 4) v_ArrVal_2180)))))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= (select (select (let ((.cse18 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse16 (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse10 .cse18 |c_ULTIMATE.start_insert_#t~mem32#1.base|)))) (store .cse19 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse19 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse13 (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse18 |c_ULTIMATE.start_insert_#t~mem32#1.offset|)))) (store .cse17 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse17 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse15 (+ (select (select .cse13 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse14 (select (select .cse16 |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse11 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse14 v_ArrVal_2179)) (.cse12 (select (select .cse16 .cse14) .cse15))) (store .cse11 .cse12 (store (select .cse11 .cse12) (+ (select (select .cse13 .cse14) .cse15) 4) v_ArrVal_2180)))))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse27 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse25 (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse10 .cse27 |c_ULTIMATE.start_insert_#t~mem32#1.base|)))) (store .cse28 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse28 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse22 (let ((.cse26 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse27 |c_ULTIMATE.start_insert_#t~mem32#1.offset|)))) (store .cse26 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse26 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse24 (+ (select (select .cse22 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse23 (select (select .cse25 |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse20 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse23 v_ArrVal_2179)) (.cse21 (select (select .cse25 .cse23) .cse24))) (store .cse20 .cse21 (store (select .cse20 .cse21) (+ (select (select .cse22 .cse23) .cse24) 4) v_ArrVal_2180)))))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)))) (forall ((|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= (select (select (let ((.cse36 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse34 (let ((.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse10 .cse36 |c_ULTIMATE.start_insert_#t~mem32#1.base|)))) (store .cse37 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse37 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse31 (let ((.cse35 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse36 |c_ULTIMATE.start_insert_#t~mem32#1.offset|)))) (store .cse35 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse35 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse33 (+ (select (select .cse31 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse32 (select (select .cse34 |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse29 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse32 v_ArrVal_2179)) (.cse30 (select (select .cse34 .cse32) .cse33))) (store .cse29 .cse30 (store (select .cse29 .cse30) (+ (select (select .cse31 .cse32) .cse33) 4) v_ArrVal_2180)))))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))) is different from false [2022-11-09 16:51:02,364 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base|))) (and (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse8 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse5 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse10 .cse8 |c_ULTIMATE.start_insert_#t~mem32#1.base|)))) (store .cse9 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse9 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse8 |c_ULTIMATE.start_insert_#t~mem32#1.offset|)))) (store .cse6 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse6 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse4 (+ (select (select .cse2 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse3 (select (select .cse5 |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse0 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179)) (.cse1 (select (select .cse5 .cse3) .cse4))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 .cse3) .cse4) 4) v_ArrVal_2180)))))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse18 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse16 (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse10 .cse18 |c_ULTIMATE.start_insert_#t~mem32#1.base|)))) (store .cse19 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse19 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse13 (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse18 |c_ULTIMATE.start_insert_#t~mem32#1.offset|)))) (store .cse17 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse17 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse15 (+ (select (select .cse13 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse14 (select (select .cse16 |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse11 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse14 v_ArrVal_2179)) (.cse12 (select (select .cse16 .cse14) .cse15))) (store .cse11 .cse12 (store (select .cse11 .cse12) (+ (select (select .cse13 .cse14) .cse15) 4) v_ArrVal_2180)))))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)))) (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= (select (select (let ((.cse27 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse25 (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse10 .cse27 |c_ULTIMATE.start_insert_#t~mem32#1.base|)))) (store .cse28 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse28 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse22 (let ((.cse26 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse27 |c_ULTIMATE.start_insert_#t~mem32#1.offset|)))) (store .cse26 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse26 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse24 (+ (select (select .cse22 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse23 (select (select .cse25 |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse20 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse23 v_ArrVal_2179)) (.cse21 (select (select .cse25 .cse23) .cse24))) (store .cse20 .cse21 (store (select .cse20 .cse21) (+ (select (select .cse22 .cse23) .cse24) 4) v_ArrVal_2180)))))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse36 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse34 (let ((.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse10 .cse36 |c_ULTIMATE.start_insert_#t~mem32#1.base|)))) (store .cse37 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse37 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse31 (let ((.cse35 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse36 |c_ULTIMATE.start_insert_#t~mem32#1.offset|)))) (store .cse35 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse35 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse33 (+ (select (select .cse31 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse32 (select (select .cse34 |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse29 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse32 v_ArrVal_2179)) (.cse30 (select (select .cse34 .cse32) .cse33))) (store .cse29 .cse30 (store (select .cse29 .cse30) (+ (select (select .cse31 .cse32) .cse33) 4) v_ArrVal_2180)))))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)))))) is different from false [2022-11-09 16:51:03,254 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base|)) (.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset|)) (.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base|)) (.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset|))) (and (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= (select (select (let ((.cse8 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse5 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse11 .cse8 .cse12)))) (store .cse10 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse10 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse8 .cse9)))) (store .cse6 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse6 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse4 (+ (select (select .cse2 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse3 (select (select .cse5 |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse0 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179)) (.cse1 (select (select .cse5 .cse3) .cse4))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 .cse3) .cse4) 4) v_ArrVal_2180)))))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= (select (select (let ((.cse20 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse18 (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse11 .cse20 .cse12)))) (store .cse21 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse21 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse15 (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse20 .cse9)))) (store .cse19 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse19 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse17 (+ (select (select .cse15 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse16 (select (select .cse18 |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse13 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse16 v_ArrVal_2179)) (.cse14 (select (select .cse18 .cse16) .cse17))) (store .cse13 .cse14 (store (select .cse13 .cse14) (+ (select (select .cse15 .cse16) .cse17) 4) v_ArrVal_2180)))))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse29 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse27 (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse11 .cse29 .cse12)))) (store .cse30 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse30 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse24 (let ((.cse28 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse29 .cse9)))) (store .cse28 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse28 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse26 (+ (select (select .cse24 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse25 (select (select .cse27 |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse22 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse25 v_ArrVal_2179)) (.cse23 (select (select .cse27 .cse25) .cse26))) (store .cse22 .cse23 (store (select .cse22 .cse23) (+ (select (select .cse24 .cse25) .cse26) 4) v_ArrVal_2180)))))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)))) (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= (select (select (let ((.cse38 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse36 (let ((.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse11 .cse38 .cse12)))) (store .cse39 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse39 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse33 (let ((.cse37 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse38 .cse9)))) (store .cse37 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse37 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse35 (+ (select (select .cse33 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse34 (select (select .cse36 |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse31 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse34 v_ArrVal_2179)) (.cse32 (select (select .cse36 .cse34) .cse35))) (store .cse31 .cse32 (store (select .cse31 .cse32) (+ (select (select .cse33 .cse34) .cse35) 4) v_ArrVal_2180)))))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))) is different from false [2022-11-09 16:51:05,339 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base|)) (.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset|)) (.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base|)) (.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset|))) (and (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse8 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse5 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse11 .cse8 .cse12)))) (store .cse10 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse10 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse8 .cse9)))) (store .cse6 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse6 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse4 (+ (select (select .cse2 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse3 (select (select .cse5 |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse0 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179)) (.cse1 (select (select .cse5 .cse3) .cse4))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 .cse3) .cse4) 4) v_ArrVal_2180)))))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse20 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse18 (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse11 .cse20 .cse12)))) (store .cse21 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse21 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse15 (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse20 .cse9)))) (store .cse19 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse19 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse17 (+ (select (select .cse15 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse16 (select (select .cse18 |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse13 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse16 v_ArrVal_2179)) (.cse14 (select (select .cse18 .cse16) .cse17))) (store .cse13 .cse14 (store (select .cse13 .cse14) (+ (select (select .cse15 .cse16) .cse17) 4) v_ArrVal_2180)))))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= (select (select (let ((.cse29 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse27 (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse11 .cse29 .cse12)))) (store .cse30 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse30 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse24 (let ((.cse28 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse29 .cse9)))) (store .cse28 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse28 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse26 (+ (select (select .cse24 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse25 (select (select .cse27 |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse22 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse25 v_ArrVal_2179)) (.cse23 (select (select .cse27 .cse25) .cse26))) (store .cse22 .cse23 (store (select .cse22 .cse23) (+ (select (select .cse24 .cse25) .cse26) 4) v_ArrVal_2180)))))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse38 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse36 (let ((.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse11 .cse38 .cse12)))) (store .cse39 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse39 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse33 (let ((.cse37 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse38 .cse9)))) (store .cse37 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse37 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse35 (+ (select (select .cse33 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse34 (select (select .cse36 |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse31 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse34 v_ArrVal_2179)) (.cse32 (select (select .cse36 .cse34) .cse35))) (store .cse31 .cse32 (store (select .cse31 .cse32) (+ (select (select .cse33 .cse34) .cse35) 4) v_ArrVal_2180)))))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)))))) is different from false [2022-11-09 16:51:05,466 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_#in~p#1.base|)) (.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset|)) (.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_#in~p#1.base|)) (.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset|))) (and (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse8 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse5 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse11 .cse8 .cse12)))) (store .cse10 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse10 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_#in~p#1.base|)))) (.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse7 .cse8 .cse9)))) (store .cse6 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse6 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse4 (+ (select (select .cse2 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse3 (select (select .cse5 |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse0 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_#in~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179)) (.cse1 (select (select .cse5 .cse3) .cse4))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select .cse2 .cse3) .cse4) 4) v_ArrVal_2180)))))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)))) (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse20 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse18 (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse11 .cse20 .cse12)))) (store .cse21 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse21 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_#in~p#1.base|)))) (.cse15 (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse7 .cse20 .cse9)))) (store .cse19 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse19 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse17 (+ (select (select .cse15 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse16 (select (select .cse18 |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse13 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_#in~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse16 v_ArrVal_2179)) (.cse14 (select (select .cse18 .cse16) .cse17))) (store .cse13 .cse14 (store (select .cse13 .cse14) (+ (select (select .cse15 .cse16) .cse17) 4) v_ArrVal_2180)))))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse29 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse27 (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse11 .cse29 .cse12)))) (store .cse30 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse30 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_#in~p#1.base|)))) (.cse24 (let ((.cse28 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse7 .cse29 .cse9)))) (store .cse28 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse28 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse26 (+ (select (select .cse24 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse25 (select (select .cse27 |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse22 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_#in~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse25 v_ArrVal_2179)) (.cse23 (select (select .cse27 .cse25) .cse26))) (store .cse22 .cse23 (store (select .cse22 .cse23) (+ (select (select .cse24 .cse25) .cse26) 4) v_ArrVal_2180)))))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (= (select (select (let ((.cse38 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse36 (let ((.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse11 .cse38 .cse12)))) (store .cse39 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse39 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_#in~p#1.base|)))) (.cse33 (let ((.cse37 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse7 .cse38 .cse9)))) (store .cse37 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse37 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse35 (+ (select (select .cse33 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse34 (select (select .cse36 |c_~#A~0.base|) |c_~#A~0.offset|))) (let ((.cse31 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_#in~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse34 v_ArrVal_2179)) (.cse32 (select (select .cse36 .cse34) .cse35))) (store .cse31 .cse32 (store (select .cse31 .cse32) (+ (select (select .cse33 .cse34) .cse35) 4) v_ArrVal_2180)))))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))) is different from false [2022-11-09 16:51:05,627 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_~#A~0.base|) |c_~#A~0.offset|))) (and (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse4 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse0 (store (store (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse1 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse4 .cse8)))) (store .cse6 |c_~#A~0.base| (store (select .cse6 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse4))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse3 .cse4 .cse5)))) (store .cse2 |c_~#A~0.base| (store (select .cse2 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse4) 4) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse12 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse9 (store (store (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse10 (select (select (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse12 .cse8)))) (store .cse13 |c_~#A~0.base| (store (select .cse13 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse12))) (store .cse9 .cse10 (store (select .cse9 .cse10) (+ (select (select (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse3 .cse12 .cse5)))) (store .cse11 |c_~#A~0.base| (store (select .cse11 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse12) 4) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse17 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse14 (store (store (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse15 (select (select (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse17 .cse8)))) (store .cse18 |c_~#A~0.base| (store (select .cse18 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse17))) (store .cse14 .cse15 (store (select .cse14 .cse15) (+ (select (select (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse3 .cse17 .cse5)))) (store .cse16 |c_~#A~0.base| (store (select .cse16 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse17) 4) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)))) (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse22 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse19 (store (store (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse20 (select (select (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse22 .cse8)))) (store .cse23 |c_~#A~0.base| (store (select .cse23 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse22))) (store .cse19 .cse20 (store (select .cse19 .cse20) (+ (select (select (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse3 .cse22 .cse5)))) (store .cse21 |c_~#A~0.base| (store (select .cse21 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse22) 4) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)))))) is different from false [2022-11-09 16:51:06,068 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_~#A~0.base|) |c_~#A~0.offset|))) (and (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse4 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse0 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse1 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse4 .cse8)))) (store .cse6 |c_~#A~0.base| (store (select .cse6 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse4))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse3 .cse4 .cse5)))) (store .cse2 |c_~#A~0.base| (store (select .cse2 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse4) 4) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)))) (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse12 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse9 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse10 (select (select (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse12 .cse8)))) (store .cse13 |c_~#A~0.base| (store (select .cse13 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse12))) (store .cse9 .cse10 (store (select .cse9 .cse10) (+ (select (select (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse3 .cse12 .cse5)))) (store .cse11 |c_~#A~0.base| (store (select .cse11 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse12) 4) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse17 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse14 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse15 (select (select (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse17 .cse8)))) (store .cse18 |c_~#A~0.base| (store (select .cse18 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse17))) (store .cse14 .cse15 (store (select .cse14 .cse15) (+ (select (select (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse3 .cse17 .cse5)))) (store .cse16 |c_~#A~0.base| (store (select .cse16 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse17) 4) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse22 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse19 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse20 (select (select (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse22 .cse8)))) (store .cse23 |c_~#A~0.base| (store (select .cse23 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse22))) (store .cse19 .cse20 (store (select .cse19 .cse20) (+ (select (select (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse3 .cse22 .cse5)))) (store .cse21 |c_~#A~0.base| (store (select .cse21 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse22) 4) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))) is different from false [2022-11-09 16:51:06,288 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse4 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse0 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse1 (select (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2139))) (store .cse6 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~p~1#1.base|) .cse4 (select (select .cse6 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse5 |c_~#A~0.base| (store (select .cse5 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse4))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2138))) (store .cse3 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~p~1#1.base|) .cse4 (select (select .cse3 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse2 |c_~#A~0.base| (store (select .cse2 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse4) 4) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse11 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse7 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse8 (select (select (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2139))) (store .cse13 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~p~1#1.base|) .cse11 (select (select .cse13 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse12 |c_~#A~0.base| (store (select .cse12 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse11))) (store .cse7 .cse8 (store (select .cse7 .cse8) (+ (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2138))) (store .cse10 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~p~1#1.base|) .cse11 (select (select .cse10 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse9 |c_~#A~0.base| (store (select .cse9 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse11) 4) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse18 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse14 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse15 (select (select (let ((.cse19 (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2139))) (store .cse20 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~p~1#1.base|) .cse18 (select (select .cse20 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse19 |c_~#A~0.base| (store (select .cse19 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse18))) (store .cse14 .cse15 (store (select .cse14 .cse15) (+ (select (select (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2138))) (store .cse17 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~p~1#1.base|) .cse18 (select (select .cse17 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse16 |c_~#A~0.base| (store (select .cse16 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse18) 4) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse25 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse21 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse22 (select (select (let ((.cse26 (let ((.cse27 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2139))) (store .cse27 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~p~1#1.base|) .cse25 (select (select .cse27 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse26 |c_~#A~0.base| (store (select .cse26 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse25))) (store .cse21 .cse22 (store (select .cse21 .cse22) (+ (select (select (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2138))) (store .cse24 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~p~1#1.base|) .cse25 (select (select .cse24 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse23 |c_~#A~0.base| (store (select .cse23 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse25) 4) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|))) is different from false [2022-11-09 16:51:06,730 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse4 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse0 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse1 (select (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2139))) (store .cse6 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~p~1#1.base|) .cse4 (select (select .cse6 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse5 |c_~#A~0.base| (store (select .cse5 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse4))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ 4 (select (select (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2138))) (store .cse3 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~p~1#1.base|) .cse4 (select (select .cse3 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse2 |c_~#A~0.base| (store (select .cse2 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse4)) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse11 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse7 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse8 (select (select (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2139))) (store .cse13 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~p~1#1.base|) .cse11 (select (select .cse13 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse12 |c_~#A~0.base| (store (select .cse12 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse11))) (store .cse7 .cse8 (store (select .cse7 .cse8) (+ 4 (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2138))) (store .cse10 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~p~1#1.base|) .cse11 (select (select .cse10 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse9 |c_~#A~0.base| (store (select .cse9 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse11)) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse18 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse14 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse15 (select (select (let ((.cse19 (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2139))) (store .cse20 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~p~1#1.base|) .cse18 (select (select .cse20 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse19 |c_~#A~0.base| (store (select .cse19 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse18))) (store .cse14 .cse15 (store (select .cse14 .cse15) (+ 4 (select (select (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2138))) (store .cse17 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~p~1#1.base|) .cse18 (select (select .cse17 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse16 |c_~#A~0.base| (store (select .cse16 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse18)) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse25 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse21 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse22 (select (select (let ((.cse26 (let ((.cse27 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2139))) (store .cse27 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~p~1#1.base|) .cse25 (select (select .cse27 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse26 |c_~#A~0.base| (store (select .cse26 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse25))) (store .cse21 .cse22 (store (select .cse21 .cse22) (+ 4 (select (select (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2138))) (store .cse24 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~p~1#1.base|) .cse25 (select (select .cse24 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse23 |c_~#A~0.base| (store (select .cse23 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse25)) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3))))) is different from false [2022-11-09 16:51:07,003 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse3 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse0 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse1 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2139 .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2139) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse4 |c_~#A~0.base| (store (select .cse4 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse3))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2138 .cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2138) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse2 |c_~#A~0.base| (store (select .cse2 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse3) 4) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)))) (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse8 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse5 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse6 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2139 .cse8 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2139) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse9 |c_~#A~0.base| (store (select .cse9 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse8))) (store .cse5 .cse6 (store (select .cse5 .cse6) (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2138 .cse8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2138) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse7 |c_~#A~0.base| (store (select .cse7 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse8) 4) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse13 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse10 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse11 (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2139 .cse13 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2139) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse14 |c_~#A~0.base| (store (select .cse14 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse13))) (store .cse10 .cse11 (store (select .cse10 .cse11) (+ (select (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2138 .cse13 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2138) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse12 |c_~#A~0.base| (store (select .cse12 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse13) 4) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse18 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse15 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse16 (select (select (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2139 .cse18 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2139) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse19 |c_~#A~0.base| (store (select .cse19 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse18))) (store .cse15 .cse16 (store (select .cse15 .cse16) (+ (select (select (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2138 .cse18 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2138) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse17 |c_~#A~0.base| (store (select .cse17 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse18) 4) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|)))) is different from false [2022-11-09 16:51:07,229 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse3 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse0 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2179)) (.cse1 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc46#1.base| (store v_ArrVal_2139 .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2139) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse4 |c_~#A~0.base| (store (select .cse4 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base|))) |c_ULTIMATE.start_main_#t~malloc46#1.base|) .cse3))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base| (store v_ArrVal_2138 .cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2138) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse2 |c_~#A~0.base| (store (select .cse2 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_#t~malloc46#1.base|) .cse3) 4) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse8 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse5 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2179)) (.cse6 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc46#1.base| (store v_ArrVal_2139 .cse8 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2139) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse9 |c_~#A~0.base| (store (select .cse9 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base|))) |c_ULTIMATE.start_main_#t~malloc46#1.base|) .cse8))) (store .cse5 .cse6 (store (select .cse5 .cse6) (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base| (store v_ArrVal_2138 .cse8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2138) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse7 |c_~#A~0.base| (store (select .cse7 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_#t~malloc46#1.base|) .cse8) 4) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (= (select (select (let ((.cse13 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse10 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2179)) (.cse11 (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc46#1.base| (store v_ArrVal_2139 .cse13 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2139) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse14 |c_~#A~0.base| (store (select .cse14 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base|))) |c_ULTIMATE.start_main_#t~malloc46#1.base|) .cse13))) (store .cse10 .cse11 (store (select .cse10 .cse11) (+ (select (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base| (store v_ArrVal_2138 .cse13 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2138) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse12 |c_~#A~0.base| (store (select .cse12 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_#t~malloc46#1.base|) .cse13) 4) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)) (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse18 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse15 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2179)) (.cse16 (select (select (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc46#1.base| (store v_ArrVal_2139 .cse18 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2139) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse19 |c_~#A~0.base| (store (select .cse19 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base|))) |c_ULTIMATE.start_main_#t~malloc46#1.base|) .cse18))) (store .cse15 .cse16 (store (select .cse15 .cse16) (+ (select (select (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base| (store v_ArrVal_2138 .cse18 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2138) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse17 |c_~#A~0.base| (store (select .cse17 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_#t~malloc46#1.base|) .cse18) 4) v_ArrVal_2180)))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3))))) is different from false [2022-11-09 16:52:47,752 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 16:52:47,753 INFO L390 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 227 treesize of output 220 [2022-11-09 16:52:48,133 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 16:52:48,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94074044364 treesize of output 79067086836 Received shutdown request... [2022-11-09 17:04:21,259 WARN L249 SmtUtils]: Removed 1 from assertion stack [2022-11-09 17:04:21,263 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr6ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2022-11-09 17:04:21,270 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-11-09 17:04:21,270 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-09 17:04:21,270 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-11-09 17:04:21,292 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-11-09 17:04:21,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-09 17:04:21,472 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 245 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-8-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-11-09 17:04:21,473 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2022-11-09 17:04:21,474 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2022-11-09 17:04:21,474 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2022-11-09 17:04:21,474 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2022-11-09 17:04:21,474 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2022-11-09 17:04:21,474 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2022-11-09 17:04:21,478 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-09 17:04:21,480 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2022-11-09 17:04:21,482 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-09 17:04:21,482 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-09 17:04:21,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 05:04:21 BasicIcfg [2022-11-09 17:04:21,484 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-09 17:04:21,485 INFO L158 Benchmark]: Toolchain (without parser) took 851175.89ms. Allocated memory was 186.6MB in the beginning and 1.0GB in the end (delta: 843.1MB). Free memory was 157.7MB in the beginning and 931.5MB in the end (delta: -773.8MB). Peak memory consumption was 656.0MB. Max. memory is 8.0GB. [2022-11-09 17:04:21,485 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 186.6MB. Free memory was 140.5MB in the beginning and 140.4MB in the end (delta: 73.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-11-09 17:04:21,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 774.43ms. Allocated memory is still 186.6MB. Free memory was 157.4MB in the beginning and 131.9MB in the end (delta: 25.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-11-09 17:04:21,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.16ms. Allocated memory is still 186.6MB. Free memory was 131.9MB in the beginning and 127.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-11-09 17:04:21,486 INFO L158 Benchmark]: Boogie Preprocessor took 70.70ms. Allocated memory is still 186.6MB. Free memory was 127.7MB in the beginning and 124.1MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-11-09 17:04:21,486 INFO L158 Benchmark]: RCFGBuilder took 770.17ms. Allocated memory was 186.6MB in the beginning and 235.9MB in the end (delta: 49.3MB). Free memory was 124.1MB in the beginning and 200.6MB in the end (delta: -76.5MB). Peak memory consumption was 27.0MB. Max. memory is 8.0GB. [2022-11-09 17:04:21,486 INFO L158 Benchmark]: TraceAbstraction took 849455.65ms. Allocated memory was 235.9MB in the beginning and 1.0GB in the end (delta: 793.8MB). Free memory was 199.5MB in the beginning and 931.5MB in the end (delta: -732.0MB). Peak memory consumption was 648.7MB. Max. memory is 8.0GB. [2022-11-09 17:04:21,487 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.56ms. Allocated memory is still 186.6MB. Free memory was 140.5MB in the beginning and 140.4MB in the end (delta: 73.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 774.43ms. Allocated memory is still 186.6MB. Free memory was 157.4MB in the beginning and 131.9MB in the end (delta: 25.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 94.16ms. Allocated memory is still 186.6MB. Free memory was 131.9MB in the beginning and 127.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 70.70ms. Allocated memory is still 186.6MB. Free memory was 127.7MB in the beginning and 124.1MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 770.17ms. Allocated memory was 186.6MB in the beginning and 235.9MB in the end (delta: 49.3MB). Free memory was 124.1MB in the beginning and 200.6MB in the end (delta: -76.5MB). Peak memory consumption was 27.0MB. Max. memory is 8.0GB. * TraceAbstraction took 849455.65ms. Allocated memory was 235.9MB in the beginning and 1.0GB in the end (delta: 793.8MB). Free memory was 199.5MB in the beginning and 931.5MB in the end (delta: -732.0MB). Peak memory consumption was 648.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6244, positive: 6024, positive conditional: 1299, positive unconditional: 4725, negative: 220, negative conditional: 101, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6158, positive: 6024, positive conditional: 1299, positive unconditional: 4725, negative: 134, negative conditional: 15, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6158, positive: 6024, positive conditional: 1299, positive unconditional: 4725, negative: 134, negative conditional: 15, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6356, positive: 6024, positive conditional: 165, positive unconditional: 5859, negative: 332, negative conditional: 33, negative unconditional: 299, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6356, positive: 6024, positive conditional: 165, positive unconditional: 5859, negative: 332, negative conditional: 31, negative unconditional: 301, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6356, positive: 6024, positive conditional: 165, positive unconditional: 5859, negative: 332, negative conditional: 31, negative unconditional: 301, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5068, positive: 4890, positive conditional: 165, positive unconditional: 4725, negative: 178, negative conditional: 23, negative unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5068, positive: 4721, positive conditional: 0, positive unconditional: 4721, negative: 347, negative conditional: 0, negative unconditional: 347, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 347, positive: 169, positive conditional: 165, positive unconditional: 4, negative: 173, negative conditional: 23, negative unconditional: 150, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6166, positive: 485, positive conditional: 437, positive unconditional: 49, negative: 455, negative conditional: 54, negative unconditional: 401, unknown: 5226, unknown conditional: 0, unknown unconditional: 5226] ], Cache Queries: [ total: 6356, positive: 1134, positive conditional: 0, positive unconditional: 1134, negative: 154, negative conditional: 8, negative unconditional: 146, unknown: 5068, unknown conditional: 188, unknown unconditional: 4880] , Statistics on independence cache: Total cache size (in pairs): 5068, Positive cache size: 4890, Positive conditional cache size: 165, Positive unconditional cache size: 4725, Negative cache size: 178, Negative conditional cache size: 23, Negative unconditional cache size: 155, Eliminated conditions: 2, Maximal queried relation: 4, Independence queries for same thread: 86 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 5.7s, Number of persistent set computation: 251, Number of trivial persistent sets: 222, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4844, positive: 4725, positive conditional: 0, positive unconditional: 4725, negative: 119, negative conditional: 0, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6244, positive: 6024, positive conditional: 1299, positive unconditional: 4725, negative: 220, negative conditional: 101, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6158, positive: 6024, positive conditional: 1299, positive unconditional: 4725, negative: 134, negative conditional: 15, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6158, positive: 6024, positive conditional: 1299, positive unconditional: 4725, negative: 134, negative conditional: 15, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6356, positive: 6024, positive conditional: 165, positive unconditional: 5859, negative: 332, negative conditional: 33, negative unconditional: 299, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6356, positive: 6024, positive conditional: 165, positive unconditional: 5859, negative: 332, negative conditional: 31, negative unconditional: 301, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6356, positive: 6024, positive conditional: 165, positive unconditional: 5859, negative: 332, negative conditional: 31, negative unconditional: 301, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5068, positive: 4890, positive conditional: 165, positive unconditional: 4725, negative: 178, negative conditional: 23, negative unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5068, positive: 4721, positive conditional: 0, positive unconditional: 4721, negative: 347, negative conditional: 0, negative unconditional: 347, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 347, positive: 169, positive conditional: 165, positive unconditional: 4, negative: 173, negative conditional: 23, negative unconditional: 150, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6166, positive: 485, positive conditional: 437, positive unconditional: 49, negative: 455, negative conditional: 54, negative unconditional: 401, unknown: 5226, unknown conditional: 0, unknown unconditional: 5226] ], Cache Queries: [ total: 6356, positive: 1134, positive conditional: 0, positive unconditional: 1134, negative: 154, negative conditional: 8, negative unconditional: 146, unknown: 5068, unknown conditional: 188, unknown unconditional: 4880] , Statistics on independence cache: Total cache size (in pairs): 5068, Positive cache size: 4890, Positive conditional cache size: 165, Positive unconditional cache size: 4725, Negative cache size: 178, Negative conditional cache size: 23, Negative unconditional cache size: 155, Eliminated conditions: 2, Maximal queried relation: 4, Independence queries for same thread: 86 - TimeoutResultAtElement [Line: 1244]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PartialOrderCegarLoop was analyzing trace of length 245 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-8-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 1228]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PartialOrderCegarLoop was analyzing trace of length 245 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-8-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 1229]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PartialOrderCegarLoop was analyzing trace of length 245 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-8-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 1232]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PartialOrderCegarLoop was analyzing trace of length 245 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-8-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 1232]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PartialOrderCegarLoop was analyzing trace of length 245 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-8-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 1233]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PartialOrderCegarLoop was analyzing trace of length 245 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-8-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 1244]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PartialOrderCegarLoop was analyzing trace of length 245 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-8-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 367 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 849.2s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 13.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 130, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 1604 NumberOfCodeBlocks, 1604 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1593 ConstructedInterpolants, 0 QuantifiedInterpolants, 15027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown