./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a8bcba962b15df67a0e136eef2e702f216cc120b7626a7b8dc8877f6ecaf3765 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 09:30:21,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:30:21,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:30:21,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:30:21,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:30:21,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:30:21,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:30:21,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:30:21,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:30:21,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:30:21,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:30:21,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:30:21,858 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:30:21,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:30:21,860 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:30:21,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:30:21,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:30:21,861 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:30:21,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:30:21,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:30:21,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:30:21,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:30:21,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:30:21,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:30:21,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:30:21,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:30:21,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:30:21,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:30:21,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:30:21,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:30:21,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:30:21,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:30:21,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:30:21,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:30:21,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:30:21,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:30:21,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:30:21,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:30:21,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:30:21,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:30:21,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:30:21,875 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2022-12-13 09:30:21,898 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:30:21,898 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:30:21,899 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 09:30:21,908 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 09:30:21,909 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 09:30:21,909 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 09:30:21,910 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:30:21,910 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:30:21,910 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:30:21,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:30:21,910 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:30:21,911 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 09:30:21,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:30:21,911 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:30:21,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:30:21,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:30:21,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:30:21,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:30:21,912 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-12-13 09:30:21,912 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:30:21,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:30:21,912 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:30:21,912 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:30:21,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:30:21,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:30:21,913 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:30:21,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:30:21,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:30:21,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:30:21,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:30:21,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:30:21,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:30:21,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:30:21,914 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-13 09:30:21,914 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-12-13 09:30:21,915 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-12-13 09:30:21,915 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 09:30:21,915 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-12-13 09:30:21,915 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-12-13 09:30:21,915 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a8bcba962b15df67a0e136eef2e702f216cc120b7626a7b8dc8877f6ecaf3765 [2022-12-13 09:30:22,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:30:22,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:30:22,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:30:22,125 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:30:22,126 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:30:22,127 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/../../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i [2022-12-13 09:30:24,693 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:30:24,891 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:30:24,891 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i [2022-12-13 09:30:24,899 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/data/ea944c763/66c9210e7c8d4083b579071c393ba122/FLAG749eacbb5 [2022-12-13 09:30:24,909 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/data/ea944c763/66c9210e7c8d4083b579071c393ba122 [2022-12-13 09:30:24,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:30:24,912 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 09:30:24,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:30:24,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:30:24,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:30:24,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:30:24" (1/1) ... [2022-12-13 09:30:24,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67487eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:24, skipping insertion in model container [2022-12-13 09:30:24,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:30:24" (1/1) ... [2022-12-13 09:30:24,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:30:24,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:30:25,218 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i[30726,30739] [2022-12-13 09:30:25,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:30:25,230 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:30:25,270 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i[30726,30739] [2022-12-13 09:30:25,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:30:25,296 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:30:25,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:25 WrapperNode [2022-12-13 09:30:25,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:30:25,298 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:30:25,298 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:30:25,298 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:30:25,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:25" (1/1) ... [2022-12-13 09:30:25,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:25" (1/1) ... [2022-12-13 09:30:25,340 INFO L138 Inliner]: procedures = 171, calls = 26, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 155 [2022-12-13 09:30:25,340 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:30:25,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:30:25,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:30:25,341 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:30:25,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:25" (1/1) ... [2022-12-13 09:30:25,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:25" (1/1) ... [2022-12-13 09:30:25,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:25" (1/1) ... [2022-12-13 09:30:25,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:25" (1/1) ... [2022-12-13 09:30:25,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:25" (1/1) ... [2022-12-13 09:30:25,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:25" (1/1) ... [2022-12-13 09:30:25,368 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:25" (1/1) ... [2022-12-13 09:30:25,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:25" (1/1) ... [2022-12-13 09:30:25,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:30:25,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:30:25,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:30:25,373 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:30:25,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:25" (1/1) ... [2022-12-13 09:30:25,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:30:25,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:30:25,399 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:30:25,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:30:25,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 09:30:25,432 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-12-13 09:30:25,432 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-12-13 09:30:25,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:30:25,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:30:25,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:30:25,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:30:25,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:30:25,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:30:25,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:30:25,433 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 09:30:25,519 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 09:30:25,520 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:30:25,755 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 09:30:25,838 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:30:25,838 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 09:30:25,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:30:25 BoogieIcfgContainer [2022-12-13 09:30:25,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:30:25,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:30:25,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:30:25,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:30:25,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:30:24" (1/3) ... [2022-12-13 09:30:25,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501324f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:30:25, skipping insertion in model container [2022-12-13 09:30:25,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:25" (2/3) ... [2022-12-13 09:30:25,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501324f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:30:25, skipping insertion in model container [2022-12-13 09:30:25,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:30:25" (3/3) ... [2022-12-13 09:30:25,845 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur.i [2022-12-13 09:30:25,851 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 09:30:25,859 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:30:25,859 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2022-12-13 09:30:25,859 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:30:25,903 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:30:25,933 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:30:25,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-12-13 09:30:25,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:30:25,934 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-12-13 09:30:25,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-12-13 09:30:25,967 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-12-13 09:30:25,975 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2022-12-13 09:30:25,979 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;@585ca067, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:30:25,979 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2022-12-13 09:30:26,184 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-12-13 09:30:26,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:26,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1052172634, now seen corresponding path program 1 times [2022-12-13 09:30:26,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:26,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80847731] [2022-12-13 09:30:26,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:26,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:26,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:26,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80847731] [2022-12-13 09:30:26,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80847731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:26,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:26,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:30:26,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962712708] [2022-12-13 09:30:26,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:26,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 09:30:26,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:26,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 09:30:26,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 09:30:26,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:26,354 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:26,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 32.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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-12-13 09:30:26,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:26,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:26,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:30:26,391 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-12-13 09:30:26,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:26,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1620699683, now seen corresponding path program 1 times [2022-12-13 09:30:26,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:26,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512713804] [2022-12-13 09:30:26,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:26,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:26,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:26,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:26,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512713804] [2022-12-13 09:30:26,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512713804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:26,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:26,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:30:26,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695497228] [2022-12-13 09:30:26,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:26,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:30:26,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:26,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:30:26,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:30:26,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:26,863 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:26,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 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-12-13 09:30:26,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:26,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:27,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:27,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:27,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:30:27,005 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err18ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-12-13 09:30:27,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:27,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1730938668, now seen corresponding path program 1 times [2022-12-13 09:30:27,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:27,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764343528] [2022-12-13 09:30:27,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:27,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:27,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:27,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:27,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764343528] [2022-12-13 09:30:27,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764343528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:27,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:27,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:30:27,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552851715] [2022-12-13 09:30:27,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:27,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:30:27,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:27,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:30:27,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:30:27,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:27,070 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:27,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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-12-13 09:30:27,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:27,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:27,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:27,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:27,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:27,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:27,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:30:27,200 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err8ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-12-13 09:30:27,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:27,200 INFO L85 PathProgramCache]: Analyzing trace with hash -97021038, now seen corresponding path program 1 times [2022-12-13 09:30:27,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:27,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232191878] [2022-12-13 09:30:27,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:27,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:27,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:27,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232191878] [2022-12-13 09:30:27,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232191878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:27,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:27,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:30:27,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758440081] [2022-12-13 09:30:27,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:27,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:30:27,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:27,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:30:27,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:30:27,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:27,275 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:27,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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-12-13 09:30:27,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:27,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:27,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:27,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:27,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:27,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:27,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:27,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:27,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:30:27,376 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-12-13 09:30:27,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:27,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1058301671, now seen corresponding path program 1 times [2022-12-13 09:30:27,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:27,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285987220] [2022-12-13 09:30:27,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:27,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:27,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:27,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285987220] [2022-12-13 09:30:27,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285987220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:27,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:27,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:30:27,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156014737] [2022-12-13 09:30:27,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:27,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:30:27,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:27,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:30:27,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:30:27,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:27,428 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:27,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:27,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:27,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:27,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:27,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:27,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:27,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:27,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:27,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:30:27,498 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err13ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-12-13 09:30:27,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:27,498 INFO L85 PathProgramCache]: Analyzing trace with hash 564665663, now seen corresponding path program 1 times [2022-12-13 09:30:27,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:27,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636544382] [2022-12-13 09:30:27,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:27,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:27,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:27,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636544382] [2022-12-13 09:30:27,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636544382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:27,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:27,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:30:27,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75856310] [2022-12-13 09:30:27,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:27,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:30:27,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:27,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:30:27,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:30:27,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:27,565 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:27,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 33.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-12-13 09:30:27,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:27,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:27,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:27,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:27,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:27,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:27,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:27,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:27,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:27,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:27,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:27,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:27,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:30:27,691 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err15ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-12-13 09:30:27,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:27,692 INFO L85 PathProgramCache]: Analyzing trace with hash 521380103, now seen corresponding path program 1 times [2022-12-13 09:30:27,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:27,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316043245] [2022-12-13 09:30:27,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:27,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:27,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:27,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:27,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:27,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316043245] [2022-12-13 09:30:27,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316043245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:27,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:27,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:30:27,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984929310] [2022-12-13 09:30:27,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:27,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:30:27,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:27,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:30:27,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:30:27,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:27,757 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:27,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 39.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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-12-13 09:30:27,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:27,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:27,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:27,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:27,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:27,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:27,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:28,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:28,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:28,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:28,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:28,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:28,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:28,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:28,005 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (18 of 19 remaining) [2022-12-13 09:30:28,006 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2022-12-13 09:30:28,006 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2022-12-13 09:30:28,006 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2022-12-13 09:30:28,006 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2022-12-13 09:30:28,007 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2022-12-13 09:30:28,007 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2022-12-13 09:30:28,007 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2022-12-13 09:30:28,007 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2022-12-13 09:30:28,007 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err18ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2022-12-13 09:30:28,007 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2022-12-13 09:30:28,008 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONDATA_RACE (7 of 19 remaining) [2022-12-13 09:30:28,008 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err11ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2022-12-13 09:30:28,008 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err12ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2022-12-13 09:30:28,008 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err13ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2022-12-13 09:30:28,008 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err14ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2022-12-13 09:30:28,009 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err15ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2022-12-13 09:30:28,009 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err16ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2022-12-13 09:30:28,009 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err17ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2022-12-13 09:30:28,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:30:28,022 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:28,023 INFO L307 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2022-12-13 09:30:28,028 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:30:28,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-12-13 09:30:28,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:30:28,061 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-12-13 09:30:28,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-12-13 09:30:28,064 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-12-13 09:30:28,065 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-12-13 09:30:28,065 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;@585ca067, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:30:28,065 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 09:30:28,150 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:30:28,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:28,151 INFO L85 PathProgramCache]: Analyzing trace with hash -198281364, now seen corresponding path program 1 times [2022-12-13 09:30:28,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:28,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078619807] [2022-12-13 09:30:28,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:28,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:30:28,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:30:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:30:28,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:30:28,180 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:30:28,180 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-12-13 09:30:28,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:30:28,181 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2022-12-13 09:30:28,182 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2022-12-13 09:30:28,182 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-12-13 09:30:28,182 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-12-13 09:30:28,217 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:30:28,220 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:30:28,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-12-13 09:30:28,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:30:28,221 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-12-13 09:30:28,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-12-13 09:30:28,225 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-12-13 09:30:28,225 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-12-13 09:30:28,226 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;@585ca067, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:30:28,226 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 09:30:28,371 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 09:30:28,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:28,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1025777769, now seen corresponding path program 1 times [2022-12-13 09:30:28,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:28,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066889449] [2022-12-13 09:30:28,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:28,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:30:28,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:30:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:30:28,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:30:28,390 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:30:28,390 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-12-13 09:30:28,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:30:28,391 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2022-12-13 09:30:28,392 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2022-12-13 09:30:28,392 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-12-13 09:30:28,392 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-12-13 09:30:28,437 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:30:28,441 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:30:28,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-12-13 09:30:28,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:30:28,442 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-12-13 09:30:28,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-12-13 09:30:28,445 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-12-13 09:30:28,446 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2022-12-13 09:30:28,446 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;@585ca067, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:30:28,446 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2022-12-13 09:30:28,649 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-12-13 09:30:28,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:28,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1898364219, now seen corresponding path program 1 times [2022-12-13 09:30:28,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:28,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248382740] [2022-12-13 09:30:28,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:28,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 09:30:28,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:28,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248382740] [2022-12-13 09:30:28,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248382740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:28,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:28,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:30:28,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821819041] [2022-12-13 09:30:28,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:28,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 09:30:28,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:28,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 09:30:28,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 09:30:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:28,668 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:28,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 36.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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-12-13 09:30:28,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:28,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:28,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:30:28,721 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-12-13 09:30:28,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:28,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1955760338, now seen corresponding path program 1 times [2022-12-13 09:30:28,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:28,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293451273] [2022-12-13 09:30:28,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:28,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 09:30:28,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:28,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293451273] [2022-12-13 09:30:28,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293451273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:28,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:28,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:30:28,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497940935] [2022-12-13 09:30:28,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:28,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:30:28,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:28,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:30:28,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:30:28,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:28,980 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:28,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 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-12-13 09:30:28,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:28,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:29,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:29,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:29,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:30:29,297 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err18ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-12-13 09:30:29,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:29,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1403958722, now seen corresponding path program 1 times [2022-12-13 09:30:29,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:29,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402951785] [2022-12-13 09:30:29,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:29,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 09:30:29,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:29,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402951785] [2022-12-13 09:30:29,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402951785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:29,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:29,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:30:29,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385995306] [2022-12-13 09:30:29,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:29,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:30:29,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:29,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:30:29,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:30:29,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:29,344 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:29,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:29,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:29,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:29,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:18,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:18,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:18,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:31:18,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 09:31:18,762 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err8ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-12-13 09:31:18,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:18,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1610493987, now seen corresponding path program 1 times [2022-12-13 09:31:18,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:18,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105342254] [2022-12-13 09:31:18,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:18,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 09:31:18,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:18,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105342254] [2022-12-13 09:31:18,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105342254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:18,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:18,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:31:18,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232427766] [2022-12-13 09:31:18,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:18,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:31:18,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:18,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:31:18,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:31:18,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:18,828 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:31:18,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-12-13 09:31:18,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:18,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:18,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:31:18,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:20,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:20,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:20,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:31:20,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:20,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 09:31:20,741 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-12-13 09:31:20,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:20,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1261900483, now seen corresponding path program 1 times [2022-12-13 09:31:20,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:20,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555942742] [2022-12-13 09:31:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:20,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:20,775 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 09:31:20,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:20,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555942742] [2022-12-13 09:31:20,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555942742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:20,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:20,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:31:20,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601719531] [2022-12-13 09:31:20,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:20,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:31:20,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:20,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:31:20,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:31:20,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:20,777 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:31:20,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-12-13 09:31:20,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:20,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:20,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:31:20,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:20,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:22,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:22,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:22,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:31:22,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:22,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:22,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 09:31:22,835 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err13ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-12-13 09:31:22,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:22,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1045321866, now seen corresponding path program 1 times [2022-12-13 09:31:22,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:22,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334123931] [2022-12-13 09:31:22,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:22,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:22,888 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 09:31:22,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:22,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334123931] [2022-12-13 09:31:22,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334123931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:22,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:22,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:31:22,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341856587] [2022-12-13 09:31:22,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:22,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:31:22,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:22,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:31:22,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:31:22,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:22,890 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:31:22,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 35.0) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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-12-13 09:31:22,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:22,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:22,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:31:22,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:22,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:22,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:24,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:24,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:24,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:31:24,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:24,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:24,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:24,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 09:31:24,719 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err15ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-12-13 09:31:24,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:24,720 INFO L85 PathProgramCache]: Analyzing trace with hash 987573138, now seen corresponding path program 1 times [2022-12-13 09:31:24,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:24,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901135450] [2022-12-13 09:31:24,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:24,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:24,768 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 09:31:24,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:24,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901135450] [2022-12-13 09:31:24,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901135450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:24,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:24,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:31:24,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620841688] [2022-12-13 09:31:24,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:24,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:31:24,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:24,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:31:24,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:31:24,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:24,770 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:31:24,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 41.0) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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-12-13 09:31:24,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:24,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:24,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:31:24,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:24,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:24,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:24,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:28,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:28,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:28,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:31:28,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:28,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:28,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:28,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:28,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 09:31:28,009 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err12ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-12-13 09:31:28,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:28,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1624650017, now seen corresponding path program 1 times [2022-12-13 09:31:28,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:28,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230561130] [2022-12-13 09:31:28,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:28,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:28,783 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-12-13 09:31:28,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:28,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230561130] [2022-12-13 09:31:28,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230561130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:28,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:28,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 09:31:28,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380697808] [2022-12-13 09:31:28,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:28,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:31:28,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:28,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:31:28,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:31:28,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:28,786 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:31:28,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 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-12-13 09:31:28,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:28,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:28,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:31:28,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:28,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:28,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:28,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:28,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:32:20,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:32:20,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:32:20,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:32:20,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:20,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:20,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:20,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:20,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:32:20,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 09:32:20,875 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err12ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-12-13 09:32:20,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:20,875 INFO L85 PathProgramCache]: Analyzing trace with hash 417228195, now seen corresponding path program 1 times [2022-12-13 09:32:20,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:20,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388966560] [2022-12-13 09:32:20,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:20,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:21,457 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 103 proven. 49 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-13 09:32:21,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:21,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388966560] [2022-12-13 09:32:21,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388966560] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:32:21,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336127116] [2022-12-13 09:32:21,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:21,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:32:21,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:32:21,459 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:32:21,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 09:32:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:21,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 09:32:21,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:32:21,792 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-13 09:32:21,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 09:32:21,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336127116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:21,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 09:32:21,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 09:32:21,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4603158] [2022-12-13 09:32:21,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:21,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:32:21,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:21,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:32:21,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 09:32:21,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:32:21,795 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:32:21,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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-12-13 09:32:21,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:32:21,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:32:21,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:32:21,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:21,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:21,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:21,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:21,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:32:21,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:32:25,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:32:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:32:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:32:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:32:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:25,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 09:32:25,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 09:32:25,705 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err12ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-12-13 09:32:25,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:25,707 INFO L85 PathProgramCache]: Analyzing trace with hash -677256243, now seen corresponding path program 2 times [2022-12-13 09:32:25,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:25,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798957214] [2022-12-13 09:32:25,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:25,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:26,314 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 103 proven. 48 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-13 09:32:26,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:26,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798957214] [2022-12-13 09:32:26,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798957214] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:32:26,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313454032] [2022-12-13 09:32:26,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 09:32:26,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:32:26,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:32:26,316 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:32:26,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 09:32:26,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 09:32:26,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 09:32:26,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 09:32:26,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:32:26,676 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-12-13 09:32:26,909 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:32:26,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 10 [2022-12-13 09:32:26,911 INFO L350 Elim1Store]: Elim1 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-12-13 09:32:26,921 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-12-13 09:32:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 103 proven. 48 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-13 09:32:26,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:32:27,000 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:32:27,000 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 181 treesize of output 182 [2022-12-13 09:32:27,012 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:32:27,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 175 treesize of output 189 [2022-12-13 09:32:27,029 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:32:27,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 8 [2022-12-13 09:32:27,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2022-12-13 09:32:27,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2022-12-13 09:32:27,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 6 [2022-12-13 09:32:27,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-12-13 09:32:27,100 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 13 [2022-12-13 09:32:27,212 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:32:27,213 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 176 treesize of output 177 [2022-12-13 09:32:27,404 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:32:27,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 176 treesize of output 192 [2022-12-13 09:32:27,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:32:27,412 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 170 treesize of output 171 [2022-12-13 09:32:27,426 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:32:27,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 13 [2022-12-13 09:32:27,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:32:27,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 13 [2022-12-13 09:32:27,524 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 103 proven. 48 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-13 09:32:27,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313454032] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:32:27,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:32:27,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-12-13 09:32:27,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231122090] [2022-12-13 09:32:27,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:32:27,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 09:32:27,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:27,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 09:32:27,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-12-13 09:32:27,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:32:27,528 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:32:27,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 30.666666666666668) internal successors, (460), 15 states have internal predecessors, (460), 0 states have call successors, (0), 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-12-13 09:32:27,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:32:27,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:32:27,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:32:27,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:27,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:27,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:27,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:27,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:32:27,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:27,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:34:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:34:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:34:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:34:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:34:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-13 09:34:17,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 09:34:17,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:34:17,260 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err12ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-12-13 09:34:17,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:34:17,262 INFO L85 PathProgramCache]: Analyzing trace with hash -2070761219, now seen corresponding path program 2 times [2022-12-13 09:34:17,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:34:17,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255949401] [2022-12-13 09:34:17,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:34:17,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:34:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:35:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 25402 backedges. 0 proven. 25385 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 09:35:00,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:35:00,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255949401] [2022-12-13 09:35:00,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255949401] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:35:00,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790572911] [2022-12-13 09:35:00,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 09:35:00,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:35:00,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:35:00,064 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:35:00,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 09:35:00,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 09:35:00,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 09:35:01,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 6537 conjuncts, 121 conjunts are in the unsatisfiable core [2022-12-13 09:35:01,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:35:01,246 INFO L350 Elim1Store]: Elim1 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-12-13 09:35:01,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 168 [2022-12-13 09:35:01,321 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:01,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 163 [2022-12-13 09:35:01,404 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 1 [2022-12-13 09:35:01,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-13 09:35:01,440 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-13 09:35:01,511 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-12-13 09:35:01,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 63 [2022-12-13 09:35:01,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:01,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:01,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:01,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2022-12-13 09:35:01,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:01,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:01,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:01,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2022-12-13 09:35:01,578 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:01,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-12-13 09:35:01,593 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:01,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-12-13 09:35:01,610 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:01,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-12-13 09:35:01,651 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:01,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-12-13 09:35:01,668 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:01,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-12-13 09:35:01,686 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:01,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-12-13 09:35:01,704 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:01,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-12-13 09:35:01,799 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:01,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-12-13 09:35:01,817 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:01,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-12-13 09:35:01,835 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:01,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-12-13 09:35:01,850 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:01,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-12-13 09:35:01,908 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:01,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-12-13 09:35:01,925 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:01,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-12-13 09:35:01,942 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:01,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-12-13 09:35:01,958 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:01,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-12-13 09:35:02,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:02,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 09:35:02,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 168 [2022-12-13 09:35:02,173 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:02,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 170 [2022-12-13 09:35:02,248 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 1 [2022-12-13 09:35:02,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:02,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-12-13 09:35:02,381 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-12-13 09:35:02,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 71 [2022-12-13 09:35:02,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:02,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:02,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:02,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2022-12-13 09:35:02,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:02,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:02,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:02,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2022-12-13 09:35:02,504 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:02,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-12-13 09:35:02,524 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:02,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-12-13 09:35:02,543 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:02,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-12-13 09:35:02,595 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:02,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-12-13 09:35:02,615 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:02,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-12-13 09:35:02,634 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:02,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-12-13 09:35:02,654 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:02,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-12-13 09:35:02,776 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:02,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-12-13 09:35:02,802 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:02,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-12-13 09:35:02,823 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:02,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-12-13 09:35:02,842 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:02,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-12-13 09:35:02,911 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:02,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-12-13 09:35:02,935 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:02,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-12-13 09:35:02,961 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:02,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-12-13 09:35:02,986 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:02,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-12-13 09:35:03,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:03,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:03,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:35:03,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-12-13 09:35:03,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 168 [2022-12-13 09:35:03,294 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:03,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 177 [2022-12-13 09:35:03,362 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 1 [2022-12-13 09:35:03,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:03,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:03,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2022-12-13 09:35:03,426 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-13 09:35:03,569 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-12-13 09:35:03,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 78 [2022-12-13 09:35:03,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:03,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:03,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:03,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2022-12-13 09:35:03,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:03,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:03,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:03,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2022-12-13 09:35:03,752 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:03,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2022-12-13 09:35:03,776 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:03,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2022-12-13 09:35:03,800 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:03,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2022-12-13 09:35:03,873 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:03,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2022-12-13 09:35:03,891 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:03,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2022-12-13 09:35:03,908 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:03,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2022-12-13 09:35:03,927 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:03,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2022-12-13 09:35:04,098 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:04,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2022-12-13 09:35:04,124 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:04,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2022-12-13 09:35:04,153 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:04,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2022-12-13 09:35:04,179 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:04,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2022-12-13 09:35:04,315 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:04,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2022-12-13 09:35:04,341 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:04,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2022-12-13 09:35:04,368 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:04,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2022-12-13 09:35:04,393 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:04,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2022-12-13 09:35:04,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:04,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:04,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:04,680 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:35:04,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-12-13 09:35:04,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 168 [2022-12-13 09:35:04,800 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:04,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 184 [2022-12-13 09:35:04,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:04,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:04,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:04,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2022-12-13 09:35:05,025 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-12-13 09:35:05,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 85 [2022-12-13 09:35:05,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:05,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:05,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:05,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2022-12-13 09:35:05,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:05,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:05,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:05,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2022-12-13 09:35:05,207 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:05,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2022-12-13 09:35:05,237 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:05,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2022-12-13 09:35:05,269 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:05,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2022-12-13 09:35:05,372 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:05,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2022-12-13 09:35:05,403 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:05,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2022-12-13 09:35:05,437 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:05,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2022-12-13 09:35:05,469 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:05,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2022-12-13 09:35:05,717 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:05,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2022-12-13 09:35:05,751 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:05,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2022-12-13 09:35:05,783 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:05,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2022-12-13 09:35:05,818 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:05,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2022-12-13 09:35:06,010 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:06,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2022-12-13 09:35:06,038 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:06,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2022-12-13 09:35:06,073 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 09:35:06,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2022-12-13 09:35:06,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:06,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:06,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:06,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:06,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:06,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:35:06,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:35:06,114 INFO L321 Elim1Store]: treesize reduction 18, result has 41.9 percent of original size [2022-12-13 09:35:06,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 71 treesize of output 74 [2022-12-13 09:35:06,481 INFO L134 CoverageAnalysis]: Checked inductivity of 25402 backedges. 17432 proven. 4 refuted. 0 times theorem prover too weak. 7966 trivial. 0 not checked. [2022-12-13 09:35:06,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:35:06,490 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:35:06,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 13 [2022-12-13 09:35:07,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:35:07,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 90 treesize of output 90 [2022-12-13 09:35:09,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:35:09,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 13 [2022-12-13 09:35:09,065 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:35:09,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 13 [2022-12-13 09:35:09,777 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3))) (let ((.cse0 (+ 3 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (.cse1 (+ 2 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (.cse2 (+ |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 1)) (.cse3 (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse4 0)))) (and (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 .cse0) 0)) (not (= (select v_arrayElimArr_20 .cse1) 0)) (not (= (select v_arrayElimArr_20 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_arrayElimArr_20 .cse2) 0)) (= (select (select (store .cse3 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) 0))) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_arrayElimArr_20 (Array Int Int))) (or (= (select (select (store .cse3 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select v_arrayElimArr_20 .cse0) 0)) (not (= (select v_arrayElimArr_20 .cse1) 0)) (not (= (select v_arrayElimArr_20 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_arrayElimArr_20 .cse2) 0)))) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 .cse0) 0)) (= (select (select (store .cse3 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) 0) (not (= (select v_arrayElimArr_20 .cse1) 0)) (not (= (select v_arrayElimArr_20 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_arrayElimArr_20 .cse2) 0)))) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 .cse0) 0)) (not (= (select v_arrayElimArr_20 .cse1) 0)) (not (= (select v_arrayElimArr_20 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_arrayElimArr_20 .cse2) 0)) (= (select (select (store .cse3 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse4) 0)))))) is different from false [2022-12-13 09:35:09,878 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse1 0)))) (and (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (= (select (select (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse1) 0) (not (= (select v_arrayElimArr_20 0) 0)))) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (= (select (select (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) 0) (not (= (select v_arrayElimArr_20 0) 0)))) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (= (select (select (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) 0) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_arrayElimArr_20 0) 0)))) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_arrayElimArr_20 (Array Int Int))) (or (= (select (select (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_arrayElimArr_20 0) 0))))))) is different from false [2022-12-13 09:35:11,042 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) (.cse0 (+ |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 1)) (.cse1 (+ 2 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (and (forall ((v_ArrVal_4680 (Array Int Int))) (or (not (= (select v_ArrVal_4680 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_ArrVal_4680 .cse0) 0)) (not (= (select v_ArrVal_4680 .cse1) 0)) (forall ((v_subst_3 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_arrayElimArr_20 0) 0)) (= 0 (select (select (store (let ((.cse2 (store |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4680))) (store .cse2 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse2 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse3 0))) v_subst_3 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (forall ((v_ArrVal_4680 (Array Int Int))) (or (forall ((v_subst_1 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_arrayElimArr_20 0) 0)) (= (select (select (store (let ((.cse4 (store |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4680))) (store .cse4 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse4 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse3 0))) v_subst_1 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse3) 0))) (not (= (select v_ArrVal_4680 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_ArrVal_4680 .cse0) 0)) (not (= (select v_ArrVal_4680 .cse1) 0)))) (forall ((v_ArrVal_4680 (Array Int Int))) (or (forall ((v_subst_4 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (= (select (select (store (let ((.cse5 (store |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4680))) (store .cse5 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse5 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse3 0))) v_subst_4 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) 0) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_arrayElimArr_20 0) 0)))) (not (= (select v_ArrVal_4680 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_ArrVal_4680 .cse0) 0)) (not (= (select v_ArrVal_4680 .cse1) 0)))) (forall ((v_ArrVal_4680 (Array Int Int))) (or (not (= (select v_ArrVal_4680 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (forall ((v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (= (select (select (store (let ((.cse6 (store |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4680))) (store .cse6 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse6 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse3 0))) v_subst_2 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) 0) (not (= (select v_arrayElimArr_20 0) 0)))) (not (= (select v_ArrVal_4680 .cse0) 0)) (not (= (select v_ArrVal_4680 .cse1) 0)))))) is different from false [2022-12-13 09:35:14,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2022-12-13 09:35:14,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2022-12-13 09:35:14,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2022-12-13 09:35:14,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2022-12-13 09:35:14,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2022-12-13 09:35:14,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2022-12-13 09:35:14,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2022-12-13 09:35:14,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2022-12-13 09:35:14,817 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (< 64 c_~next_alloc_idx~0)) (.cse8 (+ |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 1)) (.cse9 (+ 2 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (.cse7 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3))) (let ((.cse0 (forall ((v_ArrVal_4680 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_ArrVal_4680 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_ArrVal_4680 .cse8) 0)) (not (= (select v_arrayElimArr_20 0) 0)) (not (= (select v_ArrVal_4680 .cse9) 0)) (= (select (select (store (let ((.cse12 (store |c_#race| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4680))) (store .cse12 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse12 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7 0))) v_subst_2 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) 0)))) (.cse5 (forall ((v_ArrVal_4680 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_subst_4 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_ArrVal_4680 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_ArrVal_4680 .cse8) 0)) (not (= (select v_arrayElimArr_20 0) 0)) (not (= (select v_ArrVal_4680 .cse9) 0)) (= (select (select (store (let ((.cse11 (store |c_#race| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4680))) (store .cse11 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse11 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7 0))) v_subst_4 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) 0)))) (.cse2 (forall ((v_ArrVal_4680 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_subst_1 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (= (select (select (store (let ((.cse10 (store |c_#race| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4680))) (store .cse10 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse10 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7 0))) v_subst_1 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7) 0) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_ArrVal_4680 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_ArrVal_4680 .cse8) 0)) (not (= (select v_arrayElimArr_20 0) 0)) (not (= (select v_ArrVal_4680 .cse9) 0))))) (.cse4 (forall ((v_ArrVal_4680 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_subst_3 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (= (select (select (store (let ((.cse6 (store |c_#race| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4680))) (store .cse6 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse6 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7 0))) v_subst_3 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select v_ArrVal_4680 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_ArrVal_4680 .cse8) 0)) (not (= (select v_arrayElimArr_20 0) 0)) (not (= (select v_ArrVal_4680 .cse9) 0))))) (.cse1 (not .cse3))) (and (or .cse0 .cse1) (or .cse2 .cse1) (or .cse0 .cse3) (or .cse4 .cse3) (or .cse5 .cse1) (or .cse5 .cse3) (or .cse3 .cse2) (or .cse4 .cse1)))) is different from false [2022-12-13 09:35:15,046 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2))) (let ((.cse4 (< 64 c_~next_alloc_idx~0)) (.cse7 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) (.cse8 (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse13 0))) (.cse9 (+ |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 1)) (.cse10 (+ 2 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (let ((.cse2 (forall ((v_ArrVal_4680 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (= (select (select (store (let ((.cse14 (store .cse8 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4680))) (store .cse14 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse14 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7 0))) v_subst_2 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) 0) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_ArrVal_4680 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_ArrVal_4680 .cse9) 0)) (not (= (select v_arrayElimArr_20 0) 0)) (not (= (select v_ArrVal_4680 .cse10) 0))))) (.cse3 (forall ((v_ArrVal_4680 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_subst_4 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (= (select (select (store (let ((.cse12 (store .cse8 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4680))) (store .cse12 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse12 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7 0))) v_subst_4 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse13) 0) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_ArrVal_4680 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_ArrVal_4680 .cse9) 0)) (not (= (select v_arrayElimArr_20 0) 0)) (not (= (select v_ArrVal_4680 .cse10) 0))))) (.cse5 (forall ((v_ArrVal_4680 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_subst_3 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_ArrVal_4680 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_ArrVal_4680 .cse9) 0)) (not (= (select v_arrayElimArr_20 0) 0)) (not (= (select v_ArrVal_4680 .cse10) 0)) (= (select (select (store (let ((.cse11 (store .cse8 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4680))) (store .cse11 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse11 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7 0))) v_subst_3 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (.cse1 (not .cse4)) (.cse0 (forall ((v_ArrVal_4680 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_subst_1 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_ArrVal_4680 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= (select (select (store (let ((.cse6 (store .cse8 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4680))) (store .cse6 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse6 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7 0))) v_subst_1 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7) 0) (not (= (select v_ArrVal_4680 .cse9) 0)) (not (= (select v_arrayElimArr_20 0) 0)) (not (= (select v_ArrVal_4680 .cse10) 0)))))) (and (or .cse0 .cse1) (or .cse2 .cse1) (or .cse3 .cse1) (or .cse4 .cse2) (or .cse4 .cse3) (or .cse4 .cse5) (or .cse5 .cse1) (or .cse0 .cse4))))) is different from false [2022-12-13 09:35:15,469 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2))) (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse7 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) (.cse8 (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse11 0)))) (let ((.cse4 (forall ((v_ArrVal_4680 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_subst_3 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_ArrVal_4680 2) 0)) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4680 1) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_arrayElimArr_20 0) 0)) (= (select (select (store (let ((.cse12 (store .cse8 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4680))) (store .cse12 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse12 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7 0))) v_subst_3 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (.cse5 (forall ((v_ArrVal_4680 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_subst_4 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_ArrVal_4680 2) 0)) (= (select (select (store (let ((.cse10 (store .cse8 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4680))) (store .cse10 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse10 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7 0))) v_subst_4 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse11) 0) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4680 1) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_arrayElimArr_20 0) 0))))) (.cse2 (forall ((v_ArrVal_4680 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_subst_1 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_ArrVal_4680 2) 0)) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4680 1) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (= (select (select (store (let ((.cse9 (store .cse8 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4680))) (store .cse9 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse9 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7 0))) v_subst_1 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7) 0) (not (= (select v_arrayElimArr_20 0) 0))))) (.cse1 (forall ((v_ArrVal_4680 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_ArrVal_4680 2) 0)) (= (select (select (store (let ((.cse6 (store .cse8 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4680))) (store .cse6 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse6 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7 0))) v_subst_2 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) 0) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4680 1) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_arrayElimArr_20 0) 0))))) (.cse3 (not .cse0))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or .cse4 .cse3) (or .cse0 .cse4) (or .cse0 .cse5) (or .cse5 .cse3) (or .cse0 .cse2) (or .cse1 .cse3))))) is different from false [2022-12-13 09:35:20,941 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse3 (+ |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 1)) (.cse5 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) (.cse7 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2))) (let ((.cse1 (forall ((v_ArrVal_4680 (Array Int Int)) (v_subst_6 Int) (v_subst_3 Int) (v_ArrVal_4659 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_ArrVal_4680 2) 0)) (not (= (select v_ArrVal_4659 .cse3) 0)) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4659 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_ArrVal_4680 1) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (= (select (select (store (let ((.cse11 (store (let ((.cse12 (store |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4659))) (store .cse12 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse12 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7 0))) v_subst_6 v_ArrVal_4680))) (store .cse11 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse11 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse5 0))) v_subst_3 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select v_arrayElimArr_20 0) 0))))) (.cse8 (not .cse0)) (.cse2 (forall ((v_ArrVal_4680 (Array Int Int)) (v_subst_5 Int) (v_ArrVal_4659 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_ArrVal_4680 2) 0)) (not (= (select v_ArrVal_4659 .cse3) 0)) (= (select (select (store (let ((.cse9 (store (let ((.cse10 (store |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4659))) (store .cse10 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse10 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7 0))) v_subst_5 v_ArrVal_4680))) (store .cse9 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse9 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse5 0))) v_subst_2 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) 0) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4659 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_ArrVal_4680 1) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_arrayElimArr_20 0) 0)))))) (and (or .cse0 .cse1) (or .cse0 .cse2) (forall ((v_ArrVal_4659 (Array Int Int))) (or (not (= (select v_ArrVal_4659 .cse3) 0)) (not (= (select v_ArrVal_4659 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (forall ((v_ArrVal_4680 (Array Int Int)) (v_subst_7 Int) (v_subst_1 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_ArrVal_4680 2) 0)) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4680 1) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (= (select (select (store (let ((.cse4 (store (let ((.cse6 (store |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4659))) (store .cse6 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse6 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7 0))) v_subst_7 v_ArrVal_4680))) (store .cse4 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse4 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse5 0))) v_subst_1 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse5) 0) (not (= (select v_arrayElimArr_20 0) 0)))))) (or .cse1 .cse8) (or .cse8 .cse2)))) is different from false [2022-12-13 09:35:27,112 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:35:27,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 13 [2022-12-13 09:35:27,123 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:35:27,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 13 [2022-12-13 09:35:27,257 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) (.cse7 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) (.cse10 (+ |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 1))) (let ((.cse3 (< 64 c_~next_alloc_idx~0)) (.cse0 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_4659 (Array Int Int))) (or (forall ((v_ArrVal_4680 (Array Int Int)) (v_subst_7 Int) (v_subst_1 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_ArrVal_4680 2) 0)) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4680 1) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_arrayElimArr_20 0) 0)) (= (select (select (store (let ((.cse13 (store (let ((.cse14 (store |c_#race| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4659))) (store .cse14 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse14 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse9 0))) v_subst_7 v_ArrVal_4680))) (store .cse13 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse13 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7 0))) v_subst_1 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7) 0))) (not (= (select v_ArrVal_4659 .cse10) 0)) (not (= (select v_ArrVal_4659 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (.cse1 (forall ((v_ArrVal_4680 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_subst_6 Int) (v_subst_3 Int) (v_ArrVal_4659 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_ArrVal_4680 2) 0)) (not (= (select v_ArrVal_4659 .cse10) 0)) (= (select (select (store (let ((.cse11 (store (let ((.cse12 (store |c_#race| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4659))) (store .cse12 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse12 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse9 0))) v_subst_6 v_ArrVal_4680))) (store .cse11 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse11 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7 0))) v_subst_3 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4659 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_ArrVal_4680 1) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_arrayElimArr_20 0) 0))))) (.cse2 (forall ((v_ArrVal_4680 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_subst_5 Int) (v_ArrVal_4659 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (= (select (select (store (let ((.cse6 (store (let ((.cse8 (store |c_#race| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4659))) (store .cse8 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse8 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse9 0))) v_subst_5 v_ArrVal_4680))) (store .cse6 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse6 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7 0))) v_subst_2 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) 0) (not (= (select v_ArrVal_4680 2) 0)) (not (= (select v_ArrVal_4659 .cse10) 0)) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4659 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_ArrVal_4680 1) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_arrayElimArr_20 0) 0)))))) (and (or (and .cse0 .cse1 .cse2) (not .cse3)) (or .cse3 (let ((.cse5 (< 62 c_~next_alloc_idx~0))) (let ((.cse4 (not .cse5))) (and .cse0 (or .cse1 .cse4) (or .cse5 .cse2) (or .cse5 .cse1) (or .cse2 .cse4)))))))) is different from false [2022-12-13 09:35:27,590 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1))) (let ((.cse6 (+ |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 1)) (.cse8 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) (.cse10 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) (.cse11 (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse12 0)))) (let ((.cse0 (forall ((v_ArrVal_4680 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_subst_6 Int) (v_subst_3 Int) (v_ArrVal_4659 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_ArrVal_4680 2) 0)) (not (= (select v_ArrVal_4659 .cse6) 0)) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4659 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_ArrVal_4680 1) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (= (select (select (store (let ((.cse15 (store (let ((.cse16 (store .cse11 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4659))) (store .cse16 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse16 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse10 0))) v_subst_6 v_ArrVal_4680))) (store .cse15 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse15 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse8 0))) v_subst_3 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select v_arrayElimArr_20 0) 0))))) (.cse1 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_4659 (Array Int Int))) (or (not (= (select v_ArrVal_4659 .cse6) 0)) (not (= (select v_ArrVal_4659 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (forall ((v_ArrVal_4680 (Array Int Int)) (v_subst_7 Int) (v_subst_1 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_ArrVal_4680 2) 0)) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4680 1) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_arrayElimArr_20 0) 0)) (= (select (select (store (let ((.cse13 (store (let ((.cse14 (store .cse11 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4659))) (store .cse14 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse14 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse10 0))) v_subst_7 v_ArrVal_4680))) (store .cse13 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse13 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse8 0))) v_subst_1 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse8) 0)))))) (.cse2 (forall ((v_ArrVal_4680 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_subst_5 Int) (v_ArrVal_4659 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_ArrVal_4680 2) 0)) (not (= (select v_ArrVal_4659 .cse6) 0)) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4659 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_ArrVal_4680 1) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_arrayElimArr_20 0) 0)) (= (select (select (store (let ((.cse7 (store (let ((.cse9 (store .cse11 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4659))) (store .cse9 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse9 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse10 0))) v_subst_5 v_ArrVal_4680))) (store .cse7 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse7 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse8 0))) v_subst_2 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse12) 0)))) (.cse3 (< 64 c_~next_alloc_idx~0))) (and (or (and .cse0 .cse1 .cse2) (not .cse3)) (or (let ((.cse4 (< 62 c_~next_alloc_idx~0))) (let ((.cse5 (not .cse4))) (and (or .cse4 .cse0) (or .cse2 .cse5) (or .cse0 .cse5) .cse1 (or .cse4 .cse2)))) .cse3))))) is different from false [2022-12-13 09:35:28,220 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1))) (let ((.cse7 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) (.cse9 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) (.cse10 (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse13 0)))) (let ((.cse3 (< 64 c_~next_alloc_idx~0)) (.cse2 (forall ((v_ArrVal_4680 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_subst_6 Int) (v_subst_3 Int) (v_ArrVal_4659 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_ArrVal_4680 2) 0)) (not (= (select v_ArrVal_4659 1) 0)) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4680 1) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (= (select (select (store (let ((.cse14 (store (let ((.cse15 (store .cse10 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4659))) (store .cse15 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse15 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse9 0))) v_subst_6 v_ArrVal_4680))) (store .cse14 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse14 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7 0))) v_subst_3 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select v_arrayElimArr_20 0) 0)) (not (= (select v_ArrVal_4659 0) 0))))) (.cse0 (forall ((v_ArrVal_4680 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_subst_5 Int) (v_ArrVal_4659 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_ArrVal_4680 2) 0)) (not (= (select v_ArrVal_4659 1) 0)) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4680 1) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_arrayElimArr_20 0) 0)) (= (select (select (store (let ((.cse11 (store (let ((.cse12 (store .cse10 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4659))) (store .cse12 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse12 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse9 0))) v_subst_5 v_ArrVal_4680))) (store .cse11 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse11 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7 0))) v_subst_2 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse13) 0) (not (= (select v_ArrVal_4659 0) 0))))) (.cse1 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_4659 (Array Int Int))) (or (not (= (select v_ArrVal_4659 1) 0)) (forall ((v_ArrVal_4680 (Array Int Int)) (v_subst_7 Int) (v_subst_1 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_ArrVal_4680 2) 0)) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4680 1) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_arrayElimArr_20 0) 0)) (= (select (select (store (let ((.cse6 (store (let ((.cse8 (store .cse10 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4659))) (store .cse8 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse8 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse9 0))) v_subst_7 v_ArrVal_4680))) (store .cse6 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse6 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7 0))) v_subst_1 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse7) 0))) (not (= (select v_ArrVal_4659 0) 0)))))) (and (or (and .cse0 .cse1 .cse2) (not .cse3)) (or .cse3 (let ((.cse4 (< 62 c_~next_alloc_idx~0))) (let ((.cse5 (not .cse4))) (and (or .cse4 .cse2) (or .cse2 .cse5) (or .cse4 .cse0) (or .cse0 .cse5) .cse1)))))))) is different from false [2022-12-13 09:35:35,520 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) (.cse8 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) (.cse4 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3))) (let ((.cse2 (forall ((v_ArrVal_4638 (Array Int Int))) (or (forall ((v_subst_8 Int) (v_ArrVal_4659 (Array Int Int))) (or (not (= (select v_ArrVal_4659 1) 0)) (forall ((v_ArrVal_4680 (Array Int Int)) (v_subst_7 Int) (v_subst_1 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_ArrVal_4680 2) 0)) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4680 1) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (= (select (select (store (let ((.cse13 (store (let ((.cse14 (store (let ((.cse15 (store |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4638))) (store .cse15 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse15 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse8 0))) v_subst_8 v_ArrVal_4659))) (store .cse14 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse14 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse6 0))) v_subst_7 v_ArrVal_4680))) (store .cse13 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse13 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse4 0))) v_subst_1 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse4) 0) (not (= (select v_arrayElimArr_20 0) 0)))) (not (= (select v_ArrVal_4659 0) 0)))) (not (= (select v_ArrVal_4638 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (.cse9 (< 64 c_~next_alloc_idx~0))) (and (or (let ((.cse1 (forall ((v_ArrVal_4680 (Array Int Int)) (v_subst_9 Int) (v_subst_6 Int) (v_subst_3 Int) (v_ArrVal_4659 (Array Int Int)) (v_ArrVal_4638 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_ArrVal_4680 2) 0)) (not (= (select v_ArrVal_4659 1) 0)) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4680 1) 0)) (= (select (select (store (let ((.cse3 (store (let ((.cse5 (store (let ((.cse7 (store |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4638))) (store .cse7 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse7 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse8 0))) v_subst_9 v_ArrVal_4659))) (store .cse5 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse5 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse6 0))) v_subst_6 v_ArrVal_4680))) (store .cse3 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse3 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse4 0))) v_subst_3 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_arrayElimArr_20 0) 0)) (not (= (select v_ArrVal_4638 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_ArrVal_4659 0) 0))))) (.cse0 (< 62 c_~next_alloc_idx~0))) (and (or .cse0 .cse1) (or .cse1 (not .cse0)) .cse2)) .cse9) (or (and (forall ((v_ArrVal_4638 (Array Int Int))) (or (forall ((v_ArrVal_4680 (Array Int Int)) (v_subst_9 Int) (v_subst_6 Int) (v_subst_3 Int) (v_ArrVal_4659 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_ArrVal_4680 2) 0)) (not (= (select v_ArrVal_4659 1) 0)) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4680 1) 0)) (= (select (select (store (let ((.cse10 (store (let ((.cse11 (store (let ((.cse12 (store |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4638))) (store .cse12 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse12 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse8 0))) v_subst_9 v_ArrVal_4659))) (store .cse11 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse11 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse6 0))) v_subst_6 v_ArrVal_4680))) (store .cse10 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse10 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse4 0))) v_subst_3 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_arrayElimArr_20 0) 0)) (not (= (select v_ArrVal_4659 0) 0)))) (not (= (select v_ArrVal_4638 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse2) (not .cse9))))) is different from false [2022-12-13 09:35:44,294 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:35:44,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 176 treesize of output 192 [2022-12-13 09:35:44,410 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:35:44,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 13 [2022-12-13 09:35:44,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2022-12-13 09:35:44,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2022-12-13 09:35:44,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2022-12-13 09:35:44,859 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) (.cse5 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) (.cse1 (+ |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3))) (and (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_4638 (Array Int Int))) (or (forall ((v_subst_8 Int) (v_ArrVal_4659 (Array Int Int))) (or (forall ((v_ArrVal_4680 (Array Int Int)) (v_subst_7 Int) (v_subst_1 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_ArrVal_4680 2) 0)) (= (select (select (store (let ((.cse0 (store (let ((.cse2 (store (let ((.cse4 (store |c_#race| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4638))) (store .cse4 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse4 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse5 0))) v_subst_8 v_ArrVal_4659))) (store .cse2 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse2 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse3 0))) v_subst_7 v_ArrVal_4680))) (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse1 0))) v_subst_1 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse1) 0) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4680 1) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_arrayElimArr_20 0) 0)))) (not (= (select v_ArrVal_4659 1) 0)) (not (= (select v_ArrVal_4659 0) 0)))) (not (= (select v_ArrVal_4638 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (forall ((v_ArrVal_4680 (Array Int Int)) (v_subst_9 Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_subst_6 Int) (v_subst_3 Int) (v_ArrVal_4659 (Array Int Int)) (v_ArrVal_4638 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_ArrVal_4680 2) 0)) (not (= (select v_ArrVal_4659 1) 0)) (= (select (select (store (let ((.cse6 (store (let ((.cse7 (store (let ((.cse8 (store |c_#race| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4638))) (store .cse8 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse8 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse5 0))) v_subst_9 v_ArrVal_4659))) (store .cse7 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse7 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse3 0))) v_subst_6 v_ArrVal_4680))) (store .cse6 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse6 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse1 0))) v_subst_3 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4680 1) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_arrayElimArr_20 0) 0)) (not (= (select v_ArrVal_4638 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_ArrVal_4659 0) 0)))) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_4638 (Array Int Int))) (or (forall ((v_ArrVal_4680 (Array Int Int)) (v_subst_9 Int) (v_subst_6 Int) (v_subst_3 Int) (v_ArrVal_4659 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_ArrVal_4680 2) 0)) (not (= (select v_ArrVal_4659 1) 0)) (= (select (select (store (let ((.cse9 (store (let ((.cse10 (store (let ((.cse11 (store |c_#race| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4638))) (store .cse11 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse11 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse5 0))) v_subst_9 v_ArrVal_4659))) (store .cse10 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse10 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse3 0))) v_subst_6 v_ArrVal_4680))) (store .cse9 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse9 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse1 0))) v_subst_3 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4680 1) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_arrayElimArr_20 0) 0)) (not (= (select v_ArrVal_4659 0) 0)))) (not (= (select v_ArrVal_4638 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (forall ((v_ArrVal_4680 (Array Int Int)) (v_subst_8 Int) (v_subst_7 Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_4659 (Array Int Int)) (v_ArrVal_4638 (Array Int Int)) (v_subst_1 Int) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 3) 0)) (not (= (select v_ArrVal_4680 2) 0)) (= (select (select (store (let ((.cse12 (store (let ((.cse13 (store (let ((.cse14 (store |c_#race| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_4638))) (store .cse14 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse14 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse5 0))) v_subst_8 v_ArrVal_4659))) (store .cse13 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse13 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse3 0))) v_subst_7 v_ArrVal_4680))) (store .cse12 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select .cse12 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse1 0))) v_subst_1 v_arrayElimArr_20) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) .cse1) 0) (not (= (select v_ArrVal_4659 1) 0)) (not (= (select v_ArrVal_4680 0) 0)) (not (= (select v_arrayElimArr_20 2) 0)) (not (= (select v_ArrVal_4680 1) 0)) (not (= (select v_arrayElimArr_20 1) 0)) (not (= (select v_arrayElimArr_20 0) 0)) (not (= (select v_ArrVal_4638 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select v_ArrVal_4659 0) 0)))))) is different from false [2022-12-13 09:35:44,916 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:35:44,916 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 188 treesize of output 133 [2022-12-13 09:35:44,930 INFO L350 Elim1Store]: Elim1 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 206 treesize of output 202 [2022-12-13 09:35:44,955 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-12-13 09:35:44,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 190 treesize of output 168 [2022-12-13 09:35:44,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-12-13 09:35:44,979 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 09:35:44,979 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 188 treesize of output 1 [2022-12-13 09:35:44,989 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:35:44,989 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 186 treesize of output 131 [2022-12-13 09:35:45,002 INFO L350 Elim1Store]: Elim1 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 240 treesize of output 232 [2022-12-13 09:35:45,023 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:35:45,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 121 treesize of output 125 [2022-12-13 09:35:45,035 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:35:45,036 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:35:45,041 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:35:45,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 230 [2022-12-13 09:35:45,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:35:45,056 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:35:45,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:35:45,062 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:35:45,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 218 [2022-12-13 09:35:45,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:35:45,079 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:35:45,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 206 [2022-12-13 09:35:45,157 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 09:35:45,157 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 186 treesize of output 1 [2022-12-13 09:35:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 25402 backedges. 16284 proven. 87 refuted. 120 times theorem prover too weak. 7966 trivial. 945 not checked. [2022-12-13 09:35:45,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790572911] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:35:45,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:35:45,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 21, 24] total 83 [2022-12-13 09:35:45,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025651554] [2022-12-13 09:35:45,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:35:45,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-12-13 09:35:45,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:35:45,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-12-13 09:35:45,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=4625, Unknown=67, NotChecked=1788, Total=6806 [2022-12-13 09:35:45,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:35:45,371 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:35:45,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 34.10843373493976) internal successors, (2831), 83 states have internal predecessors, (2831), 0 states have call successors, (0), 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-12-13 09:35:45,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:35:45,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:35:45,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:35:45,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:35:45,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:35:45,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:35:45,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:35:45,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:35:45,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:35:45,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-12-13 09:35:45,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:39:10,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:39:10,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:39:10,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:39:10,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:10,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:10,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:10,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:10,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:39:10,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:10,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-13 09:39:10,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 257 states. [2022-12-13 09:39:10,589 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 09:39:10,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:39:10,778 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err15ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-12-13 09:39:10,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:39:10,780 INFO L85 PathProgramCache]: Analyzing trace with hash 864770673, now seen corresponding path program 1 times [2022-12-13 09:39:10,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:39:10,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859058522] [2022-12-13 09:39:10,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:39:10,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:39:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:39:12,607 INFO L134 CoverageAnalysis]: Checked inductivity of 31501 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 31470 trivial. 0 not checked. [2022-12-13 09:39:12,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:39:12,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859058522] [2022-12-13 09:39:12,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859058522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:39:12,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:39:12,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:39:12,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776259457] [2022-12-13 09:39:12,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:39:12,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:39:12,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:39:12,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:39:12,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:39:12,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:39:12,613 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:39:12,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:39:12,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:39:12,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:39:12,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:39:12,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:12,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:12,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:12,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:12,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:39:12,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:12,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-12-13 09:39:12,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 257 states. [2022-12-13 09:39:12,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:39:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:39:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:39:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:39:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:39:52,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:52,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-13 09:39:52,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 257 states. [2022-12-13 09:39:52,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:39:52,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 09:39:52,949 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err15ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-12-13 09:39:52,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:39:52,950 INFO L85 PathProgramCache]: Analyzing trace with hash -213620418, now seen corresponding path program 1 times [2022-12-13 09:39:52,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:39:52,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893125791] [2022-12-13 09:39:52,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:39:52,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:39:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:39:54,442 INFO L134 CoverageAnalysis]: Checked inductivity of 31501 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 31470 trivial. 0 not checked. [2022-12-13 09:39:54,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:39:54,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893125791] [2022-12-13 09:39:54,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893125791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:39:54,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:39:54,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:39:54,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816314730] [2022-12-13 09:39:54,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:39:54,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:39:54,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:39:54,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:39:54,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:39:54,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:39:54,446 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:39:54,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 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-12-13 09:39:54,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:39:54,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:39:54,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:39:54,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:54,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:54,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:54,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:54,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:39:54,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:54,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-12-13 09:39:54,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 257 states. [2022-12-13 09:39:54,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:39:54,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:40:40,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:40:40,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:40:40,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:40:40,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:40:40,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:40:40,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:40:40,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:40:40,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:40:40,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:40:40,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-13 09:40:40,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 257 states. [2022-12-13 09:40:40,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:40:40,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:40:40,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 09:40:40,264 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err14ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-12-13 09:40:40,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:40:40,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1368996488, now seen corresponding path program 1 times [2022-12-13 09:40:40,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:40:40,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056653317] [2022-12-13 09:40:40,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:40:40,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:40:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:41:16,792 INFO L134 CoverageAnalysis]: Checked inductivity of 31377 backedges. 0 proven. 31360 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 09:41:16,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:41:16,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056653317] [2022-12-13 09:41:16,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056653317] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:41:16,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239300331] [2022-12-13 09:41:16,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:41:16,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:41:16,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:41:16,794 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:41:16,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f135b0e5-5b52-4984-967d-3e3397dc5500/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 09:41:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:41:18,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 6718 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 09:41:18,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:41:18,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-13 09:41:18,261 INFO L350 Elim1Store]: Elim1 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-12-13 09:41:18,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:41:18,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 09:41:18,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:41:18,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:41:18,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-12-13 09:41:18,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:41:18,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:41:18,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:41:18,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-12-13 09:41:18,601 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 09:41:18,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-12-13 09:41:18,699 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 09:41:18,699 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 186 [2022-12-13 09:41:18,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 162 [2022-12-13 09:41:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 31377 backedges. 1383 proven. 0 refuted. 0 times theorem prover too weak. 29994 trivial. 0 not checked. [2022-12-13 09:41:24,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 09:41:24,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239300331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:41:24,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 09:41:24,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [43] total 50 [2022-12-13 09:41:24,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431696757] [2022-12-13 09:41:24,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:41:24,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 09:41:24,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:41:24,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 09:41:24,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=2421, Unknown=2, NotChecked=0, Total=2550 [2022-12-13 09:41:24,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:41:24,860 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:41:24,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 19.125) internal successors, (153), 9 states have internal predecessors, (153), 0 states have call successors, (0), 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-12-13 09:41:24,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:41:24,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:41:24,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:41:24,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:41:24,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:41:24,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:41:24,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:41:24,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:41:24,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:41:24,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-12-13 09:41:24,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 257 states. [2022-12-13 09:41:24,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:41:24,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:41:24,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:41:26,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:41:29,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:41:31,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:41:33,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:41:35,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:41:37,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:41:39,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:41:41,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:41:43,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:41:45,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:41:47,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:41:49,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:41:51,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:41:53,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:41:55,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:41:57,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:41:59,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:01,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:03,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:05,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:07,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:09,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:11,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:13,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:15,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:17,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:19,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:23,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:26,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:32,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:34,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:36,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:38,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:40,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:42,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:44,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:46,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:48,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:50,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:52,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:55,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:57,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:42:59,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:43:01,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:43:03,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:43:05,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:43:07,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:43:09,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:43:11,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:43:20,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:43:22,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:43:24,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:43:26,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:43:28,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:43:30,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:43:32,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 09:43:34,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]