./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/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_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/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_b3c3b134-0562-4855-96af-bde82a9c7689/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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- 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:28:22,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:28:22,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:28:22,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:28:22,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:28:22,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:28:22,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:28:22,467 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:28:22,469 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:28:22,470 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:28:22,471 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:28:22,472 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:28:22,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:28:22,473 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:28:22,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:28:22,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:28:22,476 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:28:22,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:28:22,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:28:22,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:28:22,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:28:22,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:28:22,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:28:22,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:28:22,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:28:22,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:28:22,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:28:22,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:28:22,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:28:22,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:28:22,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:28:22,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:28:22,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:28:22,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:28:22,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:28:22,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:28:22,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:28:22,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:28:22,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:28:22,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:28:22,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:28:22,499 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2022-12-13 09:28:22,520 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:28:22,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:28:22,520 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 09:28:22,521 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 09:28:22,521 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 09:28:22,521 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 09:28:22,522 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:28:22,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:28:22,522 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:28:22,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:28:22,522 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:28:22,522 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 09:28:22,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:28:22,523 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:28:22,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:28:22,523 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:28:22,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:28:22,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:28:22,523 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-12-13 09:28:22,524 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:28:22,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:28:22,524 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:28:22,524 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:28:22,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:28:22,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:28:22,525 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:28:22,525 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:28:22,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:28:22,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:28:22,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:28:22,525 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:28:22,526 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:28:22,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:28:22,526 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-13 09:28:22,526 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-12-13 09:28:22,526 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-12-13 09:28:22,526 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 09:28:22,526 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-12-13 09:28:22,527 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-12-13 09:28:22,527 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_b3c3b134-0562-4855-96af-bde82a9c7689/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_b3c3b134-0562-4855-96af-bde82a9c7689/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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-12-13 09:28:22,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:28:22,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:28:22,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:28:22,719 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:28:22,719 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:28:22,720 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-12-13 09:28:25,312 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:28:25,520 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:28:25,520 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-12-13 09:28:25,532 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/data/2355c4dcd/787ace76355c4c6f9df8f9283689124e/FLAGe3cf07b82 [2022-12-13 09:28:25,547 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/data/2355c4dcd/787ace76355c4c6f9df8f9283689124e [2022-12-13 09:28:25,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:28:25,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 09:28:25,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:28:25,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:28:25,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:28:25,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:28:25" (1/1) ... [2022-12-13 09:28:25,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b38d03c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:25, skipping insertion in model container [2022-12-13 09:28:25,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:28:25" (1/1) ... [2022-12-13 09:28:25,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:28:25,593 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:28:25,896 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_b3c3b134-0562-4855-96af-bde82a9c7689/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-12-13 09:28:25,899 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_b3c3b134-0562-4855-96af-bde82a9c7689/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-12-13 09:28:25,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:28:25,914 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:28:25,968 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_b3c3b134-0562-4855-96af-bde82a9c7689/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-12-13 09:28:25,972 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_b3c3b134-0562-4855-96af-bde82a9c7689/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-12-13 09:28:25,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:28:26,051 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:28:26,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26 WrapperNode [2022-12-13 09:28:26,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:28:26,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:28:26,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:28:26,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:28:26,060 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:28:26" (1/1) ... [2022-12-13 09:28:26,079 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:28:26" (1/1) ... [2022-12-13 09:28:26,114 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 387 [2022-12-13 09:28:26,115 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:28:26,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:28:26,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:28:26,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:28:26,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26" (1/1) ... [2022-12-13 09:28:26,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26" (1/1) ... [2022-12-13 09:28:26,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26" (1/1) ... [2022-12-13 09:28:26,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26" (1/1) ... [2022-12-13 09:28:26,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26" (1/1) ... [2022-12-13 09:28:26,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26" (1/1) ... [2022-12-13 09:28:26,169 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26" (1/1) ... [2022-12-13 09:28:26,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26" (1/1) ... [2022-12-13 09:28:26,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:28:26,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:28:26,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:28:26,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:28:26,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26" (1/1) ... [2022-12-13 09:28:26,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:28:26,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:28:26,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:28:26,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:28:26,234 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 09:28:26,234 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 09:28:26,234 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 09:28:26,234 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 09:28:26,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:28:26,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:28:26,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 09:28:26,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:28:26,235 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 09:28:26,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:28:26,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:28:26,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:28:26,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:28:26,236 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:28:26,356 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 09:28:26,358 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:28:26,829 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 09:28:26,838 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:28:26,838 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 09:28:26,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:28:26 BoogieIcfgContainer [2022-12-13 09:28:26,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:28:26,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:28:26,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:28:26,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:28:26,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:28:25" (1/3) ... [2022-12-13 09:28:26,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d231446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:28:26, skipping insertion in model container [2022-12-13 09:28:26,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:26" (2/3) ... [2022-12-13 09:28:26,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d231446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:28:26, skipping insertion in model container [2022-12-13 09:28:26,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:28:26" (3/3) ... [2022-12-13 09:28:26,848 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-12-13 09:28:26,855 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 09:28:26,864 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:28:26,865 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2022-12-13 09:28:26,865 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:28:26,976 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 09:28:27,012 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:28:27,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-12-13 09:28:27,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:28:27,013 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-12-13 09:28:27,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-12-13 09:28:27,056 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-12-13 09:28:27,067 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2022-12-13 09:28:27,074 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;@5dc90b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:28:27,074 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-12-13 09:28:27,345 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 09:28:27,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:27,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1735836568, now seen corresponding path program 1 times [2022-12-13 09:28:27,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:27,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148591733] [2022-12-13 09:28:27,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:27,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:27,618 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:28:27,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:27,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148591733] [2022-12-13 09:28:27,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148591733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:27,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:27,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:28:27,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543719601] [2022-12-13 09:28:27,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:27,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 09:28:27,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:27,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 09:28:27,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 09:28:27,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:27,654 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:28:27,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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:28:27,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:27,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:27,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:28:27,685 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 09:28:27,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:27,686 INFO L85 PathProgramCache]: Analyzing trace with hash -878463602, now seen corresponding path program 1 times [2022-12-13 09:28:27,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:27,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427585587] [2022-12-13 09:28:27,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:27,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:27,821 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:28:27,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:27,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427585587] [2022-12-13 09:28:27,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427585587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:27,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:27,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:28:27,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24975287] [2022-12-13 09:28:27,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:27,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:28:27,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:27,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:28:27,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:28:27,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:27,827 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:28:27,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 53.5) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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:28:27,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:27,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:27,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:27,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:27,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:28:27,932 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 09:28:27,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:27,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1686590530, now seen corresponding path program 1 times [2022-12-13 09:28:27,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:27,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774765708] [2022-12-13 09:28:27,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:27,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:28,579 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:28:28,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:28,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774765708] [2022-12-13 09:28:28,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774765708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:28,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:28,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:28:28,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030093573] [2022-12-13 09:28:28,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:28,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:28:28,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:28,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:28:28,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:28:28,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:28,585 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:28:28,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.0) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 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:28:28,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:28,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:28,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:28,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:28,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:28,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:28,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:28:28,895 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 09:28:28,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:28,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1332369795, now seen corresponding path program 1 times [2022-12-13 09:28:28,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:28,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311450075] [2022-12-13 09:28:28,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:28,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:29,480 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:28:29,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:29,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311450075] [2022-12-13 09:28:29,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311450075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:29,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:29,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:28:29,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323677509] [2022-12-13 09:28:29,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:29,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:28:29,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:29,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:28:29,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:28:29,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:29,486 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:28:29,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.4) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 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:28:29,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:29,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:29,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:29,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:29,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:29,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:29,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:29,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:29,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:28:29,723 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err3ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 09:28:29,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:29,724 INFO L85 PathProgramCache]: Analyzing trace with hash -442133752, now seen corresponding path program 1 times [2022-12-13 09:28:29,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:29,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764552271] [2022-12-13 09:28:29,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:29,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:30,171 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:28:30,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:30,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764552271] [2022-12-13 09:28:30,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764552271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:30,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:30,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:28:30,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199634217] [2022-12-13 09:28:30,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:30,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:28:30,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:30,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:28:30,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:28:30,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:30,176 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:28:30,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 28.0) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 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:28:30,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:30,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:30,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:30,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:30,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:30,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:30,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:30,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:30,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:30,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:30,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:28:30,349 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 09:28:30,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:30,349 INFO L85 PathProgramCache]: Analyzing trace with hash -402207731, now seen corresponding path program 1 times [2022-12-13 09:28:30,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:30,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365161348] [2022-12-13 09:28:30,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:30,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:30,722 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:28:30,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:30,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365161348] [2022-12-13 09:28:30,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365161348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:30,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:30,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:28:30,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622275587] [2022-12-13 09:28:30,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:30,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:28:30,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:30,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:28:30,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:28:30,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:30,726 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:28:30,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.6) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 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:28:30,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:30,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:30,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:30,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:30,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:30,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:31,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:31,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:28:31,066 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 09:28:31,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:31,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1067657820, now seen corresponding path program 1 times [2022-12-13 09:28:31,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:31,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237793534] [2022-12-13 09:28:31,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:31,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:31,534 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:28:31,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:31,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237793534] [2022-12-13 09:28:31,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237793534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:31,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:31,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:28:31,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232762966] [2022-12-13 09:28:31,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:31,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:28:31,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:31,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:28:31,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:28:31,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:31,537 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:28:31,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.2) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:28:31,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:31,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:31,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:31,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:31,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:31,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:31,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:31,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:31,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:31,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:31,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:31,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:31,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:31,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:31,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:28:31,782 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 09:28:31,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:31,783 INFO L85 PathProgramCache]: Analyzing trace with hash -396237207, now seen corresponding path program 1 times [2022-12-13 09:28:31,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:31,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750710754] [2022-12-13 09:28:31,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:31,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:32,304 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:28:32,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:32,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750710754] [2022-12-13 09:28:32,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750710754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:32,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:32,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:28:32,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783074841] [2022-12-13 09:28:32,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:32,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:28:32,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:32,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:28:32,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:28:32,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:32,307 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:28:32,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 35.8) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 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:28:32,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:32,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:32,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:32,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:32,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:32,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:32,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:32,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:32,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:32,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:32,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:32,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:32,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:32,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:32,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:32,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:32,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:28:32,549 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 09:28:32,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:32,550 INFO L85 PathProgramCache]: Analyzing trace with hash -868735545, now seen corresponding path program 1 times [2022-12-13 09:28:32,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:32,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783809918] [2022-12-13 09:28:32,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:32,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:34,756 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:28:34,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:34,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783809918] [2022-12-13 09:28:34,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783809918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:34,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:34,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-12-13 09:28:34,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297142649] [2022-12-13 09:28:34,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:34,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 09:28:34,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:34,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 09:28:34,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2022-12-13 09:28:34,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:34,760 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:28:34,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 8.590909090909092) internal successors, (189), 23 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:28:34,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:34,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:34,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:34,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:34,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:34,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:34,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:34,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:34,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:36,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:36,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:36,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:36,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:36,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:36,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:36,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:36,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:36,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:28:36,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:28:36,674 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 09:28:36,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:36,675 INFO L85 PathProgramCache]: Analyzing trace with hash -156445024, now seen corresponding path program 1 times [2022-12-13 09:28:36,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:36,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183725028] [2022-12-13 09:28:36,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:36,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:37,217 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-13 09:28:37,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:37,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183725028] [2022-12-13 09:28:37,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183725028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:37,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:37,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:28:37,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092031342] [2022-12-13 09:28:37,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:37,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:28:37,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:37,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:28:37,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:28:37,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:37,220 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:28:37,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 39.8) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 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:28:37,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:37,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:37,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:37,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:37,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:37,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:37,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:37,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:37,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:28:37,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:37,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:37,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:37,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:37,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:37,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:37,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:37,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:37,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:37,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:28:37,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:37,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:28:37,538 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 09:28:37,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:37,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1000896702, now seen corresponding path program 1 times [2022-12-13 09:28:37,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:37,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459864207] [2022-12-13 09:28:37,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:37,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:28:39,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:39,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459864207] [2022-12-13 09:28:39,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459864207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:39,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:39,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-12-13 09:28:39,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674668727] [2022-12-13 09:28:39,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:39,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 09:28:39,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:39,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 09:28:39,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-12-13 09:28:39,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:39,361 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:28:39,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.117647058823529) internal successors, (257), 17 states have internal predecessors, (257), 0 states have call successors, (0), 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:28:39,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:39,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:39,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:39,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:39,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:39,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:39,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:39,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:39,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:28:39,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:39,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:40,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:40,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:40,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:40,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:40,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:40,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:40,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:40,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:40,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:28:40,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:40,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 09:28:40,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:28:40,606 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 09:28:40,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:40,607 INFO L85 PathProgramCache]: Analyzing trace with hash 392687094, now seen corresponding path program 1 times [2022-12-13 09:28:40,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:40,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985918414] [2022-12-13 09:28:40,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:40,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:43,250 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:28:43,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:43,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985918414] [2022-12-13 09:28:43,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985918414] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:28:43,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347295452] [2022-12-13 09:28:43,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:43,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:28:43,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:28:43,281 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:28:43,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 09:28:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:43,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-13 09:28:43,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:28:43,659 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 09:28:43,659 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:28:43,964 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 13 treesize of output 9 [2022-12-13 09:28:44,103 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 23 treesize of output 22 [2022-12-13 09:28:44,471 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 16 treesize of output 18 [2022-12-13 09:28:44,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:28:44,836 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:28:44,836 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-13 09:28:45,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:28:45,025 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 23 treesize of output 22 [2022-12-13 09:28:45,427 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 31 treesize of output 15 [2022-12-13 09:28:45,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:28:45,581 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 16 treesize of output 18 [2022-12-13 09:28:45,813 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:28:45,814 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 31 treesize of output 27 [2022-12-13 09:28:45,913 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 23 treesize of output 22 [2022-12-13 09:28:45,939 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:28:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:28:45,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:28:46,275 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1557 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1556) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1557)) .cse1)) 400))) is different from false [2022-12-13 09:28:46,324 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1557 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post47#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1556) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1557)) .cse1))))) is different from false [2022-12-13 09:28:46,331 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1557 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem46#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1556) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1557)) .cse1))))) is different from false [2022-12-13 09:28:46,355 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1557 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1556) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1557)) .cse1))))) is different from false [2022-12-13 09:28:46,431 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1552 Int) (v_ArrVal_1557 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1552) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1556) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1557)) .cse1))))) is different from false [2022-12-13 09:28:46,514 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1552 Int) (v_ArrVal_1551 Int) (v_ArrVal_1557 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1551)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1552) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1556) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1557)) .cse1))))) is different from false [2022-12-13 09:28:46,563 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_27| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1552 Int) (v_ArrVal_1551 Int) (v_ArrVal_1557 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_27| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1551))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1552) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1556) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1557)) .cse1))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_27| (select .cse4 .cse3)))))) is different from false [2022-12-13 09:28:46,582 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1552 Int) (v_ArrVal_1551 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_27| Int) (v_ArrVal_1557 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_27| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1551))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1552) .cse3 (+ 1 (select .cse2 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_1556) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1557)) .cse1)))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_27| (select .cse4 .cse3)))))) is different from false [2022-12-13 09:28:46,827 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1552 Int) (v_ArrVal_1551 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_27| Int) (v_ArrVal_1557 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1549))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_27| 4) |c_~#queue~0.offset|) v_ArrVal_1551))) (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1552) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1556) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1557)) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_27| (select .cse4 .cse1))))))) is different from false [2022-12-13 09:28:47,225 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1552 Int) (v_ArrVal_1551 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_27| Int) (v_ArrVal_1547 Int) (v_ArrVal_1557 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1549))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_27| (select .cse0 .cse1))) (not (= 400 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_27| 4) |c_~#queue~0.offset|) v_ArrVal_1551))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1552) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1556) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1557)) .cse1))))))) is different from false [2022-12-13 09:28:47,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:28:47,321 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 2 case distinctions, treesize of input 240 treesize of output 155 [2022-12-13 09:28:47,333 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:28:47,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 225 [2022-12-13 09:28:47,340 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 212 treesize of output 188 [2022-12-13 09:28:47,346 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 248 treesize of output 232 [2022-12-13 09:28:47,401 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 8 treesize of output 4 [2022-12-13 09:28:47,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:28:47,429 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 120 treesize of output 108 [2022-12-13 09:28:47,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:28:47,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2022-12-13 09:28:47,809 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 43 not checked. [2022-12-13 09:28:47,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347295452] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:28:47,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:28:47,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22, 25] total 69 [2022-12-13 09:28:47,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133902548] [2022-12-13 09:28:47,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:28:47,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-12-13 09:28:47,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:47,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-12-13 09:28:47,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=444, Invalid=3008, Unknown=10, NotChecked=1230, Total=4692 [2022-12-13 09:28:47,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:47,816 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:28:47,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 10.231884057971014) internal successors, (706), 69 states have internal predecessors, (706), 0 states have call successors, (0), 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:28:47,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:47,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:47,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:47,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:47,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:47,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:47,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:47,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:47,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:28:47,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:47,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-12-13 09:28:47,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:53,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:53,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:53,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:53,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:53,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:53,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:53,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:53,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:53,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:28:53,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:53,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 09:28:53,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 09:28:53,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 09:28:53,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 09:28:53,769 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 09:28:53,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:53,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1021816630, now seen corresponding path program 1 times [2022-12-13 09:28:53,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:53,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805645100] [2022-12-13 09:28:53,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:53,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:55,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2022-12-13 09:28:55,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:55,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805645100] [2022-12-13 09:28:55,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805645100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:55,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:55,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 09:28:55,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170831812] [2022-12-13 09:28:55,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:55,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:28:55,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:55,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:28:55,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:28:55,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:55,506 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:28:55,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.666666666666664) internal successors, (376), 6 states have internal predecessors, (376), 0 states have call successors, (0), 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:28:55,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:55,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:55,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:55,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:55,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:55,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:55,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:55,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:55,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:28:55,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:55,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-12-13 09:28:55,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-12-13 09:28:55,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:56,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:56,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:56,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:28:56,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 09:28:56,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 09:28:56,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 09:28:56,200 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 09:28:56,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:56,201 INFO L85 PathProgramCache]: Analyzing trace with hash -407223782, now seen corresponding path program 1 times [2022-12-13 09:28:56,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:56,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514062251] [2022-12-13 09:28:56,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:56,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1848 backedges. 969 proven. 0 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2022-12-13 09:28:56,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:56,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514062251] [2022-12-13 09:28:56,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514062251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:56,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:56,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:28:56,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677469629] [2022-12-13 09:28:56,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:56,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:28:56,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:56,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:28:56,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:28:56,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:56,876 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:28:56,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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:28:56,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:56,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:56,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:28:56,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-12-13 09:28:56,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-12-13 09:28:56,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:56,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:28:56,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:56,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:28:56,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 09:28:56,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 09:28:56,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:56,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:56,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 09:28:56,928 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 09:28:56,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:56,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1181757217, now seen corresponding path program 1 times [2022-12-13 09:28:56,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:56,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997605418] [2022-12-13 09:28:56,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:56,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:59,011 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2022-12-13 09:28:59,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:59,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997605418] [2022-12-13 09:28:59,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997605418] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:28:59,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317186153] [2022-12-13 09:28:59,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:59,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:28:59,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:28:59,013 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:28:59,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 09:28:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:59,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 1592 conjuncts, 127 conjunts are in the unsatisfiable core [2022-12-13 09:28:59,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:28:59,403 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 09:28:59,404 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:28:59,567 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 13 treesize of output 9 [2022-12-13 09:28:59,666 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 23 treesize of output 22 [2022-12-13 09:28:59,985 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 16 treesize of output 18 [2022-12-13 09:29:00,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:29:00,256 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:29:00,257 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-13 09:29:00,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:29:00,429 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 23 treesize of output 22 [2022-12-13 09:29:00,712 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 31 treesize of output 15 [2022-12-13 09:29:00,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:29:00,805 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 16 treesize of output 18 [2022-12-13 09:29:01,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:29:01,130 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:29:01,130 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-13 09:29:01,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:29:01,336 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 23 treesize of output 22 [2022-12-13 09:29:01,738 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 31 treesize of output 15 [2022-12-13 09:29:01,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:29:01,863 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 16 treesize of output 18 [2022-12-13 09:29:02,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:29:02,216 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:29:02,217 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-13 09:29:02,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:29:02,427 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 23 treesize of output 22 [2022-12-13 09:29:02,981 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 31 treesize of output 15 [2022-12-13 09:29:03,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:29:03,131 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 16 treesize of output 18 [2022-12-13 09:29:03,392 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:29:03,392 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-13 09:29:03,474 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 23 treesize of output 22 [2022-12-13 09:29:03,522 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:29:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 244 proven. 396 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 09:29:03,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:29:03,975 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3632 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post47#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse1)))))) is different from false [2022-12-13 09:29:04,491 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_3626 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3632 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3626) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse1)))))) (= 400 .cse4)))) is different from false [2022-12-13 09:29:04,652 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3626 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3624 Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3632 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3624)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select .cse3 .cse4))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3626) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse0 .cse1))) (= .cse2 400)))))) is different from false [2022-12-13 09:29:04,744 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse0 .cse1))) (forall ((v_ArrVal_3626 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3624 Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3632 Int)) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3624))) (let ((.cse4 (select .cse5 .cse1))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3626) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse2 .cse3))) (= .cse4 400) (not (= 400 (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse3))))))))))) is different from false [2022-12-13 09:29:04,786 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3626 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3624 Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3632 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4)) v_ArrVal_3624)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse2 (select .cse5 .cse4))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_3626) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse0 .cse1))) (= 400 .cse2) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse3 .cse4))) (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse1))))))))) is different from false [2022-12-13 09:29:05,988 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3626 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3624 Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3632 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int) (v_ArrVal_3623 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3623))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4) |c_~#queue~0.offset|) v_ArrVal_3624)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (let ((.cse1 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_3626) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|))) (or (= 400 .cse0) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse1 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse3 .cse2))) (not (= 400 (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse2)))))))))) is different from false [2022-12-13 09:29:06,756 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_3626 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3624 Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3632 Int) (v_ArrVal_3620 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int) (v_ArrVal_3623 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3620) .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_3623))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4) |c_~#queue~0.offset|) v_ArrVal_3624)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select .cse5 .cse1))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_3626) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse2 .cse1))) (not (= 400 (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse1))) (= 400 .cse3)))))))) (= 400 .cse8)))) is different from false [2022-12-13 09:29:07,218 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3617 Int) (v_ArrVal_3626 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3624 Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3632 Int) (v_ArrVal_3620 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int) (v_ArrVal_3623 (Array Int Int))) (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3617)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select .cse7 .cse8))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3620) .cse8 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_3623))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4) |c_~#queue~0.offset|) v_ArrVal_3624)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select .cse6 .cse1))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_3626) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse1))) (= 400 .cse2) (= 400 .cse3) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse0 .cse1)))))))))))) is different from false [2022-12-13 09:29:07,872 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| Int) (v_ArrVal_3617 Int) (v_ArrVal_3626 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3624 Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3632 Int) (v_ArrVal_3620 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int) (v_ArrVal_3623 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse9 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_3617)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse9 .cse6))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_3620) .cse6 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_3623))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4) |c_~#queue~0.offset|) v_ArrVal_3624)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select .cse8 .cse1))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_3626) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse2 .cse1))) (= 400 .cse3) (= 400 .cse4) (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| (select .cse5 .cse6))))))))))))) is different from false [2022-12-13 09:29:12,020 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3617 Int) (v_ArrVal_3626 Int) (v_ArrVal_3613 Int) (v_ArrVal_3624 Int) (v_ArrVal_3632 Int) (v_ArrVal_3611 Int) (v_ArrVal_3620 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3623 (Array Int Int)) (v_ArrVal_3616 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse11 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3611)) (.cse12 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse11 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3613) .cse12 (+ (select .cse11 .cse12) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3616))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse10 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| 4) |c_~#queue~0.offset|) v_ArrVal_3617)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (select .cse10 .cse1))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse8 v_ArrVal_3620) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_3623))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4) |c_~#queue~0.offset|) v_ArrVal_3624))) (let ((.cse2 (select .cse7 .cse1))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_3626) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse0 .cse1))) (= 400 .cse2) (= 400 .cse3) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse5 .cse1))) (not (= 400 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse1)))))))))))))) is different from false [2022-12-13 09:29:12,284 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_43| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_43| (select .cse0 .cse1))) (forall ((v_ArrVal_3617 Int) (v_ArrVal_3626 Int) (v_ArrVal_3613 Int) (v_ArrVal_3624 Int) (v_ArrVal_3632 Int) (v_ArrVal_3611 Int) (v_ArrVal_3620 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3623 (Array Int Int)) (v_ArrVal_3616 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse13 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_43| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3611))) (store (store .cse13 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3613) .cse1 (+ (select .cse13 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3616))) (let ((.cse4 (select .cse11 |c_~#queue~0.base|))) (let ((.cse12 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| 4) |c_~#queue~0.offset|) v_ArrVal_3617)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (select .cse12 .cse3))) (let ((.cse8 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse10 v_ArrVal_3620) .cse3 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_3623))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse9 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4) |c_~#queue~0.offset|) v_ArrVal_3624))) (let ((.cse5 (select .cse9 .cse3))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse10 v_ArrVal_3626) .cse3 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse2 .cse3))) (not (= 400 (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| (select .cse4 .cse3))) (= 400 .cse5) (= .cse6 400) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse7 .cse3))))))))))))))))) is different from false [2022-12-13 09:29:13,812 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3617 Int) (v_ArrVal_3609 (Array Int Int)) (v_ArrVal_3626 Int) (v_ArrVal_3613 Int) (v_ArrVal_3624 Int) (v_ArrVal_3632 Int) (v_ArrVal_3611 Int) (v_ArrVal_3620 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_43| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3623 (Array Int Int)) (v_ArrVal_3616 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_3609))) (let ((.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse5 (select .cse12 |c_~#queue~0.base|))) (let ((.cse10 (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_43| 4)) v_ArrVal_3611))) (store (store .cse13 .cse9 v_ArrVal_3613) .cse2 (+ (select .cse13 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3616))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse11 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| 4) |c_~#queue~0.offset|) v_ArrVal_3617))) (let ((.cse0 (select .cse11 .cse2))) (let ((.cse7 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse9 v_ArrVal_3620) .cse2 (+ 1 .cse0))) |c_~#stored_elements~0.base| v_ArrVal_3623))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4) |c_~#queue~0.offset|) v_ArrVal_3624))) (let ((.cse3 (select .cse8 .cse2))) (let ((.cse1 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_3626) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|))) (or (= 400 .cse0) (not (= 400 (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse2))) (= 400 .cse3) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse1 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| (select .cse4 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_43| (select .cse5 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse6 .cse2)))))))))))))))) is different from false [2022-12-13 09:29:15,498 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3617 Int) (v_ArrVal_3609 (Array Int Int)) (v_ArrVal_3626 Int) (v_ArrVal_3613 Int) (v_ArrVal_3624 Int) (v_ArrVal_3632 Int) (v_ArrVal_3611 Int) (v_ArrVal_3620 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_43| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| Int) (v_ArrVal_3630 (Array Int Int)) (v_ArrVal_3623 (Array Int Int)) (v_ArrVal_3616 (Array Int Int)) (v_ArrVal_3608 Int)) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_3608)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_3609))) (let ((.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse12 |c_~#queue~0.base|))) (let ((.cse10 (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_43| 4)) v_ArrVal_3611))) (store (store .cse13 .cse9 v_ArrVal_3613) .cse1 (+ (select .cse13 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3616))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse11 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| 4) |c_~#queue~0.offset|) v_ArrVal_3617))) (let ((.cse5 (select .cse11 .cse1))) (let ((.cse7 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse9 v_ArrVal_3620) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_3623))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| 4) |c_~#queue~0.offset|) v_ArrVal_3624))) (let ((.cse6 (select .cse8 .cse1))) (let ((.cse3 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_3626) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_3630) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_37| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_43| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_40| (select .cse4 .cse1))) (= 400 .cse5) (= 400 .cse6) (not (= 400 (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_34| 4)) v_ArrVal_3632) .cse1)))))))))))))))) is different from false [2022-12-13 09:29:15,910 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:29:15,910 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 2 case distinctions, treesize of input 2952 treesize of output 1787 [2022-12-13 09:29:15,943 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:29:15,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2657 treesize of output 2619 [2022-12-13 09:29:15,978 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 2194 treesize of output 2166 [2022-12-13 09:29:16,007 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 1689 treesize of output 1625 [2022-12-13 09:29:16,036 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 2385 treesize of output 2321 [2022-12-13 09:29:16,065 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 2652 treesize of output 2604 [2022-12-13 09:29:16,110 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 8 treesize of output 4 [2022-12-13 09:29:19,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:29:19,611 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 1144 treesize of output 1092 [2022-12-13 09:29:20,581 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:29:20,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2022-12-13 09:29:20,728 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 244 proven. 156 refuted. 93 times theorem prover too weak. 8 trivial. 147 not checked. [2022-12-13 09:29:20,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317186153] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:29:20,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:29:20,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 37, 47] total 91 [2022-12-13 09:29:20,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544282745] [2022-12-13 09:29:20,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:29:20,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-12-13 09:29:20,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:29:20,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-12-13 09:29:20,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=799, Invalid=5001, Unknown=258, NotChecked=2132, Total=8190 [2022-12-13 09:29:20,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:29:20,732 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:29:20,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 12.45054945054945) internal successors, (1133), 91 states have internal predecessors, (1133), 0 states have call successors, (0), 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:29:20,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:29:20,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:29:20,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:29:20,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:29:20,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:29:20,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:29:20,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:29:20,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:29:20,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:29:20,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:29:20,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-12-13 09:29:20,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-12-13 09:29:20,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:29:20,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:29:20,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:40,839 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 [1] [2022-12-13 09:30:55,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:30:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 09:30:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 09:30:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-12-13 09:30:55,048 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 09:30:55,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 09:30:55,243 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err10ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 09:30:55,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:55,244 INFO L85 PathProgramCache]: Analyzing trace with hash 353711794, now seen corresponding path program 1 times [2022-12-13 09:30:55,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:55,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477496779] [2022-12-13 09:30:55,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:55,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5596 trivial. 0 not checked. [2022-12-13 09:30:55,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:55,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477496779] [2022-12-13 09:30:55,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477496779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:55,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:55,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:30:55,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792901556] [2022-12-13 09:30:55,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:55,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:30:55,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:55,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:30:55,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:30:55,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:55,886 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:55,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 110.5) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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:55,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:55,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:55,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:30:55,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-12-13 09:30:55,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-12-13 09:30:55,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:55,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-12-13 09:30:55,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:30:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 09:30:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 09:30:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-12-13 09:30:55,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:55,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 09:30:55,993 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 09:30:55,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:55,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1589877058, now seen corresponding path program 1 times [2022-12-13 09:30:55,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:55,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874534512] [2022-12-13 09:30:55,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:55,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:56,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5596 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5596 trivial. 0 not checked. [2022-12-13 09:30:56,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:56,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874534512] [2022-12-13 09:30:56,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874534512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:56,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:56,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:30:56,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070806070] [2022-12-13 09:30:56,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:56,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:30:56,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:56,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:30:56,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:30:56,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:56,555 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:56,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 113.0) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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:56,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:56,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:56,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:56,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:56,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:56,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:56,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:56,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:56,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:30:56,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:56,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-12-13 09:30:56,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-12-13 09:30:56,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:56,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:56,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-12-13 09:30:56,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:56,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:30:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 09:30:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 09:30:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:30:57,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:57,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-12-13 09:30:57,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:57,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:57,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 09:30:57,048 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 09:30:57,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:57,048 INFO L85 PathProgramCache]: Analyzing trace with hash -897651276, now seen corresponding path program 1 times [2022-12-13 09:30:57,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:57,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580227742] [2022-12-13 09:30:57,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:57,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4651 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 4073 trivial. 0 not checked. [2022-12-13 09:31:01,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:01,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580227742] [2022-12-13 09:31:01,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580227742] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:31:01,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497034841] [2022-12-13 09:31:01,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:01,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:31:01,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:31:01,547 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:31:01,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 09:31:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:02,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 3427 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 09:31:02,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:31:06,243 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 13 treesize of output 9 [2022-12-13 09:31:06,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:31:06,365 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 16 treesize of output 18 [2022-12-13 09:31:06,545 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:31:06,545 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-13 09:31:06,625 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 23 treesize of output 22 [2022-12-13 09:31:06,667 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:31:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4651 backedges. 1290 proven. 622 refuted. 0 times theorem prover too weak. 2739 trivial. 0 not checked. [2022-12-13 09:31:06,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:31:07,113 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:31:07,114 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 54 treesize of output 44 [2022-12-13 09:31:07,121 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:31:07,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 83 [2022-12-13 09:31:07,126 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 78 treesize of output 70 [2022-12-13 09:31:07,138 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 8 treesize of output 4 [2022-12-13 09:31:07,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:31:07,178 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 52 treesize of output 48 [2022-12-13 09:31:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4651 backedges. 1290 proven. 580 refuted. 0 times theorem prover too weak. 2781 trivial. 0 not checked. [2022-12-13 09:31:08,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497034841] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:31:08,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:31:08,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 33 [2022-12-13 09:31:08,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860510300] [2022-12-13 09:31:08,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:31:08,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 09:31:08,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:08,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 09:31:08,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=931, Unknown=4, NotChecked=0, Total=1056 [2022-12-13 09:31:08,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:08,398 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:31:08,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 30.333333333333332) internal successors, (1001), 33 states have internal predecessors, (1001), 0 states have call successors, (0), 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:08,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:08,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:08,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:08,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:08,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:08,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:08,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:08,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:08,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:31:08,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:08,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-12-13 09:31:08,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-12-13 09:31:08,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:08,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:08,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-12-13 09:31:08,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:08,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:08,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:11,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:11,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:11,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:11,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:11,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:11,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:11,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:11,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:11,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:31:11,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:11,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 09:31:11,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 09:31:11,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:11,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:11,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-12-13 09:31:11,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:11,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:11,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:31:11,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 09:31:11,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 09:31:11,810 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 09:31:11,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:11,810 INFO L85 PathProgramCache]: Analyzing trace with hash 59288543, now seen corresponding path program 1 times [2022-12-13 09:31:11,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:11,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645276549] [2022-12-13 09:31:11,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:11,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:17,843 INFO L134 CoverageAnalysis]: Checked inductivity of 9504 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 8976 trivial. 0 not checked. [2022-12-13 09:31:17,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:17,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645276549] [2022-12-13 09:31:17,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645276549] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:31:17,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261004023] [2022-12-13 09:31:17,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:17,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:31:17,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:31:17,845 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:31:17,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 09:31:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:18,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 4655 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-13 09:31:18,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:31:24,490 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 13 treesize of output 9 [2022-12-13 09:31:24,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:31:24,589 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 16 treesize of output 18 [2022-12-13 09:31:24,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:31:24,924 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:31:24,924 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-13 09:31:25,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:31:25,128 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 23 treesize of output 22 [2022-12-13 09:31:25,486 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 31 treesize of output 15 [2022-12-13 09:31:25,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:31:25,583 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 16 treesize of output 18 [2022-12-13 09:31:25,741 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:31:25,741 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 31 treesize of output 27 [2022-12-13 09:31:25,802 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 23 treesize of output 22 [2022-12-13 09:31:25,833 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:31:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 9504 backedges. 4259 proven. 763 refuted. 0 times theorem prover too weak. 4482 trivial. 0 not checked. [2022-12-13 09:31:25,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:31:26,081 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9775 (Array Int Int)) (v_ArrVal_9777 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_9775) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_9777)) .cse1))))) is different from false [2022-12-13 09:31:26,452 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9775 (Array Int Int)) (v_ArrVal_9772 Int) (v_ArrVal_9777 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_9772) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_9775) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_9777)) .cse1))))) is different from false [2022-12-13 09:31:26,524 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9775 (Array Int Int)) (v_ArrVal_9772 Int) (v_ArrVal_9777 Int) (v_ArrVal_9769 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_9769)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_9772) .cse3 (+ 1 (select .cse2 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_9775) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_9777)) .cse1))))) is different from false [2022-12-13 09:31:26,561 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_96| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_96| (select .cse0 .cse1))) (forall ((v_ArrVal_9775 (Array Int Int)) (v_ArrVal_9772 Int) (v_ArrVal_9777 Int) (v_ArrVal_9769 Int)) (not (= 400 (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_96| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_9769))) (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_9772) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_9775) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_9777)) .cse3)))))))) is different from false [2022-12-13 09:31:26,583 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_96| Int) (v_ArrVal_9775 (Array Int Int)) (v_ArrVal_9772 Int) (v_ArrVal_9777 Int) (v_ArrVal_9769 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse2 (store .cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_96| 4)) v_ArrVal_9769))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_9772) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_9775) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_9777)) .cse1)))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_96| (select .cse4 .cse3)))))) is different from false [2022-12-13 09:31:26,987 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:31:26,987 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 205 treesize of output 145 [2022-12-13 09:31:26,996 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:31:26,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 225 [2022-12-13 09:31:27,002 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 212 treesize of output 188 [2022-12-13 09:31:27,006 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 248 treesize of output 232 [2022-12-13 09:31:27,027 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 8 treesize of output 4 [2022-12-13 09:31:27,040 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:31:27,041 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 116 treesize of output 104 [2022-12-13 09:31:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 9504 backedges. 3772 proven. 746 refuted. 0 times theorem prover too weak. 4482 trivial. 504 not checked. [2022-12-13 09:31:28,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261004023] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:31:28,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:31:28,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20, 22] total 49 [2022-12-13 09:31:28,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695183725] [2022-12-13 09:31:28,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:31:28,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-13 09:31:28,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:28,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-13 09:31:28,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1621, Unknown=41, NotChecked=440, Total=2352 [2022-12-13 09:31:28,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:28,239 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:31:28,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 23.3265306122449) internal successors, (1143), 49 states have internal predecessors, (1143), 0 states have call successors, (0), 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,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:28,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:28,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:28,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:28,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:28,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:28,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:28,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:28,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:31:28,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:28,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-12-13 09:31:28,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-12-13 09:31:28,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:28,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:28,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-12-13 09:31:28,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:28,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:28,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:31:28,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:39,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:39,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:39,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:31:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 09:31:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 09:31:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-12-13 09:31:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:39,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:39,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 09:31:39,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-12-13 09:31:39,648 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 09:31:39,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:31:39,836 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-12-13 09:31:39,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:39,837 INFO L85 PathProgramCache]: Analyzing trace with hash -166947963, now seen corresponding path program 1 times [2022-12-13 09:31:39,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:39,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69305473] [2022-12-13 09:31:39,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:39,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:33:24,073 INFO L134 CoverageAnalysis]: Checked inductivity of 25593 backedges. 11132 proven. 2086 refuted. 0 times theorem prover too weak. 12375 trivial. 0 not checked. [2022-12-13 09:33:24,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:33:24,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69305473] [2022-12-13 09:33:24,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69305473] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:33:24,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376110765] [2022-12-13 09:33:24,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:33:24,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:33:24,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:33:24,075 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:33:24,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3c3b134-0562-4855-96af-bde82a9c7689/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 09:33:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:33:25,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 7286 conjuncts, 154 conjunts are in the unsatisfiable core [2022-12-13 09:33:25,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:33:31,269 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 13 treesize of output 9 [2022-12-13 09:33:31,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:33:31,378 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 16 treesize of output 18 [2022-12-13 09:33:31,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:33:31,741 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:33:31,741 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 31 treesize of output 27 [2022-12-13 09:33:31,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:33:31,995 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 23 treesize of output 22 [2022-12-13 09:33:32,496 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 31 treesize of output 15 [2022-12-13 09:33:32,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:33:32,658 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 16 treesize of output 18 [2022-12-13 09:33:33,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:33:33,071 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:33:33,072 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 31 treesize of output 27 [2022-12-13 09:33:33,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:33:33,306 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 23 treesize of output 22 [2022-12-13 09:33:33,814 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 31 treesize of output 15 [2022-12-13 09:33:33,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:33:33,993 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 16 treesize of output 18 [2022-12-13 09:33:34,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:33:34,442 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:33:34,443 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-13 09:33:34,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:33:34,818 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 23 treesize of output 22 [2022-12-13 09:33:35,675 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 31 treesize of output 15 [2022-12-13 09:33:35,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:33:35,875 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 16 treesize of output 18 [2022-12-13 09:33:36,474 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:33:36,483 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:33:36,483 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 31 treesize of output 27 [2022-12-13 09:33:36,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:33:36,889 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 23 treesize of output 22 [2022-12-13 09:33:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 25593 backedges. 16142 proven. 2698 refuted. 0 times theorem prover too weak. 6753 trivial. 0 not checked. [2022-12-13 09:33:37,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:33:38,024 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13639 (Array Int Int)) (v_ArrVal_13640 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post47#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_13639) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_13640)) .cse1))))) is different from false [2022-12-13 09:33:38,033 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13639 (Array Int Int)) (v_ArrVal_13640 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem46#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_13639) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_13640)) .cse1))))) is different from false [2022-12-13 09:33:38,250 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13636 Int) (v_ArrVal_13639 (Array Int Int)) (v_ArrVal_13640 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13636) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_13639) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_13640)) .cse1)) 400))) is different from false [2022-12-13 09:33:38,340 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13636 Int) (v_ArrVal_13633 Int) (v_ArrVal_13639 (Array Int Int)) (v_ArrVal_13640 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13633)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13636) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_13639) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_13640)) .cse1))))) is different from false [2022-12-13 09:33:38,386 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| (select .cse0 .cse1))) (forall ((v_ArrVal_13636 Int) (v_ArrVal_13633 Int) (v_ArrVal_13639 (Array Int Int)) (v_ArrVal_13640 Int)) (not (= 400 (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13633))) (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13636) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_13639) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* 4 (select .cse2 .cse3))) v_ArrVal_13640)) .cse3)))))))) is different from false [2022-12-13 09:33:38,413 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| Int) (v_ArrVal_13636 Int) (v_ArrVal_13633 Int) (v_ArrVal_13639 (Array Int Int)) (v_ArrVal_13640 Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| (select .cse0 .cse1))) (not (= 400 (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse4 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171|)) v_ArrVal_13633))) (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_13636) .cse1 (+ 1 (select .cse4 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_13639) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_13640)) .cse3))))))) is different from false [2022-12-13 09:33:39,360 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| Int) (v_ArrVal_13632 (Array Int Int)) (v_ArrVal_13636 Int) (v_ArrVal_13633 Int) (v_ArrVal_13639 (Array Int Int)) (v_ArrVal_13640 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_13632))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171|)) v_ArrVal_13633))) (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_13636) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_13639) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_13640)) .cse1) 400)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| (select .cse4 .cse1))))))) is different from false [2022-12-13 09:33:39,527 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| Int) (v_ArrVal_13628 Int) (v_ArrVal_13632 (Array Int Int)) (v_ArrVal_13636 Int) (v_ArrVal_13633 Int) (v_ArrVal_13639 (Array Int Int)) (v_ArrVal_13640 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13628) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_13632))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| (select .cse0 .cse1))) (not (= 400 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171|)) v_ArrVal_13633))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_13636) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_13639) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_13640)) .cse1))))))) is different from false [2022-12-13 09:33:39,701 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| Int) (v_ArrVal_13628 Int) (v_ArrVal_13627 Int) (v_ArrVal_13632 (Array Int Int)) (v_ArrVal_13636 Int) (v_ArrVal_13633 Int) (v_ArrVal_13639 (Array Int Int)) (v_ArrVal_13640 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13627)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13628) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_13632))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171|)) v_ArrVal_13633))) (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_13636) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_13639) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_13640)) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| (select .cse4 .cse1))))))) is different from false [2022-12-13 09:33:39,780 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| Int) (v_ArrVal_13628 Int) (v_ArrVal_13627 Int) (v_ArrVal_13632 (Array Int Int)) (v_ArrVal_13636 Int) (v_ArrVal_13633 Int) (v_ArrVal_13639 (Array Int Int)) (v_ArrVal_13640 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse5 (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse7 (+ (* (select .cse7 .cse6) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13627)))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13628) .cse6 (+ (select .cse5 .cse6) 1))))) |c_~#stored_elements~0.base| v_ArrVal_13632))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| (select .cse0 .cse1))) (not (= 400 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171|)) v_ArrVal_13633))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_13636) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_13639) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse1)) |c_~#queue~0.offset|) v_ArrVal_13640)) .cse1))))))) is different from false [2022-12-13 09:33:39,809 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| Int) (v_ArrVal_13628 Int) (v_ArrVal_13627 Int) (v_ArrVal_13632 (Array Int Int)) (v_ArrVal_13636 Int) (v_ArrVal_13633 Int) (v_ArrVal_13639 (Array Int Int)) (v_ArrVal_13640 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse5 (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse7 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse7 .cse6) 4)) v_ArrVal_13627)))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_13628) .cse6 (+ (select .cse5 .cse6) 1))))) |c_~#stored_elements~0.base| v_ArrVal_13632))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171|)) v_ArrVal_13633))) (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_13636) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_13639) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_13640)) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_171| (select .cse4 .cse1))))))) is different from false [2022-12-13 09:33:45,670 INFO L321 Elim1Store]: treesize reduction 1121, result has 28.6 percent of original size [2022-12-13 09:33:45,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 3394 treesize of output 1080 [2022-12-13 09:33:45,775 INFO L321 Elim1Store]: treesize reduction 52, result has 13.3 percent of original size [2022-12-13 09:33:45,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 1233 treesize of output 1242 [2022-12-13 09:33:46,214 INFO L321 Elim1Store]: treesize reduction 137, result has 34.8 percent of original size [2022-12-13 09:33:46,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 31 case distinctions, treesize of input 1461 treesize of output 2833 [2022-12-13 09:33:46,321 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 812 treesize of output 764 [2022-12-13 09:33:46,384 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 747 treesize of output 675 [2022-12-13 09:33:47,053 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 8 treesize of output 4 [2022-12-13 09:33:47,317 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 8 treesize of output 4 [2022-12-13 09:33:47,347 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 8 treesize of output 4 [2022-12-13 09:33:47,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:33:47,906 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 09:33:47,907 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 1 case distinctions, treesize of input 579 treesize of output 465 [2022-12-13 09:33:49,068 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:33:49,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 3653 treesize of output 3667 [2022-12-13 09:33:55,168 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 09:33:55,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12849 treesize of output 11773 [2022-12-13 09:33:55,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:33:55,446 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 11429 treesize of output 9323 [2022-12-13 09:33:55,614 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:33:55,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 9250 treesize of output 9263 [2022-12-13 09:33:55,686 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 9234 treesize of output 9230 [2022-12-13 09:33:55,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:33:55,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 9230 treesize of output 9264 [2022-12-13 09:33:55,954 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 9211 treesize of output 9207 [2022-12-13 09:33:56,092 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:33:56,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 9207 treesize of output 9220 [2022-12-13 09:33:56,172 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 9191 treesize of output 9187 [2022-12-13 09:33:56,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:33:56,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 9187 treesize of output 9237 [2022-12-13 09:33:56,460 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 9164 treesize of output 9160 [2022-12-13 09:33:57,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:33:57,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 9160 treesize of output 9210 [2022-12-13 09:33:58,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:33:58,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 9137 treesize of output 9150 [2022-12-13 09:33:59,510 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 9121 treesize of output 9117 [2022-12-13 09:34:00,681 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 9117 treesize of output 9113 [2022-12-13 09:34:01,445 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:01,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 9113 treesize of output 9126 [2022-12-13 09:34:02,185 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 9097 treesize of output 9093 [2022-12-13 09:34:02,966 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:02,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 9093 treesize of output 9106 [2022-12-13 09:34:03,464 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 9077 treesize of output 9073 [2022-12-13 09:34:04,726 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:04,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 9073 treesize of output 9086 [2022-12-13 09:34:05,622 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 9057 treesize of output 9053 [2022-12-13 09:34:06,324 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:06,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 9053 treesize of output 9103 [2022-12-13 09:34:07,453 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 9030 treesize of output 9026 [2022-12-13 09:34:08,888 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:08,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 9026 treesize of output 9076 [2022-12-13 09:34:09,983 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 9003 treesize of output 8999 [2022-12-13 09:34:10,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:10,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 8999 treesize of output 9012 [2022-12-13 09:34:12,146 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 8983 treesize of output 8979 [2022-12-13 09:34:13,161 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:13,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 8979 treesize of output 8992 [2022-12-13 09:34:13,777 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 8963 treesize of output 8959 [2022-12-13 09:34:15,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:15,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 8959 treesize of output 9009 [2022-12-13 09:34:16,616 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 8936 treesize of output 8932 [2022-12-13 09:34:18,065 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:18,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 8932 treesize of output 8945 [2022-12-13 09:34:19,437 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 8916 treesize of output 8912 [2022-12-13 09:34:20,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:20,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 8912 treesize of output 8925 [2022-12-13 09:34:22,274 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 8896 treesize of output 8892 [2022-12-13 09:34:23,767 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:23,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 8892 treesize of output 8926 [2022-12-13 09:34:25,187 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 8873 treesize of output 8869 [2022-12-13 09:34:27,366 INFO L321 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2022-12-13 09:34:27,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 71 [2022-12-13 09:34:27,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:27,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 76 [2022-12-13 09:34:27,600 INFO L321 Elim1Store]: treesize reduction 20, result has 72.6 percent of original size [2022-12-13 09:34:27,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 75 treesize of output 104 [2022-12-13 09:34:27,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:27,721 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:27,752 INFO L321 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2022-12-13 09:34:27,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 75 [2022-12-13 09:34:27,832 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:27,832 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:27,833 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 59 treesize of output 44 [2022-12-13 09:34:27,867 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 56 treesize of output 44 [2022-12-13 09:34:27,890 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:27,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:27,904 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:27,905 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 67 treesize of output 58 [2022-12-13 09:34:27,947 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 56 treesize of output 44 [2022-12-13 09:34:28,010 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 56 treesize of output 44 [2022-12-13 09:34:28,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:28,056 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:28,057 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 59 treesize of output 44 [2022-12-13 09:34:28,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:28,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:28,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:28,087 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 67 treesize of output 58 [2022-12-13 09:34:28,122 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 56 treesize of output 44 [2022-12-13 09:34:28,171 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 56 treesize of output 44 [2022-12-13 09:34:28,204 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:28,204 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:28,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:28,206 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 67 treesize of output 48 [2022-12-13 09:34:28,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:28,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:28,245 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 59 treesize of output 44 [2022-12-13 09:34:28,271 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:28,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:28,283 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-12-13 09:34:28,283 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 67 treesize of output 53 [2022-12-13 09:34:28,313 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 56 treesize of output 44 [2022-12-13 09:34:28,553 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:28,562 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:28,620 INFO L321 Elim1Store]: treesize reduction 5, result has 90.9 percent of original size [2022-12-13 09:34:28,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 101 [2022-12-13 09:34:28,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:28,764 INFO L321 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2022-12-13 09:34:28,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 63 [2022-12-13 09:34:28,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:28,881 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:28,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 68 [2022-12-13 09:34:29,122 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 09:34:29,151 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 09:34:29,177 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 09:34:29,196 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 09:34:29,224 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 09:34:29,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:29,322 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:29,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 68 [2022-12-13 09:34:29,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:29,429 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:29,494 INFO L321 Elim1Store]: treesize reduction 5, result has 90.9 percent of original size [2022-12-13 09:34:29,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 101 [2022-12-13 09:34:29,650 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:29,679 INFO L321 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2022-12-13 09:34:29,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 63 [2022-12-13 09:34:29,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:29,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:29,868 INFO L321 Elim1Store]: treesize reduction 5, result has 90.9 percent of original size [2022-12-13 09:34:29,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 101 [2022-12-13 09:34:30,016 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:30,043 INFO L321 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2022-12-13 09:34:30,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 63 [2022-12-13 09:34:30,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:30,177 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:30,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 68 [2022-12-13 09:34:30,289 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 56 treesize of output 44 [2022-12-13 09:34:30,345 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:30,386 INFO L321 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2022-12-13 09:34:30,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 63 [2022-12-13 09:34:30,484 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 56 treesize of output 44 [2022-12-13 09:34:30,584 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 56 treesize of output 44 [2022-12-13 09:34:30,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:30,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:30,671 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:30,671 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 67 treesize of output 58 [2022-12-13 09:34:30,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:30,806 INFO L321 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2022-12-13 09:34:30,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 63 [2022-12-13 09:34:30,910 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 56 treesize of output 44 [2022-12-13 09:34:30,960 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 56 treesize of output 44 [2022-12-13 09:34:31,054 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 56 treesize of output 44 [2022-12-13 09:34:31,105 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 56 treesize of output 44 [2022-12-13 09:34:31,172 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:31,219 INFO L321 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2022-12-13 09:34:31,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 63 [2022-12-13 09:34:31,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:31,389 INFO L321 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2022-12-13 09:34:31,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 63 [2022-12-13 09:34:31,487 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 56 treesize of output 44 [2022-12-13 09:34:31,575 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 56 treesize of output 44 [2022-12-13 09:34:32,195 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 56 treesize of output 44 [2022-12-13 09:34:32,275 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 56 treesize of output 44 [2022-12-13 09:34:32,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:32,392 INFO L321 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2022-12-13 09:34:32,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 63 [2022-12-13 09:34:32,561 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 56 treesize of output 44 [2022-12-13 09:34:32,651 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 56 treesize of output 44 [2022-12-13 09:34:32,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:32,748 INFO L321 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2022-12-13 09:34:32,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 63 [2022-12-13 09:34:32,859 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 56 treesize of output 44 [2022-12-13 09:34:32,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:32,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:32,958 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:32,958 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 67 treesize of output 58 [2022-12-13 09:34:33,121 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 56 treesize of output 44 [2022-12-13 09:34:33,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:33,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:33,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:33,222 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 67 treesize of output 58