./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_03-funloop_simple.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_03-funloop_simple.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8 --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8259c4061eb15e4ed63bc06f98acbb6dc3f9862bbe262b5cabdd3ad4658d3239 --- 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 18:52:06,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:52:06,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:52:06,765 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:52:06,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:52:06,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:52:06,767 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:52:06,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:52:06,770 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:52:06,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:52:06,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:52:06,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:52:06,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:52:06,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:52:06,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:52:06,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:52:06,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:52:06,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:52:06,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:52:06,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:52:06,782 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:52:06,784 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:52:06,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:52:06,785 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:52:06,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:52:06,789 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:52:06,789 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:52:06,790 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:52:06,790 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:52:06,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:52:06,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:52:06,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:52:06,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:52:06,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:52:06,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:52:06,794 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:52:06,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:52:06,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:52:06,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:52:06,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:52:06,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:52:06,797 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-12-13 18:52:06,816 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:52:06,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:52:06,817 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:52:06,817 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:52:06,818 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:52:06,821 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:52:06,822 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:52:06,822 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:52:06,822 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:52:06,822 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:52:06,822 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 18:52:06,823 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 18:52:06,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:52:06,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 18:52:06,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:52:06,823 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 18:52:06,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:52:06,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 18:52:06,824 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-12-13 18:52:06,824 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 18:52:06,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 18:52:06,825 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:52:06,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 18:52:06,825 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:52:06,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:52:06,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:52:06,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:52:06,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:52:06,826 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:52:06,826 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 18:52:06,826 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 18:52:06,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 18:52:06,827 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:52:06,827 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 18:52:06,827 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:52:06,827 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:52:06,828 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:52:06,828 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/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_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8 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 -> Automizer 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 -> 8259c4061eb15e4ed63bc06f98acbb6dc3f9862bbe262b5cabdd3ad4658d3239 [2022-12-13 18:52:07,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:52:07,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:52:07,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:52:07,038 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:52:07,038 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:52:07,039 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/goblint-regression/06-symbeq_03-funloop_simple.i [2022-12-13 18:52:09,561 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:52:09,746 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:52:09,746 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/sv-benchmarks/c/goblint-regression/06-symbeq_03-funloop_simple.i [2022-12-13 18:52:09,756 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/data/1518ab23e/4c4498b1de6d4daab71e18e6206d8804/FLAG808f9b902 [2022-12-13 18:52:10,113 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/data/1518ab23e/4c4498b1de6d4daab71e18e6206d8804 [2022-12-13 18:52:10,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:52:10,116 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:52:10,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:52:10,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:52:10,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:52:10,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:52:10" (1/1) ... [2022-12-13 18:52:10,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47035d86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:52:10, skipping insertion in model container [2022-12-13 18:52:10,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:52:10" (1/1) ... [2022-12-13 18:52:10,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:52:10,157 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:52:10,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:52:10,512 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:52:10,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:52:10,568 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:52:10,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:52:10 WrapperNode [2022-12-13 18:52:10,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:52:10,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:52:10,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:52:10,569 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:52:10,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:52:10" (1/1) ... [2022-12-13 18:52:10,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:52:10" (1/1) ... [2022-12-13 18:52:10,602 INFO L138 Inliner]: procedures = 262, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 112 [2022-12-13 18:52:10,602 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:52:10,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:52:10,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:52:10,603 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:52:10,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:52:10" (1/1) ... [2022-12-13 18:52:10,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:52:10" (1/1) ... [2022-12-13 18:52:10,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:52:10" (1/1) ... [2022-12-13 18:52:10,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:52:10" (1/1) ... [2022-12-13 18:52:10,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:52:10" (1/1) ... [2022-12-13 18:52:10,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:52:10" (1/1) ... [2022-12-13 18:52:10,621 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:52:10" (1/1) ... [2022-12-13 18:52:10,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:52:10" (1/1) ... [2022-12-13 18:52:10,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:52:10,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:52:10,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:52:10,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:52:10,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:52:10" (1/1) ... [2022-12-13 18:52:10,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:52:10,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:52:10,647 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:52:10,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:52:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 18:52:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 18:52:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 18:52:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 18:52:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 18:52:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:52:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-13 18:52:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-13 18:52:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:52:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:52:10,678 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 18:52:10,783 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:52:10,785 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:52:10,972 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:52:10,979 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:52:10,979 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 18:52:10,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:52:10 BoogieIcfgContainer [2022-12-13 18:52:10,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:52:10,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:52:10,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:52:10,987 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:52:10,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:52:10" (1/3) ... [2022-12-13 18:52:10,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53fb1efa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:52:10, skipping insertion in model container [2022-12-13 18:52:10,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:52:10" (2/3) ... [2022-12-13 18:52:10,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53fb1efa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:52:10, skipping insertion in model container [2022-12-13 18:52:10,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:52:10" (3/3) ... [2022-12-13 18:52:10,990 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_03-funloop_simple.i [2022-12-13 18:52:10,998 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 18:52:11,005 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:52:11,006 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-13 18:52:11,006 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 18:52:11,070 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 18:52:11,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 125 transitions, 255 flow [2022-12-13 18:52:11,141 INFO L130 PetriNetUnfolder]: 6/124 cut-off events. [2022-12-13 18:52:11,142 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:52:11,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 124 events. 6/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 216 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-12-13 18:52:11,147 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 125 transitions, 255 flow [2022-12-13 18:52:11,150 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 124 transitions, 251 flow [2022-12-13 18:52:11,153 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 18:52:11,161 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 124 transitions, 251 flow [2022-12-13 18:52:11,164 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 124 transitions, 251 flow [2022-12-13 18:52:11,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 124 transitions, 251 flow [2022-12-13 18:52:11,187 INFO L130 PetriNetUnfolder]: 6/124 cut-off events. [2022-12-13 18:52:11,187 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:52:11,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 124 events. 6/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 216 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-12-13 18:52:11,190 INFO L119 LiptonReduction]: Number of co-enabled transitions 4636 [2022-12-13 18:52:12,323 INFO L134 LiptonReduction]: Checked pairs total: 13748 [2022-12-13 18:52:12,323 INFO L136 LiptonReduction]: Total number of compositions: 74 [2022-12-13 18:52:12,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:52:12,343 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=PETRI_NET, 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;@6ca39ec3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:52:12,343 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-12-13 18:52:12,348 INFO L130 PetriNetUnfolder]: 1/22 cut-off events. [2022-12-13 18:52:12,349 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:52:12,349 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:52:12,349 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:52:12,350 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-13 18:52:12,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:52:12,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1497592009, now seen corresponding path program 1 times [2022-12-13 18:52:12,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:52:12,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491291620] [2022-12-13 18:52:12,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:52:12,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:52:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:52:12,545 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 18:52:12,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:52:12,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491291620] [2022-12-13 18:52:12,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491291620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:52:12,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:52:12,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:52:12,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502039522] [2022-12-13 18:52:12,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:52:12,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:52:12,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:52:12,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:52:12,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:52:12,585 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 199 [2022-12-13 18:52:12,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 18:52:12,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:52:12,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 199 [2022-12-13 18:52:12,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:52:12,682 INFO L130 PetriNetUnfolder]: 90/369 cut-off events. [2022-12-13 18:52:12,682 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:52:12,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 369 events. 90/369 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2009 event pairs, 70 based on Foata normal form. 0/337 useless extension candidates. Maximal degree in co-relation 540. Up to 181 conditions per place. [2022-12-13 18:52:12,685 INFO L137 encePairwiseOnDemand]: 196/199 looper letters, 22 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2022-12-13 18:52:12,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 159 flow [2022-12-13 18:52:12,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:52:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:52:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2022-12-13 18:52:12,697 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6298157453936348 [2022-12-13 18:52:12,697 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2022-12-13 18:52:12,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2022-12-13 18:52:12,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:52:12,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2022-12-13 18:52:12,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 18:52:12,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 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 18:52:12,710 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 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 18:52:12,711 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 109 flow. Second operand 3 states and 376 transitions. [2022-12-13 18:52:12,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 159 flow [2022-12-13 18:52:12,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 18:52:12,715 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 120 flow [2022-12-13 18:52:12,717 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2022-12-13 18:52:12,720 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2022-12-13 18:52:12,720 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 120 flow [2022-12-13 18:52:12,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 18:52:12,720 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:52:12,721 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:52:12,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 18:52:12,721 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-13 18:52:12,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:52:12,722 INFO L85 PathProgramCache]: Analyzing trace with hash 568124769, now seen corresponding path program 1 times [2022-12-13 18:52:12,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:52:12,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119765105] [2022-12-13 18:52:12,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:52:12,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:52:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:52:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:52:12,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:52:12,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119765105] [2022-12-13 18:52:12,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119765105] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:52:12,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106794769] [2022-12-13 18:52:12,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:52:12,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:52:12,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:52:12,812 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:52:12,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 18:52:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:52:12,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:52:12,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:52:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 18:52:12,883 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:52:12,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106794769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:52:12,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:52:12,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-13 18:52:12,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011253352] [2022-12-13 18:52:12,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:52:12,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:52:12,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:52:12,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:52:12,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:52:12,896 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 199 [2022-12-13 18:52:12,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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 18:52:12,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:52:12,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 199 [2022-12-13 18:52:12,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:52:13,007 INFO L130 PetriNetUnfolder]: 138/537 cut-off events. [2022-12-13 18:52:13,007 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:52:13,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 537 events. 138/537 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2828 event pairs, 70 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 814. Up to 182 conditions per place. [2022-12-13 18:52:13,009 INFO L137 encePairwiseOnDemand]: 196/199 looper letters, 36 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2022-12-13 18:52:13,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 224 flow [2022-12-13 18:52:13,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:52:13,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:52:13,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2022-12-13 18:52:13,011 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6465661641541038 [2022-12-13 18:52:13,012 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2022-12-13 18:52:13,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2022-12-13 18:52:13,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:52:13,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2022-12-13 18:52:13,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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 18:52:13,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 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 18:52:13,014 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 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 18:52:13,014 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 120 flow. Second operand 3 states and 386 transitions. [2022-12-13 18:52:13,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 224 flow [2022-12-13 18:52:13,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 220 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 18:52:13,016 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 128 flow [2022-12-13 18:52:13,017 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2022-12-13 18:52:13,017 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2022-12-13 18:52:13,017 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 128 flow [2022-12-13 18:52:13,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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 18:52:13,018 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:52:13,018 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:52:13,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 18:52:13,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-12-13 18:52:13,219 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-13 18:52:13,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:52:13,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1857494551, now seen corresponding path program 1 times [2022-12-13 18:52:13,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:52:13,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100228473] [2022-12-13 18:52:13,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:52:13,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:52:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:52:13,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:52:13,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:52:13,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100228473] [2022-12-13 18:52:13,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100228473] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:52:13,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209250034] [2022-12-13 18:52:13,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:52:13,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:52:13,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:52:13,284 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:52:13,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 18:52:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:52:13,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 18:52:13,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:52:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:52:13,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:52:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:52:13,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209250034] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:52:13,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:52:13,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 18:52:13,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232459605] [2022-12-13 18:52:13,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:52:13,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:52:13,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:52:13,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:52:13,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:52:13,397 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 199 [2022-12-13 18:52:13,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 128 flow. Second operand has 7 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 0 states have call successors, (0), 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 18:52:13,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:52:13,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 199 [2022-12-13 18:52:13,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:52:13,527 INFO L130 PetriNetUnfolder]: 138/548 cut-off events. [2022-12-13 18:52:13,527 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-13 18:52:13,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 548 events. 138/548 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2913 event pairs, 112 based on Foata normal form. 0/513 useless extension candidates. Maximal degree in co-relation 856. Up to 277 conditions per place. [2022-12-13 18:52:13,531 INFO L137 encePairwiseOnDemand]: 196/199 looper letters, 23 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2022-12-13 18:52:13,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 58 transitions, 196 flow [2022-12-13 18:52:13,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:52:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:52:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 726 transitions. [2022-12-13 18:52:13,535 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6080402010050251 [2022-12-13 18:52:13,535 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 726 transitions. [2022-12-13 18:52:13,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 726 transitions. [2022-12-13 18:52:13,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:52:13,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 726 transitions. [2022-12-13 18:52:13,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 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 18:52:13,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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 18:52:13,542 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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 18:52:13,542 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 128 flow. Second operand 6 states and 726 transitions. [2022-12-13 18:52:13,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 58 transitions, 196 flow [2022-12-13 18:52:13,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 58 transitions, 194 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 18:52:13,544 INFO L231 Difference]: Finished difference. Result has 65 places, 58 transitions, 162 flow [2022-12-13 18:52:13,544 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2022-12-13 18:52:13,544 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2022-12-13 18:52:13,544 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 162 flow [2022-12-13 18:52:13,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 0 states have call successors, (0), 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 18:52:13,545 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:52:13,545 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:52:13,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 18:52:13,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:52:13,746 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-13 18:52:13,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:52:13,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1535458175, now seen corresponding path program 2 times [2022-12-13 18:52:13,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:52:13,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913930258] [2022-12-13 18:52:13,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:52:13,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:52:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:52:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:52:13,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:52:13,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913930258] [2022-12-13 18:52:13,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913930258] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:52:13,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106099303] [2022-12-13 18:52:13,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 18:52:13,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:52:13,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:52:13,832 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:52:13,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 18:52:13,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 18:52:13,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:52:13,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 18:52:13,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:52:13,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 18:52:13,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:13,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 18:52:13,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:14,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:14,002 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:52:14,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-12-13 18:52:14,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:14,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:14,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:14,042 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 18:52:14,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-12-13 18:52:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 18:52:14,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:52:14,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106099303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:52:14,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:52:14,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2022-12-13 18:52:14,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124710381] [2022-12-13 18:52:14,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:52:14,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 18:52:14,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:52:14,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 18:52:14,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-13 18:52:14,404 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 199 [2022-12-13 18:52:14,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 162 flow. Second operand has 9 states, 9 states have (on average 96.33333333333333) internal successors, (867), 9 states have internal predecessors, (867), 0 states have call successors, (0), 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 18:52:14,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:52:14,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 199 [2022-12-13 18:52:14,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:52:14,899 INFO L130 PetriNetUnfolder]: 1007/2228 cut-off events. [2022-12-13 18:52:14,899 INFO L131 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2022-12-13 18:52:14,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4427 conditions, 2228 events. 1007/2228 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 13117 event pairs, 377 based on Foata normal form. 0/2102 useless extension candidates. Maximal degree in co-relation 4393. Up to 892 conditions per place. [2022-12-13 18:52:14,906 INFO L137 encePairwiseOnDemand]: 183/199 looper letters, 165 selfloop transitions, 27 changer transitions 0/207 dead transitions. [2022-12-13 18:52:14,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 207 transitions, 900 flow [2022-12-13 18:52:14,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 18:52:14,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 18:52:14,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1132 transitions. [2022-12-13 18:52:14,909 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5688442211055277 [2022-12-13 18:52:14,909 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1132 transitions. [2022-12-13 18:52:14,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1132 transitions. [2022-12-13 18:52:14,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:52:14,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1132 transitions. [2022-12-13 18:52:14,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 113.2) internal successors, (1132), 10 states have internal predecessors, (1132), 0 states have call successors, (0), 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 18:52:14,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 199.0) internal successors, (2189), 11 states have internal predecessors, (2189), 0 states have call successors, (0), 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 18:52:14,914 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 199.0) internal successors, (2189), 11 states have internal predecessors, (2189), 0 states have call successors, (0), 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 18:52:14,914 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 162 flow. Second operand 10 states and 1132 transitions. [2022-12-13 18:52:14,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 207 transitions, 900 flow [2022-12-13 18:52:14,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 207 transitions, 886 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-13 18:52:14,916 INFO L231 Difference]: Finished difference. Result has 79 places, 83 transitions, 352 flow [2022-12-13 18:52:14,916 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=352, PETRI_PLACES=79, PETRI_TRANSITIONS=83} [2022-12-13 18:52:14,917 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 25 predicate places. [2022-12-13 18:52:14,917 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 83 transitions, 352 flow [2022-12-13 18:52:14,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 96.33333333333333) internal successors, (867), 9 states have internal predecessors, (867), 0 states have call successors, (0), 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 18:52:14,918 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:52:14,918 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:52:14,923 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 18:52:15,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:52:15,119 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-13 18:52:15,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:52:15,120 INFO L85 PathProgramCache]: Analyzing trace with hash -860116313, now seen corresponding path program 1 times [2022-12-13 18:52:15,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:52:15,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967322562] [2022-12-13 18:52:15,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:52:15,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:52:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:52:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:52:15,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:52:15,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967322562] [2022-12-13 18:52:15,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967322562] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:52:15,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672305193] [2022-12-13 18:52:15,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:52:15,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:52:15,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:52:15,299 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:52:15,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 18:52:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:52:15,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 18:52:15,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:52:15,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:52:15,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:52:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:52:15,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672305193] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:52:15,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:52:15,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-13 18:52:15,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142045962] [2022-12-13 18:52:15,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:52:15,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 18:52:15,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:52:15,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 18:52:15,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-12-13 18:52:15,429 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 199 [2022-12-13 18:52:15,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 83 transitions, 352 flow. Second operand has 13 states, 13 states have (on average 117.38461538461539) internal successors, (1526), 13 states have internal predecessors, (1526), 0 states have call successors, (0), 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 18:52:15,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:52:15,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 199 [2022-12-13 18:52:15,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:52:15,640 INFO L130 PetriNetUnfolder]: 452/1563 cut-off events. [2022-12-13 18:52:15,640 INFO L131 PetriNetUnfolder]: For 967/993 co-relation queries the response was YES. [2022-12-13 18:52:15,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3682 conditions, 1563 events. 452/1563 cut-off events. For 967/993 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 10438 event pairs, 311 based on Foata normal form. 11/1510 useless extension candidates. Maximal degree in co-relation 3623. Up to 753 conditions per place. [2022-12-13 18:52:15,647 INFO L137 encePairwiseOnDemand]: 196/199 looper letters, 31 selfloop transitions, 11 changer transitions 0/89 dead transitions. [2022-12-13 18:52:15,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 89 transitions, 472 flow [2022-12-13 18:52:15,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 18:52:15,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 18:52:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1431 transitions. [2022-12-13 18:52:15,650 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5992462311557789 [2022-12-13 18:52:15,650 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1431 transitions. [2022-12-13 18:52:15,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1431 transitions. [2022-12-13 18:52:15,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:52:15,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1431 transitions. [2022-12-13 18:52:15,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 119.25) internal successors, (1431), 12 states have internal predecessors, (1431), 0 states have call successors, (0), 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 18:52:15,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 199.0) internal successors, (2587), 13 states have internal predecessors, (2587), 0 states have call successors, (0), 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 18:52:15,655 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 199.0) internal successors, (2587), 13 states have internal predecessors, (2587), 0 states have call successors, (0), 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 18:52:15,655 INFO L175 Difference]: Start difference. First operand has 79 places, 83 transitions, 352 flow. Second operand 12 states and 1431 transitions. [2022-12-13 18:52:15,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 89 transitions, 472 flow [2022-12-13 18:52:15,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 89 transitions, 471 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 18:52:15,659 INFO L231 Difference]: Finished difference. Result has 95 places, 89 transitions, 435 flow [2022-12-13 18:52:15,660 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=435, PETRI_PLACES=95, PETRI_TRANSITIONS=89} [2022-12-13 18:52:15,660 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 41 predicate places. [2022-12-13 18:52:15,660 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 89 transitions, 435 flow [2022-12-13 18:52:15,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 117.38461538461539) internal successors, (1526), 13 states have internal predecessors, (1526), 0 states have call successors, (0), 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 18:52:15,661 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:52:15,661 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:52:15,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 18:52:15,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:52:15,861 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-13 18:52:15,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:52:15,862 INFO L85 PathProgramCache]: Analyzing trace with hash 822223591, now seen corresponding path program 2 times [2022-12-13 18:52:15,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:52:15,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255225283] [2022-12-13 18:52:15,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:52:15,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:52:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:52:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:52:16,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:52:16,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255225283] [2022-12-13 18:52:16,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255225283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:52:16,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:52:16,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:52:16,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395063434] [2022-12-13 18:52:16,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:52:16,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:52:16,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:52:16,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:52:16,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:52:16,301 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 199 [2022-12-13 18:52:16,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 89 transitions, 435 flow. Second operand has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 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 18:52:16,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:52:16,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 199 [2022-12-13 18:52:16,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:52:16,754 INFO L130 PetriNetUnfolder]: 1299/3027 cut-off events. [2022-12-13 18:52:16,754 INFO L131 PetriNetUnfolder]: For 2801/2864 co-relation queries the response was YES. [2022-12-13 18:52:16,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8080 conditions, 3027 events. 1299/3027 cut-off events. For 2801/2864 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 19269 event pairs, 601 based on Foata normal form. 15/2982 useless extension candidates. Maximal degree in co-relation 7997. Up to 1996 conditions per place. [2022-12-13 18:52:16,767 INFO L137 encePairwiseOnDemand]: 188/199 looper letters, 115 selfloop transitions, 30 changer transitions 0/163 dead transitions. [2022-12-13 18:52:16,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 163 transitions, 1001 flow [2022-12-13 18:52:16,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:52:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:52:16,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 694 transitions. [2022-12-13 18:52:16,770 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5812395309882747 [2022-12-13 18:52:16,770 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 694 transitions. [2022-12-13 18:52:16,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 694 transitions. [2022-12-13 18:52:16,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:52:16,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 694 transitions. [2022-12-13 18:52:16,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 0 states have call successors, (0), 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 18:52:16,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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 18:52:16,775 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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 18:52:16,775 INFO L175 Difference]: Start difference. First operand has 95 places, 89 transitions, 435 flow. Second operand 6 states and 694 transitions. [2022-12-13 18:52:16,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 163 transitions, 1001 flow [2022-12-13 18:52:16,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 163 transitions, 953 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-12-13 18:52:16,783 INFO L231 Difference]: Finished difference. Result has 100 places, 114 transitions, 611 flow [2022-12-13 18:52:16,783 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=611, PETRI_PLACES=100, PETRI_TRANSITIONS=114} [2022-12-13 18:52:16,783 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 46 predicate places. [2022-12-13 18:52:16,784 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 114 transitions, 611 flow [2022-12-13 18:52:16,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 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 18:52:16,784 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:52:16,784 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:52:16,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 18:52:16,784 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-13 18:52:16,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:52:16,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1276306041, now seen corresponding path program 1 times [2022-12-13 18:52:16,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:52:16,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549373367] [2022-12-13 18:52:16,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:52:16,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:52:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:52:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:52:17,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:52:17,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549373367] [2022-12-13 18:52:17,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549373367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:52:17,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:52:17,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:52:17,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769141374] [2022-12-13 18:52:17,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:52:17,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:52:17,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:52:17,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:52:17,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:52:17,166 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 199 [2022-12-13 18:52:17,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 114 transitions, 611 flow. Second operand has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 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 18:52:17,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:52:17,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 199 [2022-12-13 18:52:17,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:52:17,864 INFO L130 PetriNetUnfolder]: 2150/4575 cut-off events. [2022-12-13 18:52:17,864 INFO L131 PetriNetUnfolder]: For 6138/6165 co-relation queries the response was YES. [2022-12-13 18:52:17,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14407 conditions, 4575 events. 2150/4575 cut-off events. For 6138/6165 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 28807 event pairs, 850 based on Foata normal form. 0/4475 useless extension candidates. Maximal degree in co-relation 14344. Up to 3537 conditions per place. [2022-12-13 18:52:17,881 INFO L137 encePairwiseOnDemand]: 176/199 looper letters, 136 selfloop transitions, 90 changer transitions 0/234 dead transitions. [2022-12-13 18:52:17,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 234 transitions, 1594 flow [2022-12-13 18:52:17,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:52:17,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:52:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 692 transitions. [2022-12-13 18:52:17,883 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5795644891122278 [2022-12-13 18:52:17,883 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 692 transitions. [2022-12-13 18:52:17,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 692 transitions. [2022-12-13 18:52:17,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:52:17,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 692 transitions. [2022-12-13 18:52:17,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 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 18:52:17,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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 18:52:17,886 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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 18:52:17,886 INFO L175 Difference]: Start difference. First operand has 100 places, 114 transitions, 611 flow. Second operand 6 states and 692 transitions. [2022-12-13 18:52:17,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 234 transitions, 1594 flow [2022-12-13 18:52:17,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 234 transitions, 1594 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 18:52:17,895 INFO L231 Difference]: Finished difference. Result has 110 places, 194 transitions, 1450 flow [2022-12-13 18:52:17,895 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1450, PETRI_PLACES=110, PETRI_TRANSITIONS=194} [2022-12-13 18:52:17,895 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 56 predicate places. [2022-12-13 18:52:17,895 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 194 transitions, 1450 flow [2022-12-13 18:52:17,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 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 18:52:17,896 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:52:17,896 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:52:17,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 18:52:17,896 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-13 18:52:17,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:52:17,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1618817831, now seen corresponding path program 1 times [2022-12-13 18:52:17,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:52:17,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749802779] [2022-12-13 18:52:17,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:52:17,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:52:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:52:18,130 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:52:18,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:52:18,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749802779] [2022-12-13 18:52:18,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749802779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:52:18,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:52:18,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:52:18,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170134267] [2022-12-13 18:52:18,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:52:18,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:52:18,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:52:18,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:52:18,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:52:18,213 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 199 [2022-12-13 18:52:18,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 194 transitions, 1450 flow. Second operand has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 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 18:52:18,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:52:18,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 199 [2022-12-13 18:52:18,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:52:19,015 INFO L130 PetriNetUnfolder]: 2563/5384 cut-off events. [2022-12-13 18:52:19,015 INFO L131 PetriNetUnfolder]: For 11449/11545 co-relation queries the response was YES. [2022-12-13 18:52:19,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21029 conditions, 5384 events. 2563/5384 cut-off events. For 11449/11545 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 34379 event pairs, 846 based on Foata normal form. 0/5293 useless extension candidates. Maximal degree in co-relation 20961. Up to 4361 conditions per place. [2022-12-13 18:52:19,041 INFO L137 encePairwiseOnDemand]: 184/199 looper letters, 231 selfloop transitions, 72 changer transitions 0/309 dead transitions. [2022-12-13 18:52:19,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 309 transitions, 2748 flow [2022-12-13 18:52:19,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:52:19,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:52:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 657 transitions. [2022-12-13 18:52:19,043 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.550251256281407 [2022-12-13 18:52:19,043 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 657 transitions. [2022-12-13 18:52:19,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 657 transitions. [2022-12-13 18:52:19,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:52:19,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 657 transitions. [2022-12-13 18:52:19,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 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 18:52:19,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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 18:52:19,046 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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 18:52:19,046 INFO L175 Difference]: Start difference. First operand has 110 places, 194 transitions, 1450 flow. Second operand 6 states and 657 transitions. [2022-12-13 18:52:19,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 309 transitions, 2748 flow [2022-12-13 18:52:19,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 309 transitions, 2546 flow, removed 101 selfloop flow, removed 0 redundant places. [2022-12-13 18:52:19,070 INFO L231 Difference]: Finished difference. Result has 120 places, 252 transitions, 1990 flow [2022-12-13 18:52:19,070 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1990, PETRI_PLACES=120, PETRI_TRANSITIONS=252} [2022-12-13 18:52:19,071 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 66 predicate places. [2022-12-13 18:52:19,071 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 252 transitions, 1990 flow [2022-12-13 18:52:19,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 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 18:52:19,071 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:52:19,071 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:52:19,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 18:52:19,071 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-13 18:52:19,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:52:19,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1246736439, now seen corresponding path program 1 times [2022-12-13 18:52:19,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:52:19,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377995020] [2022-12-13 18:52:19,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:52:19,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:52:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:52:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 18:52:19,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:52:19,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377995020] [2022-12-13 18:52:19,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377995020] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:52:19,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523726455] [2022-12-13 18:52:19,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:52:19,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:52:19,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:52:19,469 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:52:19,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 18:52:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:52:19,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 18:52:19,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:52:19,594 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 18:52:19,614 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:52:19,614 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:52:19,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523726455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:52:19,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:52:19,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-12-13 18:52:19,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473449182] [2022-12-13 18:52:19,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:52:19,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:52:19,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:52:19,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:52:19,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:52:19,728 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 199 [2022-12-13 18:52:19,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 252 transitions, 1990 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 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 18:52:19,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:52:19,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 199 [2022-12-13 18:52:19,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:52:20,399 INFO L130 PetriNetUnfolder]: 1906/4632 cut-off events. [2022-12-13 18:52:20,399 INFO L131 PetriNetUnfolder]: For 14447/14661 co-relation queries the response was YES. [2022-12-13 18:52:20,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19049 conditions, 4632 events. 1906/4632 cut-off events. For 14447/14661 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 33120 event pairs, 250 based on Foata normal form. 13/4573 useless extension candidates. Maximal degree in co-relation 18976. Up to 1222 conditions per place. [2022-12-13 18:52:20,420 INFO L137 encePairwiseOnDemand]: 192/199 looper letters, 117 selfloop transitions, 12 changer transitions 0/320 dead transitions. [2022-12-13 18:52:20,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 320 transitions, 2787 flow [2022-12-13 18:52:20,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:52:20,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:52:20,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 707 transitions. [2022-12-13 18:52:20,421 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5921273031825796 [2022-12-13 18:52:20,421 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 707 transitions. [2022-12-13 18:52:20,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 707 transitions. [2022-12-13 18:52:20,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:52:20,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 707 transitions. [2022-12-13 18:52:20,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 0 states have call successors, (0), 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 18:52:20,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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 18:52:20,424 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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 18:52:20,424 INFO L175 Difference]: Start difference. First operand has 120 places, 252 transitions, 1990 flow. Second operand 6 states and 707 transitions. [2022-12-13 18:52:20,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 320 transitions, 2787 flow [2022-12-13 18:52:20,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 320 transitions, 2687 flow, removed 50 selfloop flow, removed 0 redundant places. [2022-12-13 18:52:20,459 INFO L231 Difference]: Finished difference. Result has 128 places, 260 transitions, 1995 flow [2022-12-13 18:52:20,459 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=1890, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1995, PETRI_PLACES=128, PETRI_TRANSITIONS=260} [2022-12-13 18:52:20,460 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 74 predicate places. [2022-12-13 18:52:20,460 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 260 transitions, 1995 flow [2022-12-13 18:52:20,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 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 18:52:20,460 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:52:20,460 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:52:20,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 18:52:20,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-13 18:52:20,661 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-13 18:52:20,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:52:20,662 INFO L85 PathProgramCache]: Analyzing trace with hash -2083434925, now seen corresponding path program 2 times [2022-12-13 18:52:20,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:52:20,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147010247] [2022-12-13 18:52:20,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:52:20,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:52:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:52:21,066 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 18:52:21,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:52:21,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147010247] [2022-12-13 18:52:21,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147010247] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:52:21,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852084454] [2022-12-13 18:52:21,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 18:52:21,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:52:21,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:52:21,067 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:52:21,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 18:52:21,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 18:52:21,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:52:21,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 18:52:21,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:52:21,173 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 18:52:21,209 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:52:21,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:52:21,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852084454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:52:21,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:52:21,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-12-13 18:52:21,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098762501] [2022-12-13 18:52:21,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:52:21,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:52:21,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:52:21,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:52:21,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:52:21,297 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 199 [2022-12-13 18:52:21,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 260 transitions, 1995 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 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 18:52:21,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:52:21,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 199 [2022-12-13 18:52:21,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:52:22,078 INFO L130 PetriNetUnfolder]: 2178/5351 cut-off events. [2022-12-13 18:52:22,078 INFO L131 PetriNetUnfolder]: For 16248/16494 co-relation queries the response was YES. [2022-12-13 18:52:22,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21677 conditions, 5351 events. 2178/5351 cut-off events. For 16248/16494 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 39876 event pairs, 251 based on Foata normal form. 14/5301 useless extension candidates. Maximal degree in co-relation 21599. Up to 1542 conditions per place. [2022-12-13 18:52:22,126 INFO L137 encePairwiseOnDemand]: 192/199 looper letters, 119 selfloop transitions, 19 changer transitions 0/329 dead transitions. [2022-12-13 18:52:22,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 329 transitions, 2877 flow [2022-12-13 18:52:22,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:52:22,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:52:22,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 704 transitions. [2022-12-13 18:52:22,128 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5896147403685092 [2022-12-13 18:52:22,128 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 704 transitions. [2022-12-13 18:52:22,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 704 transitions. [2022-12-13 18:52:22,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:52:22,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 704 transitions. [2022-12-13 18:52:22,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 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 18:52:22,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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 18:52:22,133 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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 18:52:22,133 INFO L175 Difference]: Start difference. First operand has 128 places, 260 transitions, 1995 flow. Second operand 6 states and 704 transitions. [2022-12-13 18:52:22,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 329 transitions, 2877 flow [2022-12-13 18:52:22,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 329 transitions, 2863 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:52:22,176 INFO L231 Difference]: Finished difference. Result has 134 places, 270 transitions, 2154 flow [2022-12-13 18:52:22,176 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=1987, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2154, PETRI_PLACES=134, PETRI_TRANSITIONS=270} [2022-12-13 18:52:22,177 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 80 predicate places. [2022-12-13 18:52:22,177 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 270 transitions, 2154 flow [2022-12-13 18:52:22,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 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 18:52:22,177 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:52:22,177 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:52:22,183 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 18:52:22,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:52:22,378 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-13 18:52:22,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:52:22,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1970231013, now seen corresponding path program 3 times [2022-12-13 18:52:22,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:52:22,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998453508] [2022-12-13 18:52:22,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:52:22,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:52:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:52:22,616 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 18:52:22,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:52:22,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998453508] [2022-12-13 18:52:22,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998453508] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:52:22,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754663063] [2022-12-13 18:52:22,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 18:52:22,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:52:22,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:52:22,618 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:52:22,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 18:52:22,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 18:52:22,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:52:22,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 18:52:22,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:52:22,715 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 18:52:22,770 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:52:22,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:52:22,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754663063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:52:22,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:52:22,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-12-13 18:52:22,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950981136] [2022-12-13 18:52:22,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:52:22,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:52:22,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:52:22,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:52:22,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:52:22,864 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 199 [2022-12-13 18:52:22,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 270 transitions, 2154 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 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 18:52:22,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:52:22,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 199 [2022-12-13 18:52:22,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:52:23,630 INFO L130 PetriNetUnfolder]: 2249/5524 cut-off events. [2022-12-13 18:52:23,630 INFO L131 PetriNetUnfolder]: For 18779/19043 co-relation queries the response was YES. [2022-12-13 18:52:23,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22854 conditions, 5524 events. 2249/5524 cut-off events. For 18779/19043 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 42782 event pairs, 285 based on Foata normal form. 12/5457 useless extension candidates. Maximal degree in co-relation 22773. Up to 1528 conditions per place. [2022-12-13 18:52:23,657 INFO L137 encePairwiseOnDemand]: 192/199 looper letters, 135 selfloop transitions, 18 changer transitions 0/344 dead transitions. [2022-12-13 18:52:23,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 344 transitions, 3049 flow [2022-12-13 18:52:23,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:52:23,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:52:23,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 710 transitions. [2022-12-13 18:52:23,659 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5946398659966499 [2022-12-13 18:52:23,660 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 710 transitions. [2022-12-13 18:52:23,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 710 transitions. [2022-12-13 18:52:23,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:52:23,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 710 transitions. [2022-12-13 18:52:23,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.33333333333333) internal successors, (710), 6 states have internal predecessors, (710), 0 states have call successors, (0), 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 18:52:23,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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 18:52:23,664 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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 18:52:23,664 INFO L175 Difference]: Start difference. First operand has 134 places, 270 transitions, 2154 flow. Second operand 6 states and 710 transitions. [2022-12-13 18:52:23,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 344 transitions, 3049 flow [2022-12-13 18:52:23,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 344 transitions, 3021 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 18:52:23,712 INFO L231 Difference]: Finished difference. Result has 138 places, 274 transitions, 2222 flow [2022-12-13 18:52:23,712 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=2093, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2222, PETRI_PLACES=138, PETRI_TRANSITIONS=274} [2022-12-13 18:52:23,713 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 84 predicate places. [2022-12-13 18:52:23,713 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 274 transitions, 2222 flow [2022-12-13 18:52:23,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 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 18:52:23,713 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:52:23,713 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:52:23,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 18:52:23,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:52:23,914 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-13 18:52:23,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:52:23,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1211838341, now seen corresponding path program 4 times [2022-12-13 18:52:23,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:52:23,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381889977] [2022-12-13 18:52:23,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:52:23,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:52:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:52:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 18:52:24,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:52:24,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381889977] [2022-12-13 18:52:24,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381889977] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:52:24,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139577514] [2022-12-13 18:52:24,368 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 18:52:24,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:52:24,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:52:24,369 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:52:24,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 18:52:24,510 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 18:52:24,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:52:24,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 18:52:24,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:52:24,563 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 18:52:24,608 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:52:24,609 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:52:24,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139577514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:52:24,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:52:24,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-12-13 18:52:24,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000063594] [2022-12-13 18:52:24,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:52:24,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:52:24,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:52:24,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:52:24,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:52:24,714 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 199 [2022-12-13 18:52:24,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 274 transitions, 2222 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 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 18:52:24,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:52:24,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 199 [2022-12-13 18:52:24,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:52:25,470 INFO L130 PetriNetUnfolder]: 1959/4893 cut-off events. [2022-12-13 18:52:25,470 INFO L131 PetriNetUnfolder]: For 16604/16819 co-relation queries the response was YES. [2022-12-13 18:52:25,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20176 conditions, 4893 events. 1959/4893 cut-off events. For 16604/16819 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 37498 event pairs, 305 based on Foata normal form. 18/4831 useless extension candidates. Maximal degree in co-relation 20093. Up to 1434 conditions per place. [2022-12-13 18:52:25,498 INFO L137 encePairwiseOnDemand]: 192/199 looper letters, 104 selfloop transitions, 16 changer transitions 0/311 dead transitions. [2022-12-13 18:52:25,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 311 transitions, 2739 flow [2022-12-13 18:52:25,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:52:25,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:52:25,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 704 transitions. [2022-12-13 18:52:25,499 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5896147403685092 [2022-12-13 18:52:25,500 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 704 transitions. [2022-12-13 18:52:25,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 704 transitions. [2022-12-13 18:52:25,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:52:25,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 704 transitions. [2022-12-13 18:52:25,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 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 18:52:25,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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 18:52:25,502 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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 18:52:25,502 INFO L175 Difference]: Start difference. First operand has 138 places, 274 transitions, 2222 flow. Second operand 6 states and 704 transitions. [2022-12-13 18:52:25,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 311 transitions, 2739 flow [2022-12-13 18:52:25,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 311 transitions, 2709 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 18:52:25,538 INFO L231 Difference]: Finished difference. Result has 144 places, 275 transitions, 2261 flow [2022-12-13 18:52:25,538 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=2138, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2261, PETRI_PLACES=144, PETRI_TRANSITIONS=275} [2022-12-13 18:52:25,538 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 90 predicate places. [2022-12-13 18:52:25,539 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 275 transitions, 2261 flow [2022-12-13 18:52:25,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 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 18:52:25,539 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:52:25,539 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:52:25,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 18:52:25,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 18:52:25,740 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-13 18:52:25,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:52:25,740 INFO L85 PathProgramCache]: Analyzing trace with hash 393229751, now seen corresponding path program 1 times [2022-12-13 18:52:25,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:52:25,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608950381] [2022-12-13 18:52:25,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:52:25,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:52:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:52:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:52:25,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:52:25,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608950381] [2022-12-13 18:52:25,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608950381] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:52:25,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696581274] [2022-12-13 18:52:25,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:52:25,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:52:25,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:52:25,787 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:52:25,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 18:52:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:52:25,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 18:52:25,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:52:25,889 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:52:25,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:52:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:52:25,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696581274] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:52:25,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:52:25,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 18:52:25,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037371280] [2022-12-13 18:52:25,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:52:25,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:52:25,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:52:25,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:52:25,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:52:25,925 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 199 [2022-12-13 18:52:25,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 275 transitions, 2261 flow. Second operand has 7 states, 7 states have (on average 118.85714285714286) internal successors, (832), 7 states have internal predecessors, (832), 0 states have call successors, (0), 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 18:52:25,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:52:25,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 199 [2022-12-13 18:52:25,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:52:27,199 INFO L130 PetriNetUnfolder]: 3639/8965 cut-off events. [2022-12-13 18:52:27,199 INFO L131 PetriNetUnfolder]: For 31669/32083 co-relation queries the response was YES. [2022-12-13 18:52:27,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37759 conditions, 8965 events. 3639/8965 cut-off events. For 31669/32083 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 67840 event pairs, 412 based on Foata normal form. 111/8984 useless extension candidates. Maximal degree in co-relation 37673. Up to 2492 conditions per place. [2022-12-13 18:52:27,246 INFO L137 encePairwiseOnDemand]: 195/199 looper letters, 181 selfloop transitions, 23 changer transitions 0/395 dead transitions. [2022-12-13 18:52:27,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 395 transitions, 3774 flow [2022-12-13 18:52:27,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:52:27,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:52:27,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 767 transitions. [2022-12-13 18:52:27,247 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6423785594639866 [2022-12-13 18:52:27,247 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 767 transitions. [2022-12-13 18:52:27,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 767 transitions. [2022-12-13 18:52:27,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:52:27,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 767 transitions. [2022-12-13 18:52:27,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 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 18:52:27,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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 18:52:27,250 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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 18:52:27,250 INFO L175 Difference]: Start difference. First operand has 144 places, 275 transitions, 2261 flow. Second operand 6 states and 767 transitions. [2022-12-13 18:52:27,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 395 transitions, 3774 flow [2022-12-13 18:52:27,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 395 transitions, 3744 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 18:52:27,303 INFO L231 Difference]: Finished difference. Result has 151 places, 284 transitions, 2411 flow [2022-12-13 18:52:27,303 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=2237, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2411, PETRI_PLACES=151, PETRI_TRANSITIONS=284} [2022-12-13 18:52:27,303 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 97 predicate places. [2022-12-13 18:52:27,303 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 284 transitions, 2411 flow [2022-12-13 18:52:27,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.85714285714286) internal successors, (832), 7 states have internal predecessors, (832), 0 states have call successors, (0), 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 18:52:27,304 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:52:27,304 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:52:27,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 18:52:27,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:52:27,505 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-13 18:52:27,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:52:27,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1755051111, now seen corresponding path program 1 times [2022-12-13 18:52:27,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:52:27,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067792065] [2022-12-13 18:52:27,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:52:27,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:52:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:52:27,705 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-13 18:52:27,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:52:27,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067792065] [2022-12-13 18:52:27,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067792065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:52:27,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:52:27,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:52:27,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219499516] [2022-12-13 18:52:27,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:52:27,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:52:27,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:52:27,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:52:27,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:52:27,868 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 199 [2022-12-13 18:52:27,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 284 transitions, 2411 flow. Second operand has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 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 18:52:27,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:52:27,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 199 [2022-12-13 18:52:27,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:52:29,911 INFO L130 PetriNetUnfolder]: 5029/11122 cut-off events. [2022-12-13 18:52:29,911 INFO L131 PetriNetUnfolder]: For 44470/44724 co-relation queries the response was YES. [2022-12-13 18:52:29,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51978 conditions, 11122 events. 5029/11122 cut-off events. For 44470/44724 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 81337 event pairs, 874 based on Foata normal form. 82/11144 useless extension candidates. Maximal degree in co-relation 51890. Up to 7662 conditions per place. [2022-12-13 18:52:29,968 INFO L137 encePairwiseOnDemand]: 184/199 looper letters, 295 selfloop transitions, 100 changer transitions 4/453 dead transitions. [2022-12-13 18:52:29,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 453 transitions, 5069 flow [2022-12-13 18:52:29,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:52:29,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:52:29,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 713 transitions. [2022-12-13 18:52:29,970 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5971524288107203 [2022-12-13 18:52:29,970 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 713 transitions. [2022-12-13 18:52:29,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 713 transitions. [2022-12-13 18:52:29,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:52:29,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 713 transitions. [2022-12-13 18:52:29,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 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 18:52:29,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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 18:52:29,972 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 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 18:52:29,972 INFO L175 Difference]: Start difference. First operand has 151 places, 284 transitions, 2411 flow. Second operand 6 states and 713 transitions. [2022-12-13 18:52:29,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 453 transitions, 5069 flow [2022-12-13 18:52:30,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 453 transitions, 4905 flow, removed 65 selfloop flow, removed 1 redundant places. [2022-12-13 18:52:30,048 INFO L231 Difference]: Finished difference. Result has 160 places, 343 transitions, 3447 flow [2022-12-13 18:52:30,048 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=2375, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3447, PETRI_PLACES=160, PETRI_TRANSITIONS=343} [2022-12-13 18:52:30,048 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 106 predicate places. [2022-12-13 18:52:30,048 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 343 transitions, 3447 flow [2022-12-13 18:52:30,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 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 18:52:30,048 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:52:30,049 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:52:30,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 18:52:30,049 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-13 18:52:30,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:52:30,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1622369523, now seen corresponding path program 1 times [2022-12-13 18:52:30,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:52:30,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942604662] [2022-12-13 18:52:30,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:52:30,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:52:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:52:30,815 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:52:30,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:52:30,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942604662] [2022-12-13 18:52:30,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942604662] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:52:30,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572364546] [2022-12-13 18:52:30,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:52:30,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:52:30,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:52:30,817 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:52:30,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 18:52:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:52:30,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-13 18:52:30,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:52:31,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 18:52:31,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,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 21 treesize of output 20 [2022-12-13 18:52:31,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-12-13 18:52:31,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-12-13 18:52:31,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-12-13 18:52:31,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-12-13 18:52:31,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-12-13 18:52:31,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-12-13 18:52:31,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:52:31,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-12-13 18:52:31,435 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:52:31,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:52:56,625 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:52:56,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572364546] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:52:56,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:52:56,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 31 [2022-12-13 18:52:56,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986356868] [2022-12-13 18:52:56,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:52:56,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 18:52:56,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:52:56,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 18:52:56,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=803, Unknown=6, NotChecked=0, Total=992 [2022-12-13 18:52:59,637 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 18:53:02,432 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 18:53:05,256 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 18:53:07,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:53:09,592 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 18:53:11,738 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 18:53:13,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:53:15,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:53:17,321 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 18:53:19,386 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 18:53:21,530 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 18:53:27,512 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 18:53:29,551 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 18:53:32,750 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 18:53:35,212 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 18:53:38,500 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 18:53:40,644 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 18:53:42,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:53:44,597 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 18:53:47,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:53:49,822 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 18:53:51,989 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 18:53:55,433 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 18:53:57,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:53:59,677 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 18:54:02,721 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 18:54:04,817 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 18:54:10,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:54:13,817 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 18:54:15,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:54:18,144 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 18:54:20,560 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 18:54:22,652 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 18:54:26,248 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 18:54:28,344 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 18:54:30,488 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 18:54:32,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:54:32,397 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 199 [2022-12-13 18:54:32,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 343 transitions, 3447 flow. Second operand has 32 states, 32 states have (on average 56.21875) internal successors, (1799), 32 states have internal predecessors, (1799), 0 states have call successors, (0), 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 18:54:32,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:54:32,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 199 [2022-12-13 18:54:32,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:54:41,883 INFO L130 PetriNetUnfolder]: 8032/16170 cut-off events. [2022-12-13 18:54:41,884 INFO L131 PetriNetUnfolder]: For 79822/79822 co-relation queries the response was YES. [2022-12-13 18:54:41,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82776 conditions, 16170 events. 8032/16170 cut-off events. For 79822/79822 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 115598 event pairs, 1128 based on Foata normal form. 20/16024 useless extension candidates. Maximal degree in co-relation 82683. Up to 6952 conditions per place. [2022-12-13 18:54:42,018 INFO L137 encePairwiseOnDemand]: 181/199 looper letters, 846 selfloop transitions, 124 changer transitions 1/971 dead transitions. [2022-12-13 18:54:42,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 971 transitions, 10892 flow [2022-12-13 18:54:42,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 18:54:42,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 18:54:42,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1170 transitions. [2022-12-13 18:54:42,021 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.36746231155778897 [2022-12-13 18:54:42,021 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1170 transitions. [2022-12-13 18:54:42,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1170 transitions. [2022-12-13 18:54:42,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:54:42,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1170 transitions. [2022-12-13 18:54:42,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 73.125) internal successors, (1170), 16 states have internal predecessors, (1170), 0 states have call successors, (0), 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 18:54:42,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 199.0) internal successors, (3383), 17 states have internal predecessors, (3383), 0 states have call successors, (0), 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 18:54:42,026 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 199.0) internal successors, (3383), 17 states have internal predecessors, (3383), 0 states have call successors, (0), 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 18:54:42,026 INFO L175 Difference]: Start difference. First operand has 160 places, 343 transitions, 3447 flow. Second operand 16 states and 1170 transitions. [2022-12-13 18:54:42,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 971 transitions, 10892 flow [2022-12-13 18:54:42,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 971 transitions, 10544 flow, removed 174 selfloop flow, removed 0 redundant places. [2022-12-13 18:54:42,267 INFO L231 Difference]: Finished difference. Result has 186 places, 447 transitions, 5090 flow [2022-12-13 18:54:42,267 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=3307, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5090, PETRI_PLACES=186, PETRI_TRANSITIONS=447} [2022-12-13 18:54:42,267 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 132 predicate places. [2022-12-13 18:54:42,268 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 447 transitions, 5090 flow [2022-12-13 18:54:42,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 56.21875) internal successors, (1799), 32 states have internal predecessors, (1799), 0 states have call successors, (0), 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 18:54:42,268 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:54:42,268 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:54:42,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 18:54:42,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 18:54:42,470 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-13 18:54:42,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:54:42,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1749855883, now seen corresponding path program 1 times [2022-12-13 18:54:42,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:54:42,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722693954] [2022-12-13 18:54:42,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:54:42,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:54:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:54:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:54:43,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:54:43,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722693954] [2022-12-13 18:54:43,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722693954] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:54:43,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110027707] [2022-12-13 18:54:43,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:54:43,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:54:43,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:54:43,327 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:54:43,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 18:54:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:54:43,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-13 18:54:43,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:54:43,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 18:54:43,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 18:54:43,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-12-13 18:54:43,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-12-13 18:54:43,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:54:43,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:54:43,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:54:43,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:54:43,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-12-13 18:54:43,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:54:43,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:54:43,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:54:43,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:54:43,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-12-13 18:54:43,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:54:43,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:54:43,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:54:43,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:54:43,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-12-13 18:54:43,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:54:43,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:54:43,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:54:43,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:54:43,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-12-13 18:54:43,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:54:43,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:54:43,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:54:43,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:54:43,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-12-13 18:54:43,985 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:54:43,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:54:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:54:45,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110027707] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:54:45,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:54:45,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 31 [2022-12-13 18:54:45,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624890858] [2022-12-13 18:54:45,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:54:45,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 18:54:45,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:54:45,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 18:54:45,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=794, Unknown=0, NotChecked=0, Total=992 [2022-12-13 18:54:55,247 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 199 [2022-12-13 18:54:55,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 447 transitions, 5090 flow. Second operand has 32 states, 32 states have (on average 90.875) internal successors, (2908), 32 states have internal predecessors, (2908), 0 states have call successors, (0), 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 18:54:55,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:54:55,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 199 [2022-12-13 18:54:55,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:55:00,022 INFO L130 PetriNetUnfolder]: 6412/13973 cut-off events. [2022-12-13 18:55:00,023 INFO L131 PetriNetUnfolder]: For 88735/89442 co-relation queries the response was YES. [2022-12-13 18:55:00,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74326 conditions, 13973 events. 6412/13973 cut-off events. For 88735/89442 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 105060 event pairs, 775 based on Foata normal form. 123/14054 useless extension candidates. Maximal degree in co-relation 74220. Up to 6659 conditions per place. [2022-12-13 18:55:00,120 INFO L137 encePairwiseOnDemand]: 181/199 looper letters, 539 selfloop transitions, 176 changer transitions 0/781 dead transitions. [2022-12-13 18:55:00,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 781 transitions, 10027 flow [2022-12-13 18:55:00,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 18:55:00,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 18:55:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1415 transitions. [2022-12-13 18:55:00,122 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5078966259870783 [2022-12-13 18:55:00,122 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1415 transitions. [2022-12-13 18:55:00,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1415 transitions. [2022-12-13 18:55:00,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:55:00,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1415 transitions. [2022-12-13 18:55:00,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 101.07142857142857) internal successors, (1415), 14 states have internal predecessors, (1415), 0 states have call successors, (0), 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 18:55:00,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 199.0) internal successors, (2985), 15 states have internal predecessors, (2985), 0 states have call successors, (0), 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 18:55:00,127 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 199.0) internal successors, (2985), 15 states have internal predecessors, (2985), 0 states have call successors, (0), 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 18:55:00,127 INFO L175 Difference]: Start difference. First operand has 186 places, 447 transitions, 5090 flow. Second operand 14 states and 1415 transitions. [2022-12-13 18:55:00,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 781 transitions, 10027 flow [2022-12-13 18:55:00,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 781 transitions, 9960 flow, removed 33 selfloop flow, removed 1 redundant places. [2022-12-13 18:55:00,340 INFO L231 Difference]: Finished difference. Result has 209 places, 536 transitions, 7186 flow [2022-12-13 18:55:00,341 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=5037, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=7186, PETRI_PLACES=209, PETRI_TRANSITIONS=536} [2022-12-13 18:55:00,341 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 155 predicate places. [2022-12-13 18:55:00,341 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 536 transitions, 7186 flow [2022-12-13 18:55:00,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 90.875) internal successors, (2908), 32 states have internal predecessors, (2908), 0 states have call successors, (0), 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 18:55:00,342 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:55:00,342 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:55:00,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 18:55:00,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 18:55:00,543 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-13 18:55:00,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:55:00,544 INFO L85 PathProgramCache]: Analyzing trace with hash 294991021, now seen corresponding path program 2 times [2022-12-13 18:55:00,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:55:00,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107087865] [2022-12-13 18:55:00,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:55:00,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:55:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:55:01,256 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:55:01,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:55:01,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107087865] [2022-12-13 18:55:01,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107087865] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:55:01,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65557937] [2022-12-13 18:55:01,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 18:55:01,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:55:01,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:55:01,257 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:55:01,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 18:55:01,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 18:55:01,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:55:01,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-13 18:55:01,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:55:01,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 18:55:01,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 18:55:01,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-12-13 18:55:01,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-12-13 18:55:01,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-12-13 18:55:01,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-12-13 18:55:01,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-12-13 18:55:01,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:01,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-12-13 18:55:02,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:02,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:02,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:02,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:02,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:02,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:02,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:55:02,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-12-13 18:55:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:55:02,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:55:27,897 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:55:27,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65557937] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:55:27,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:55:27,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-12-13 18:55:27,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525772114] [2022-12-13 18:55:27,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:55:27,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 18:55:27,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:55:27,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 18:55:27,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=870, Unknown=4, NotChecked=0, Total=1056 [2022-12-13 18:55:30,322 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 18:55:32,515 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 18:55:35,819 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 18:55:37,859 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 18:55:39,895 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 18:55:42,107 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 18:55:45,201 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 18:55:48,882 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 18:55:50,925 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 18:55:54,675 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 18:55:56,688 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 18:55:58,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:56:01,077 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 18:56:03,389 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 18:56:05,424 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 18:56:06,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:56:10,910 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 18:56:12,944 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 18:56:16,536 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 18:56:19,098 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 18:56:21,575 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 18:56:25,382 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 18:56:28,037 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 18:56:32,215 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 18:56:35,438 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 18:56:37,851 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 18:56:40,029 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 18:56:41,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:56:44,073 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 18:56:46,110 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 18:56:48,140 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 18:56:49,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:56:52,427 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 18:56:57,129 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 18:56:59,439 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 18:57:02,758 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 18:57:05,633 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 18:57:09,416 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 18:57:12,071 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 18:57:13,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:57:15,202 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 18:57:17,725 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 18:57:17,733 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 199 [2022-12-13 18:57:17,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 536 transitions, 7186 flow. Second operand has 33 states, 33 states have (on average 56.121212121212125) internal successors, (1852), 33 states have internal predecessors, (1852), 0 states have call successors, (0), 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 18:57:17,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:57:17,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 199 [2022-12-13 18:57:17,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:57:39,465 INFO L130 PetriNetUnfolder]: 16306/32802 cut-off events. [2022-12-13 18:57:39,465 INFO L131 PetriNetUnfolder]: For 245792/245792 co-relation queries the response was YES. [2022-12-13 18:57:39,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183595 conditions, 32802 events. 16306/32802 cut-off events. For 245792/245792 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 242545 event pairs, 2952 based on Foata normal form. 65/32491 useless extension candidates. Maximal degree in co-relation 183477. Up to 11467 conditions per place. [2022-12-13 18:57:39,758 INFO L137 encePairwiseOnDemand]: 180/199 looper letters, 1773 selfloop transitions, 359 changer transitions 0/2132 dead transitions. [2022-12-13 18:57:39,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 2132 transitions, 27271 flow [2022-12-13 18:57:39,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-13 18:57:39,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-13 18:57:39,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2178 transitions. [2022-12-13 18:57:39,761 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3774042626927742 [2022-12-13 18:57:39,761 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 2178 transitions. [2022-12-13 18:57:39,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 2178 transitions. [2022-12-13 18:57:39,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:57:39,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2178 transitions. [2022-12-13 18:57:39,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 75.10344827586206) internal successors, (2178), 29 states have internal predecessors, (2178), 0 states have call successors, (0), 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 18:57:39,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 199.0) internal successors, (5970), 30 states have internal predecessors, (5970), 0 states have call successors, (0), 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 18:57:39,768 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 199.0) internal successors, (5970), 30 states have internal predecessors, (5970), 0 states have call successors, (0), 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 18:57:39,768 INFO L175 Difference]: Start difference. First operand has 209 places, 536 transitions, 7186 flow. Second operand 29 states and 2178 transitions. [2022-12-13 18:57:39,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 2132 transitions, 27271 flow [2022-12-13 18:57:40,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 2132 transitions, 26933 flow, removed 166 selfloop flow, removed 2 redundant places. [2022-12-13 18:57:40,708 INFO L231 Difference]: Finished difference. Result has 256 places, 777 transitions, 12623 flow [2022-12-13 18:57:40,708 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=7038, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=12623, PETRI_PLACES=256, PETRI_TRANSITIONS=777} [2022-12-13 18:57:40,708 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 202 predicate places. [2022-12-13 18:57:40,709 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 777 transitions, 12623 flow [2022-12-13 18:57:40,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 56.121212121212125) internal successors, (1852), 33 states have internal predecessors, (1852), 0 states have call successors, (0), 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 18:57:40,709 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:57:40,709 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:57:40,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 18:57:40,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 18:57:40,911 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-13 18:57:40,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:57:40,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1108343623, now seen corresponding path program 1 times [2022-12-13 18:57:40,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:57:40,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933170356] [2022-12-13 18:57:40,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:57:40,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:57:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:57:41,513 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:57:41,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:57:41,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933170356] [2022-12-13 18:57:41,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933170356] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:57:41,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908760898] [2022-12-13 18:57:41,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:57:41,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:57:41,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:57:41,515 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:57:41,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 18:57:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:57:41,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 18:57:41,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:57:41,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 18:57:41,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:41,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 18:57:42,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:42,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:42,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-12-13 18:57:42,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:42,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:42,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:42,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-12-13 18:57:42,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:42,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:42,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:42,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:42,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:42,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:42,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:57:42,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-12-13 18:57:42,247 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:57:42,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:57:55,360 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:57:55,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908760898] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:57:55,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:57:55,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-12-13 18:57:55,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501463421] [2022-12-13 18:57:55,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:57:55,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 18:57:55,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:57:55,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 18:57:55,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=747, Unknown=4, NotChecked=0, Total=930 [2022-12-13 18:57:57,467 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 18:57:59,920 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 18:58:02,112 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 18:58:04,140 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 18:58:06,527 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 18:58:07,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:58:08,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:58:11,405 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 18:58:14,284 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 18:58:18,434 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 18:58:21,719 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 18:58:24,138 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 18:58:26,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:58:30,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:58:34,708 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 18:58:35,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:58:38,308 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 18:58:43,298 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 18:58:45,772 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 18:58:48,730 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 18:58:52,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:58:54,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:58:56,405 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 18:58:58,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:59:00,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:59:03,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:59:03,658 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 199 [2022-12-13 18:59:03,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 777 transitions, 12623 flow. Second operand has 31 states, 31 states have (on average 54.32258064516129) internal successors, (1684), 31 states have internal predecessors, (1684), 0 states have call successors, (0), 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 18:59:03,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:59:03,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 199 [2022-12-13 18:59:03,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:59:19,800 INFO L130 PetriNetUnfolder]: 19926/40064 cut-off events. [2022-12-13 18:59:19,800 INFO L131 PetriNetUnfolder]: For 376035/376035 co-relation queries the response was YES. [2022-12-13 18:59:20,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240021 conditions, 40064 events. 19926/40064 cut-off events. For 376035/376035 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 313360 event pairs, 5552 based on Foata normal form. 102/39668 useless extension candidates. Maximal degree in co-relation 239882. Up to 24511 conditions per place. [2022-12-13 18:59:20,270 INFO L137 encePairwiseOnDemand]: 170/199 looper letters, 1371 selfloop transitions, 243 changer transitions 8/1622 dead transitions. [2022-12-13 18:59:20,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 1622 transitions, 24907 flow [2022-12-13 18:59:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 18:59:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 18:59:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1231 transitions. [2022-12-13 18:59:20,272 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3866206030150754 [2022-12-13 18:59:20,272 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1231 transitions. [2022-12-13 18:59:20,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1231 transitions. [2022-12-13 18:59:20,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:59:20,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1231 transitions. [2022-12-13 18:59:20,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 76.9375) internal successors, (1231), 16 states have internal predecessors, (1231), 0 states have call successors, (0), 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 18:59:20,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 199.0) internal successors, (3383), 17 states have internal predecessors, (3383), 0 states have call successors, (0), 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 18:59:20,277 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 199.0) internal successors, (3383), 17 states have internal predecessors, (3383), 0 states have call successors, (0), 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 18:59:20,277 INFO L175 Difference]: Start difference. First operand has 256 places, 777 transitions, 12623 flow. Second operand 16 states and 1231 transitions. [2022-12-13 18:59:20,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 1622 transitions, 24907 flow [2022-12-13 18:59:22,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 1622 transitions, 24282 flow, removed 215 selfloop flow, removed 3 redundant places. [2022-12-13 18:59:22,054 INFO L231 Difference]: Finished difference. Result has 279 places, 958 transitions, 15825 flow [2022-12-13 18:59:22,055 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=12159, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=777, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=15825, PETRI_PLACES=279, PETRI_TRANSITIONS=958} [2022-12-13 18:59:22,055 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 225 predicate places. [2022-12-13 18:59:22,055 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 958 transitions, 15825 flow [2022-12-13 18:59:22,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 54.32258064516129) internal successors, (1684), 31 states have internal predecessors, (1684), 0 states have call successors, (0), 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 18:59:22,056 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:59:22,056 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:59:22,060 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 18:59:22,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 18:59:22,257 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-12-13 18:59:22,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:59:22,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1282425571, now seen corresponding path program 1 times [2022-12-13 18:59:22,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:59:22,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243254877] [2022-12-13 18:59:22,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:59:22,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:59:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:59:23,295 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:59:23,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:59:23,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243254877] [2022-12-13 18:59:23,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243254877] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:59:23,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076917787] [2022-12-13 18:59:23,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:59:23,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:59:23,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:59:23,296 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:59:23,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5cf8004-cdc5-42df-b7eb-611b4771f6af/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 18:59:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:59:23,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 18:59:23,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:59:23,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 18:59:23,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 18:59:23,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 18:59:23,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-12-13 18:59:23,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-12-13 18:59:23,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-12-13 18:59:23,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-12-13 18:59:23,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:59:23,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2022-12-13 18:59:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:59:28,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:59:42,882 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:59:42,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076917787] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:59:42,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:59:42,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 15] total 36 [2022-12-13 18:59:42,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066135930] [2022-12-13 18:59:42,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:59:42,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-13 18:59:42,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:59:42,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-13 18:59:42,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1118, Unknown=1, NotChecked=0, Total=1332 [2022-12-13 18:59:45,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 18:59:52,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:00:05,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:00:09,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:00:12,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:00:15,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:00:18,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:00:21,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:00:25,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:00:30,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:00:34,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:00:38,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:00:41,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:00:44,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:00:58,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:01:01,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:01:05,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:01:11,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:01:17,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:01:29,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:01:32,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:01:35,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:01:42,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:01:48,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:01:55,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:02:02,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:02:09,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:02:13,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:02:17,989 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 19:02:20,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:02:20,778 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 199 [2022-12-13 19:02:20,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 958 transitions, 15825 flow. Second operand has 37 states, 37 states have (on average 64.64864864864865) internal successors, (2392), 37 states have internal predecessors, (2392), 0 states have call successors, (0), 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 19:02:20,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:02:20,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 199 [2022-12-13 19:02:20,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:03:08,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:03:10,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:03:39,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 19:03:42,745 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse15 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse12 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse14 (not (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (.cse30 (+ .cse15 |c_~#cache~0.offset|)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse13 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (and (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse3 (let ((.cse5 (let ((.cse6 (let ((.cse8 (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse13 .cse1 v_ArrVal_1646)))) (store .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 v_ArrVal_1651))))) (store .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 v_ArrVal_1655))))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select .cse0 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0)))))) (or .cse14 (not (= (+ 3 .cse15 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse17 (let ((.cse18 (let ((.cse19 (let ((.cse20 (let ((.cse21 (let ((.cse22 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse13 .cse1 v_ArrVal_1646)))) (store .cse22 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse22 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))))) (store .cse21 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse21 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 v_ArrVal_1651))))) (store .cse20 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse20 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))))) (store .cse19 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse19 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 v_ArrVal_1655))))) (store .cse18 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse18 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse16 .cse1) 0)) (not (= (select .cse16 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= 0 (select (select (store .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse9))))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse24 (let ((.cse25 (let ((.cse26 (let ((.cse27 (let ((.cse28 (let ((.cse29 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse13 .cse1 v_ArrVal_1646)))) (store .cse29 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse29 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))))) (store .cse28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 v_ArrVal_1651))))) (store .cse27 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse27 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))))) (store .cse26 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse26 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 v_ArrVal_1655))))) (store .cse25 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse25 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (let ((.cse23 (select .cse24 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse23 .cse1) 0)) (not (= (select .cse23 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse24 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse23 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))))) (or .cse14 (not (= .cse30 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (or (not (= (+ 2 .cse15 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) .cse14) (= |c_~#cache~0.base| 1) (< (+ 2 .cse15) (* |c_ULTIMATE.start_main_~i~2#1| 28)) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse32 (let ((.cse33 (let ((.cse34 (let ((.cse35 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse13 .cse2 v_ArrVal_1651)))) (store .cse35 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse35 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))))) (store .cse34 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse34 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 v_ArrVal_1655))))) (store .cse33 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse33 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse31 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse32 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse31 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse12) 0)) (not (= (select .cse31 .cse1) 0)))))) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (or .cse14 (not (= .cse7 .cse30))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse37 (let ((.cse38 (let ((.cse39 (let ((.cse40 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse13 .cse2 v_ArrVal_1651)))) (store .cse40 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse40 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))))) (store .cse39 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse39 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 v_ArrVal_1655))))) (store .cse38 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse38 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (let ((.cse36 (select .cse37 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse36 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= 0 (select (select (store .cse37 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse36 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse9))) (not (= (select .cse36 .cse1) 0)))))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse42 (let ((.cse43 (let ((.cse44 (let ((.cse45 (let ((.cse46 (let ((.cse47 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse13 .cse1 v_ArrVal_1646)))) (store .cse47 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse47 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))))) (store .cse46 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse46 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 v_ArrVal_1651))))) (store .cse45 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse45 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))))) (store .cse44 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse44 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 v_ArrVal_1655))))) (store .cse43 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse43 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (let ((.cse41 (select .cse42 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse41 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse42 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse41 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse12) 0)) (not (= (select .cse41 .cse2) 0)))))) (or .cse14 (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse15 |c_~#cache~0.offset| 1)))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse48 (let ((.cse50 (let ((.cse51 (let ((.cse52 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse13 .cse2 v_ArrVal_1651)))) (store .cse52 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse52 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))))) (store .cse51 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse51 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 v_ArrVal_1655))))) (store .cse50 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse50 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (let ((.cse49 (select .cse48 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse48 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse49 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0)) (not (= (select .cse49 .cse2) 0)) (not (= (select .cse49 .cse1) 0)))))) (or (not (= .cse30 .cse2)) .cse14) (or .cse14 (not (= .cse30 .cse1))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse54 (let ((.cse55 (let ((.cse56 (let ((.cse57 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse13 .cse2 v_ArrVal_1651)))) (store .cse57 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse57 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))))) (store .cse56 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse56 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 v_ArrVal_1655))))) (store .cse55 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse55 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (let ((.cse53 (select .cse54 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse53 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse54 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse53 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (select .cse53 .cse1) 0))))))))) is different from true [2022-12-13 19:03:46,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:03:53,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:04:04,243 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 19:04:07,059 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 19:04:09,519 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse16 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse8 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse7 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (and (forall ((v_ArrVal_1655 Int)) (let ((.cse3 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse8 v_ArrVal_1655)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select .cse0 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse10 (let ((.cse11 (let ((.cse12 (let ((.cse13 (let ((.cse14 (let ((.cse15 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse2 v_ArrVal_1646)))) (store .cse15 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16 0))))) (store .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_1651))))) (store .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse9 .cse2) 0)) (not (= (select .cse9 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse18 (let ((.cse19 (let ((.cse20 (let ((.cse21 (let ((.cse22 (let ((.cse23 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse2 v_ArrVal_1646)))) (store .cse23 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse23 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16 0))))) (store .cse22 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse22 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_1651))))) (store .cse21 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse21 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse20 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse20 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse19 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse19 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse17 (select .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse17 .cse2) 0)) (not (= (select .cse17 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= 0 (select (select (store .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4))))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse25 (let ((.cse26 (let ((.cse27 (let ((.cse28 (let ((.cse29 (let ((.cse30 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse2 v_ArrVal_1646)))) (store .cse30 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse30 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16 0))))) (store .cse29 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse29 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_1651))))) (store .cse28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse27 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse27 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse26 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse26 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse24 (select .cse25 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse24 .cse2) 0)) (not (= (select .cse24 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse25 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse24 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))))) (forall ((v_ArrVal_1655 Int)) (let ((.cse32 (let ((.cse33 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse8 v_ArrVal_1655)))) (store .cse33 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse33 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse31 .cse1) 0)) (not (= (select .cse31 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse32 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse31 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))))) (forall ((v_ArrVal_1659 Int)) (= 0 (select (select (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4))) (forall ((v_ArrVal_1659 Int)) (= (select (select (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse35 (let ((.cse36 (let ((.cse37 (let ((.cse38 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse1 v_ArrVal_1651)))) (store .cse38 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse38 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse37 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse37 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse36 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse36 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse34 (select .cse35 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse34 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse35 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse34 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16) 0)) (not (= (select .cse34 .cse2) 0)))))) (forall ((v_ArrVal_1659 Int)) (= (select (select (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16) 0)) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse40 (let ((.cse41 (let ((.cse42 (let ((.cse43 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse1 v_ArrVal_1651)))) (store .cse43 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse43 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse42 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse42 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse41 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse41 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse39 (select .cse40 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse39 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= 0 (select (select (store .cse40 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse39 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4))) (not (= (select .cse39 .cse2) 0)))))) (forall ((v_ArrVal_1655 Int)) (let ((.cse45 (let ((.cse46 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse8 v_ArrVal_1655)))) (store .cse46 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse46 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse44 (select .cse45 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse44 .cse1) 0)) (not (= (select .cse44 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse45 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse44 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16) 0)))))) (forall ((v_ArrVal_1659 Int)) (= (select (select (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse48 (let ((.cse49 (let ((.cse50 (let ((.cse51 (let ((.cse52 (let ((.cse53 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse2 v_ArrVal_1646)))) (store .cse53 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse53 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16 0))))) (store .cse52 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse52 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_1651))))) (store .cse51 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse51 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse50 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse50 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse49 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse49 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse47 (select .cse48 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse47 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse48 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse47 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16) 0)) (not (= (select .cse47 .cse1) 0)))))) (forall ((v_ArrVal_1655 Int)) (let ((.cse55 (let ((.cse56 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse8 v_ArrVal_1655)))) (store .cse56 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse56 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse54 (select .cse55 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse54 .cse1) 0)) (not (= (select .cse54 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse55 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse54 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse57 (let ((.cse59 (let ((.cse60 (let ((.cse61 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse1 v_ArrVal_1651)))) (store .cse61 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse61 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse60 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse60 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse59 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse59 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse58 (select .cse57 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse57 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse58 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)) (not (= (select .cse58 .cse1) 0)) (not (= (select .cse58 .cse2) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse63 (let ((.cse64 (let ((.cse65 (let ((.cse66 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse1 v_ArrVal_1651)))) (store .cse66 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse66 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse65 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse65 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse64 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse64 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse62 (select .cse63 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse62 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse63 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse62 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (select .cse62 .cse2) 0)))))))) is different from true [2022-12-13 19:04:18,106 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 19:04:19,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:04:21,718 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse20 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (let ((.cse10 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse20 0)))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse12 (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse8 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse29 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (and (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse0 (let ((.cse5 (let ((.cse7 (let ((.cse9 (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse11 .cse3 v_ArrVal_1651)))) (store .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2) 0)) (not (= (select .cse1 .cse3) 0)) (not (= (select .cse1 .cse4) 0)))))) (or .cse12 (not (= .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (or (not (= .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) .cse12) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse13 (let ((.cse15 (let ((.cse16 (let ((.cse17 (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse11 .cse3 v_ArrVal_1651)))) (store .cse17 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse17 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse15 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (select .cse14 .cse3) 0)) (not (= (select .cse14 .cse4) 0)))))) (or (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse4)) .cse12) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse18 (let ((.cse21 (let ((.cse22 (let ((.cse23 (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse11 .cse3 v_ArrVal_1651)))) (store .cse23 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse23 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse22 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse22 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse21 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse21 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse19 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse20) 0)) (not (= (select .cse19 .cse3) 0)) (not (= (select .cse19 .cse4) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse25 (let ((.cse26 (let ((.cse27 (let ((.cse28 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse29 .cse3 v_ArrVal_1651)))) (store .cse28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse27 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse27 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse26 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse26 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse24 (select .cse25 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse24 .cse3) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse25 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse24 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse20) 0)) (not (= (select .cse24 .cse4) 0)))))) (or (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse20)) .cse12) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse31 (let ((.cse32 (let ((.cse33 (let ((.cse34 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse29 .cse3 v_ArrVal_1651)))) (store .cse34 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse34 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse33 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse33 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse32 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse32 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse30 (select .cse31 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse30 .cse3) 0)) (forall ((v_ArrVal_1659 Int)) (= 0 (select (select (store .cse31 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse30 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2))) (not (= (select .cse30 .cse4) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse36 (let ((.cse37 (let ((.cse38 (let ((.cse39 (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse11 .cse3 v_ArrVal_1651)))) (store .cse39 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse39 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse38 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse38 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse37 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse37 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse35 (select .cse36 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse35 .cse3) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse36 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse35 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)) (not (= (select .cse35 .cse4) 0)))))) (or .cse12 (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse3))) (or (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) .cse12) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse40 (let ((.cse42 (let ((.cse43 (let ((.cse44 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse29 .cse3 v_ArrVal_1651)))) (store .cse44 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse44 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse43 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse43 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse42 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse42 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse41 (select .cse40 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse40 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse41 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)) (not (= (select .cse41 .cse3) 0)) (not (= (select .cse41 .cse4) 0)))))) (or (not (= .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) .cse12) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse46 (let ((.cse47 (let ((.cse48 (let ((.cse49 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse29 .cse3 v_ArrVal_1651)))) (store .cse49 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse49 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse48 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse48 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse47 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse47 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse45 (select .cse46 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse45 .cse3) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse46 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse45 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (select .cse45 .cse4) 0)))))))))) is different from true [2022-12-13 19:04:24,585 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse16 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse8 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse7 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (and (forall ((v_ArrVal_1655 Int)) (let ((.cse3 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse8 v_ArrVal_1655)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select .cse0 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse10 (let ((.cse11 (let ((.cse12 (let ((.cse13 (let ((.cse14 (let ((.cse15 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse2 v_ArrVal_1646)))) (store .cse15 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16 0))))) (store .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_1651))))) (store .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse9 .cse2) 0)) (not (= (select .cse9 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse18 (let ((.cse19 (let ((.cse20 (let ((.cse21 (let ((.cse22 (let ((.cse23 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse2 v_ArrVal_1646)))) (store .cse23 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse23 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16 0))))) (store .cse22 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse22 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_1651))))) (store .cse21 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse21 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse20 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse20 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse19 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse19 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse17 (select .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse17 .cse2) 0)) (not (= (select .cse17 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= 0 (select (select (store .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4))))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse25 (let ((.cse26 (let ((.cse27 (let ((.cse28 (let ((.cse29 (let ((.cse30 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse2 v_ArrVal_1646)))) (store .cse30 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse30 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16 0))))) (store .cse29 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse29 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_1651))))) (store .cse28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse27 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse27 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse26 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse26 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse24 (select .cse25 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse24 .cse2) 0)) (not (= (select .cse24 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse25 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse24 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))))) (forall ((v_ArrVal_1655 Int)) (let ((.cse32 (let ((.cse33 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse8 v_ArrVal_1655)))) (store .cse33 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse33 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse31 .cse1) 0)) (not (= (select .cse31 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse32 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse31 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse35 (let ((.cse36 (let ((.cse37 (let ((.cse38 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse1 v_ArrVal_1651)))) (store .cse38 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse38 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse37 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse37 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse36 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse36 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse34 (select .cse35 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse34 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse35 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse34 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16) 0)) (not (= (select .cse34 .cse2) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse40 (let ((.cse41 (let ((.cse42 (let ((.cse43 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse1 v_ArrVal_1651)))) (store .cse43 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse43 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse42 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse42 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse41 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse41 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse39 (select .cse40 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse39 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= 0 (select (select (store .cse40 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse39 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4))) (not (= (select .cse39 .cse2) 0)))))) (forall ((v_ArrVal_1655 Int)) (let ((.cse45 (let ((.cse46 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse8 v_ArrVal_1655)))) (store .cse46 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse46 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse44 (select .cse45 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse44 .cse1) 0)) (not (= (select .cse44 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse45 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse44 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse48 (let ((.cse49 (let ((.cse50 (let ((.cse51 (let ((.cse52 (let ((.cse53 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse2 v_ArrVal_1646)))) (store .cse53 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse53 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16 0))))) (store .cse52 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse52 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_1651))))) (store .cse51 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse51 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse50 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse50 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse49 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse49 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse47 (select .cse48 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse47 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse48 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse47 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16) 0)) (not (= (select .cse47 .cse1) 0)))))) (forall ((v_ArrVal_1655 Int)) (let ((.cse55 (let ((.cse56 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse8 v_ArrVal_1655)))) (store .cse56 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse56 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse54 (select .cse55 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse54 .cse1) 0)) (not (= (select .cse54 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse55 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse54 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse57 (let ((.cse59 (let ((.cse60 (let ((.cse61 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse1 v_ArrVal_1651)))) (store .cse61 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse61 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse60 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse60 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse59 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse59 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse58 (select .cse57 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse57 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse58 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)) (not (= (select .cse58 .cse1) 0)) (not (= (select .cse58 .cse2) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse63 (let ((.cse64 (let ((.cse65 (let ((.cse66 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse1 v_ArrVal_1651)))) (store .cse66 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse66 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse65 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse65 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse64 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse64 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse62 (select .cse63 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse62 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse63 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse62 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (select .cse62 .cse2) 0)))))))) is different from true [2022-12-13 19:04:30,530 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse16 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse8 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse7 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (and (forall ((v_ArrVal_1655 Int)) (let ((.cse3 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse8 v_ArrVal_1655)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select .cse0 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse10 (let ((.cse11 (let ((.cse12 (let ((.cse13 (let ((.cse14 (let ((.cse15 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse2 v_ArrVal_1646)))) (store .cse15 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16 0))))) (store .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_1651))))) (store .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse9 .cse2) 0)) (not (= (select .cse9 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse18 (let ((.cse19 (let ((.cse20 (let ((.cse21 (let ((.cse22 (let ((.cse23 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse2 v_ArrVal_1646)))) (store .cse23 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse23 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16 0))))) (store .cse22 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse22 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_1651))))) (store .cse21 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse21 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse20 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse20 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse19 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse19 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse17 (select .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse17 .cse2) 0)) (not (= (select .cse17 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= 0 (select (select (store .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4))))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse25 (let ((.cse26 (let ((.cse27 (let ((.cse28 (let ((.cse29 (let ((.cse30 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse2 v_ArrVal_1646)))) (store .cse30 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse30 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16 0))))) (store .cse29 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse29 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_1651))))) (store .cse28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse27 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse27 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse26 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse26 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse24 (select .cse25 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse24 .cse2) 0)) (not (= (select .cse24 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse25 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse24 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))))) (forall ((v_ArrVal_1655 Int)) (let ((.cse32 (let ((.cse33 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse8 v_ArrVal_1655)))) (store .cse33 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse33 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse31 .cse1) 0)) (not (= (select .cse31 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse32 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse31 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse35 (let ((.cse36 (let ((.cse37 (let ((.cse38 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse1 v_ArrVal_1651)))) (store .cse38 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse38 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse37 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse37 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse36 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse36 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse34 (select .cse35 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse34 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse35 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse34 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16) 0)) (not (= (select .cse34 .cse2) 0)))))) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse40 (let ((.cse41 (let ((.cse42 (let ((.cse43 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse1 v_ArrVal_1651)))) (store .cse43 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse43 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse42 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse42 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse41 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse41 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse39 (select .cse40 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse39 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= 0 (select (select (store .cse40 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse39 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4))) (not (= (select .cse39 .cse2) 0)))))) (forall ((v_ArrVal_1655 Int)) (let ((.cse45 (let ((.cse46 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse8 v_ArrVal_1655)))) (store .cse46 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse46 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse44 (select .cse45 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse44 .cse1) 0)) (not (= (select .cse44 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse45 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse44 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse48 (let ((.cse49 (let ((.cse50 (let ((.cse51 (let ((.cse52 (let ((.cse53 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse2 v_ArrVal_1646)))) (store .cse53 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse53 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16 0))))) (store .cse52 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse52 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_1651))))) (store .cse51 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse51 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse50 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse50 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse49 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse49 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse47 (select .cse48 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse47 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse48 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse47 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16) 0)) (not (= (select .cse47 .cse1) 0)))))) (forall ((v_ArrVal_1655 Int)) (let ((.cse55 (let ((.cse56 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse8 v_ArrVal_1655)))) (store .cse56 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse56 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse54 (select .cse55 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse54 .cse1) 0)) (not (= (select .cse54 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse55 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse54 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse57 (let ((.cse59 (let ((.cse60 (let ((.cse61 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse1 v_ArrVal_1651)))) (store .cse61 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse61 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse60 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse60 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse59 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse59 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse58 (select .cse57 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse57 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse58 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)) (not (= (select .cse58 .cse1) 0)) (not (= (select .cse58 .cse2) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse63 (let ((.cse64 (let ((.cse65 (let ((.cse66 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse1 v_ArrVal_1651)))) (store .cse66 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse66 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse65 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse65 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse64 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse64 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse62 (select .cse63 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse62 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse63 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse62 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (select .cse62 .cse2) 0)))))))) is different from true [2022-12-13 19:04:34,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:04:36,610 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse16 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse8 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse7 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (and (forall ((v_ArrVal_1655 Int)) (let ((.cse3 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse8 v_ArrVal_1655)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select .cse0 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse10 (let ((.cse11 (let ((.cse12 (let ((.cse13 (let ((.cse14 (let ((.cse15 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse2 v_ArrVal_1646)))) (store .cse15 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16 0))))) (store .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_1651))))) (store .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse9 .cse2) 0)) (not (= (select .cse9 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse18 (let ((.cse19 (let ((.cse20 (let ((.cse21 (let ((.cse22 (let ((.cse23 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse2 v_ArrVal_1646)))) (store .cse23 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse23 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16 0))))) (store .cse22 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse22 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_1651))))) (store .cse21 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse21 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse20 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse20 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse19 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse19 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse17 (select .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse17 .cse2) 0)) (not (= (select .cse17 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= 0 (select (select (store .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4))))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse25 (let ((.cse26 (let ((.cse27 (let ((.cse28 (let ((.cse29 (let ((.cse30 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse2 v_ArrVal_1646)))) (store .cse30 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse30 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16 0))))) (store .cse29 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse29 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_1651))))) (store .cse28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse27 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse27 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse26 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse26 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse24 (select .cse25 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse24 .cse2) 0)) (not (= (select .cse24 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse25 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse24 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))))) (forall ((v_ArrVal_1655 Int)) (let ((.cse32 (let ((.cse33 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse8 v_ArrVal_1655)))) (store .cse33 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse33 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse31 .cse1) 0)) (not (= (select .cse31 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse32 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse31 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))))) (forall ((v_ArrVal_1659 Int)) (= 0 (select (select (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4))) (forall ((v_ArrVal_1659 Int)) (= (select (select (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse35 (let ((.cse36 (let ((.cse37 (let ((.cse38 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse1 v_ArrVal_1651)))) (store .cse38 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse38 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse37 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse37 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse36 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse36 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse34 (select .cse35 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse34 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse35 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse34 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16) 0)) (not (= (select .cse34 .cse2) 0)))))) (forall ((v_ArrVal_1659 Int)) (= (select (select (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16) 0)) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse40 (let ((.cse41 (let ((.cse42 (let ((.cse43 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse1 v_ArrVal_1651)))) (store .cse43 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse43 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse42 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse42 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse41 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse41 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse39 (select .cse40 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse39 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= 0 (select (select (store .cse40 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse39 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4))) (not (= (select .cse39 .cse2) 0)))))) (forall ((v_ArrVal_1655 Int)) (let ((.cse45 (let ((.cse46 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse8 v_ArrVal_1655)))) (store .cse46 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse46 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse44 (select .cse45 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse44 .cse1) 0)) (not (= (select .cse44 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse45 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse44 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16) 0)))))) (forall ((v_ArrVal_1659 Int)) (= (select (select (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse48 (let ((.cse49 (let ((.cse50 (let ((.cse51 (let ((.cse52 (let ((.cse53 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse2 v_ArrVal_1646)))) (store .cse53 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse53 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16 0))))) (store .cse52 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse52 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_1651))))) (store .cse51 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse51 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse50 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse50 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse49 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse49 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse47 (select .cse48 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse47 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse48 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse47 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16) 0)) (not (= (select .cse47 .cse1) 0)))))) (forall ((v_ArrVal_1655 Int)) (let ((.cse55 (let ((.cse56 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse8 v_ArrVal_1655)))) (store .cse56 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse56 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse54 (select .cse55 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse54 .cse1) 0)) (not (= (select .cse54 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse55 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse54 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse57 (let ((.cse59 (let ((.cse60 (let ((.cse61 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse1 v_ArrVal_1651)))) (store .cse61 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse61 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse60 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse60 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse59 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse59 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse58 (select .cse57 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse57 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse58 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)) (not (= (select .cse58 .cse1) 0)) (not (= (select .cse58 .cse2) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse63 (let ((.cse64 (let ((.cse65 (let ((.cse66 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse1 v_ArrVal_1651)))) (store .cse66 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse66 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse65 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse65 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse64 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse64 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse62 (select .cse63 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse62 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse63 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse62 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (select .cse62 .cse2) 0)))))))) is different from true [2022-12-13 19:04:42,510 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 19:04:46,570 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 19:04:56,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:05:01,222 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 19:05:11,955 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 19:05:16,741 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 19:05:18,750 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 19:05:24,986 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 19:05:38,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:05:41,228 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse30 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (let ((.cse17 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse10 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse30 0)))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse16 (not (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (.cse22 (+ .cse17 |c_~#cache~0.offset|)) (.cse18 (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse8 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse15 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (and (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse0 (let ((.cse5 (let ((.cse7 (let ((.cse9 (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse11 .cse3 v_ArrVal_1651)))) (store .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2) 0)) (not (= (select .cse1 .cse3) 0)) (not (= (select .cse1 .cse4) 0)))))) (forall ((v_ArrVal_1655 Int)) (let ((.cse13 (let ((.cse14 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse15 .cse8 v_ArrVal_1655)))) (store .cse14 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse12 .cse3) 0)) (not (= (select .cse12 .cse4) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2) 0)))))) (or .cse16 (not (= (+ 3 .cse17 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (or .cse18 (not (= .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_1655 Int)) (let ((.cse20 (let ((.cse21 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse15 .cse8 v_ArrVal_1655)))) (store .cse21 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse21 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse19 (select .cse20 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse19 .cse3) 0)) (not (= (select .cse19 .cse4) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse20 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse19 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))))) (or (not (= .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) .cse18) (or .cse16 (not (= .cse22 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse23 (let ((.cse25 (let ((.cse26 (let ((.cse27 (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse11 .cse3 v_ArrVal_1651)))) (store .cse27 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse27 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse26 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse26 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse25 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse25 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse23 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse24 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (select .cse24 .cse3) 0)) (not (= (select .cse24 .cse4) 0)))))) (or (not (= (+ 2 .cse17 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) .cse16) (= |c_~#cache~0.base| 1) (or (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse4)) .cse18) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse28 (let ((.cse31 (let ((.cse32 (let ((.cse33 (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse11 .cse3 v_ArrVal_1651)))) (store .cse33 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse33 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse32 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse32 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse31 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse31 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse29 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse30) 0)) (not (= (select .cse29 .cse3) 0)) (not (= (select .cse29 .cse4) 0)))))) (< (+ 2 .cse17) (* |c_ULTIMATE.start_main_~i~2#1| 28)) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse35 (let ((.cse36 (let ((.cse37 (let ((.cse38 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse15 .cse3 v_ArrVal_1651)))) (store .cse38 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse38 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse37 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse37 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse36 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse36 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse34 (select .cse35 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse34 .cse3) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse35 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse34 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse30) 0)) (not (= (select .cse34 .cse4) 0)))))) (or (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse30)) .cse18) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (or .cse16 (not (= .cse8 .cse22))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse40 (let ((.cse41 (let ((.cse42 (let ((.cse43 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse15 .cse3 v_ArrVal_1651)))) (store .cse43 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse43 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse42 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse42 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse41 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse41 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse39 (select .cse40 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse39 .cse3) 0)) (forall ((v_ArrVal_1659 Int)) (= 0 (select (select (store .cse40 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse39 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2))) (not (= (select .cse39 .cse4) 0)))))) (forall ((v_ArrVal_1655 Int)) (let ((.cse45 (let ((.cse46 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse15 .cse8 v_ArrVal_1655)))) (store .cse46 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse46 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse44 (select .cse45 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse44 .cse3) 0)) (not (= (select .cse44 .cse4) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse45 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse44 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse30) 0)))))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse48 (let ((.cse49 (let ((.cse50 (let ((.cse51 (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse11 .cse3 v_ArrVal_1651)))) (store .cse51 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse51 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse50 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse50 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse49 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse49 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse47 (select .cse48 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse47 .cse3) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse48 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse47 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)) (not (= (select .cse47 .cse4) 0)))))) (forall ((v_ArrVal_1655 Int)) (let ((.cse53 (let ((.cse54 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse15 .cse8 v_ArrVal_1655)))) (store .cse54 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse54 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse52 (select .cse53 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse52 .cse3) 0)) (not (= (select .cse52 .cse4) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse53 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse52 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)))))) (or .cse18 (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse3))) (or (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) .cse18) (or .cse16 (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse17 |c_~#cache~0.offset| 1)))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse55 (let ((.cse57 (let ((.cse58 (let ((.cse59 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse15 .cse3 v_ArrVal_1651)))) (store .cse59 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse59 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse58 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse58 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse57 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse57 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse56 (select .cse55 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse55 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse56 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)) (not (= (select .cse56 .cse3) 0)) (not (= (select .cse56 .cse4) 0)))))) (or (not (= .cse22 .cse3)) .cse16) (or .cse16 (not (= .cse22 .cse4))) (or (not (= .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) .cse18) (or (not (= (select .cse15 .cse4) 0)) (not (= 0 (select .cse15 .cse3))) (and (forall ((v_ArrVal_1659 Int)) (= 0 (select (select (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2))) (forall ((v_ArrVal_1659 Int)) (= (select (select (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse30) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse61 (let ((.cse62 (let ((.cse63 (let ((.cse64 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse15 .cse3 v_ArrVal_1651)))) (store .cse64 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse64 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse63 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse63 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse62 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse62 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse60 (select .cse61 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse60 .cse3) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse61 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse60 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (select .cse60 .cse4) 0)))))))))) is different from true [2022-12-13 19:05:44,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:05:46,698 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse38 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse59 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse17 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse25 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse59 .cse2 0))) (.cse10 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse59 .cse38 0)))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse15 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse26 (select .cse25 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse8 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse16 (not (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (.cse30 (+ .cse17 |c_~#cache~0.offset|)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse18 (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)))) (and (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse0 (let ((.cse5 (let ((.cse7 (let ((.cse9 (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse11 .cse3 v_ArrVal_1651)))) (store .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2) 0)) (not (= (select .cse1 .cse3) 0)) (not (= (select .cse1 .cse4) 0)))))) (forall ((v_ArrVal_1655 Int)) (let ((.cse13 (let ((.cse14 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse15 .cse8 v_ArrVal_1655)))) (store .cse14 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse12 .cse3) 0)) (not (= (select .cse12 .cse4) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2) 0)))))) (or .cse16 (not (= (+ 3 .cse17 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (or .cse18 (not (= .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_1655 Int)) (let ((.cse20 (let ((.cse21 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse15 .cse8 v_ArrVal_1655)))) (store .cse21 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse21 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse19 (select .cse20 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse19 .cse3) 0)) (not (= (select .cse19 .cse4) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse20 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse19 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))))) (or (not (= .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) .cse18) (forall ((v_ArrVal_1655 Int)) (let ((.cse23 (let ((.cse24 (store .cse25 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse26 .cse8 v_ArrVal_1655)))) (store .cse24 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse24 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse22 .cse4) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse23 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse22 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (select .cse22 .cse3) 0)))))) (forall ((v_ArrVal_1655 Int)) (let ((.cse27 (let ((.cse29 (store .cse25 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse26 .cse8 v_ArrVal_1655)))) (store .cse29 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse29 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse27 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)) (not (= (select .cse28 .cse4) 0)) (not (= (select .cse28 .cse3) 0)))))) (or .cse16 (not (= .cse30 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse31 (let ((.cse33 (let ((.cse34 (let ((.cse35 (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse11 .cse3 v_ArrVal_1651)))) (store .cse35 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse35 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse34 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse34 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse33 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse33 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse31 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse32 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (select .cse32 .cse3) 0)) (not (= (select .cse32 .cse4) 0)))))) (or (not (= (+ 2 .cse17 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) .cse16) (= |c_~#cache~0.base| 1) (or (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse4)) .cse18) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse36 (let ((.cse39 (let ((.cse40 (let ((.cse41 (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse11 .cse3 v_ArrVal_1651)))) (store .cse41 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse41 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse40 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse40 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse39 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse39 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse36 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse37 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse38) 0)) (not (= (select .cse37 .cse3) 0)) (not (= (select .cse37 .cse4) 0)))))) (< (+ 2 .cse17) (* |c_ULTIMATE.start_main_~i~2#1| 28)) (or (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse38)) .cse18) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (or .cse16 (not (= .cse8 .cse30))) (forall ((v_ArrVal_1655 Int)) (let ((.cse43 (let ((.cse44 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse15 .cse8 v_ArrVal_1655)))) (store .cse44 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse44 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse42 (select .cse43 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse42 .cse3) 0)) (not (= (select .cse42 .cse4) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse43 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse42 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse38) 0)))))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse46 (let ((.cse47 (let ((.cse48 (let ((.cse49 (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse11 .cse3 v_ArrVal_1651)))) (store .cse49 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse49 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse48 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse48 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse47 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse47 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse45 (select .cse46 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse45 .cse3) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse46 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse45 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)) (not (= (select .cse45 .cse4) 0)))))) (forall ((v_ArrVal_1655 Int)) (let ((.cse51 (let ((.cse52 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse15 .cse8 v_ArrVal_1655)))) (store .cse52 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse52 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse50 (select .cse51 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse50 .cse3) 0)) (not (= (select .cse50 .cse4) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse51 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse50 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)))))) (or .cse18 (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse3))) (or (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) .cse18) (forall ((v_ArrVal_1655 Int)) (let ((.cse54 (let ((.cse55 (store .cse25 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse26 .cse8 v_ArrVal_1655)))) (store .cse55 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse55 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse53 (select .cse54 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse53 .cse4) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse54 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse53 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse38) 0)) (not (= (select .cse53 .cse3) 0)))))) (forall ((v_ArrVal_1655 Int)) (let ((.cse57 (let ((.cse58 (store .cse25 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse26 .cse8 v_ArrVal_1655)))) (store .cse58 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse58 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse56 (select .cse57 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse56 .cse4) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse57 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse56 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2) 0)) (not (= (select .cse56 .cse3) 0)))))) (or .cse16 (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse17 |c_~#cache~0.offset| 1)))) (or (not (= .cse30 .cse3)) .cse16) (or .cse16 (not (= .cse30 .cse4))) (or (not (= .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) .cse18))))) is different from true [2022-12-13 19:05:48,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:05:52,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:06:05,346 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 19:06:07,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:06:09,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:06:10,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:06:16,641 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 19:06:18,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:06:21,173 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 19:06:23,196 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 19:06:25,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:06:28,576 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse18 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse16 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse17 (not (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (.cse36 (+ .cse18 |c_~#cache~0.offset|)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse8 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse7 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (and (forall ((v_ArrVal_1655 Int)) (let ((.cse3 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse8 v_ArrVal_1655)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select .cse0 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse10 (let ((.cse11 (let ((.cse12 (let ((.cse13 (let ((.cse14 (let ((.cse15 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse2 v_ArrVal_1646)))) (store .cse15 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16 0))))) (store .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_1651))))) (store .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse9 .cse2) 0)) (not (= (select .cse9 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)))))) (or .cse17 (not (= (+ 3 .cse18 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse20 (let ((.cse21 (let ((.cse22 (let ((.cse23 (let ((.cse24 (let ((.cse25 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse2 v_ArrVal_1646)))) (store .cse25 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse25 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16 0))))) (store .cse24 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse24 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_1651))))) (store .cse23 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse23 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse22 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse22 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse21 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse21 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse19 (select .cse20 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse19 .cse2) 0)) (not (= (select .cse19 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= 0 (select (select (store .cse20 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse19 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4))))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse27 (let ((.cse28 (let ((.cse29 (let ((.cse30 (let ((.cse31 (let ((.cse32 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse2 v_ArrVal_1646)))) (store .cse32 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse32 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16 0))))) (store .cse31 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse31 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_1651))))) (store .cse30 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse30 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse29 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse29 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse26 (select .cse27 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse26 .cse2) 0)) (not (= (select .cse26 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse27 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse26 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))))) (forall ((v_ArrVal_1655 Int)) (let ((.cse34 (let ((.cse35 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse8 v_ArrVal_1655)))) (store .cse35 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse35 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse33 (select .cse34 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse33 .cse1) 0)) (not (= (select .cse33 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse34 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse33 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))))) (or .cse17 (not (= .cse36 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (or (not (= (+ 2 .cse18 |c_~#cache~0.offset|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) .cse17) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1659 Int)) (= 0 (select (select (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4))) (< (+ 2 .cse18) (* |c_ULTIMATE.start_main_~i~2#1| 28)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse38 (let ((.cse39 (let ((.cse40 (let ((.cse41 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse1 v_ArrVal_1651)))) (store .cse41 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse41 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse40 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse40 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse39 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse39 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse37 (select .cse38 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse37 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse38 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse37 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16) 0)) (not (= (select .cse37 .cse2) 0)))))) (forall ((v_ArrVal_1659 Int)) (= (select (select (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16) 0)) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (or .cse17 (not (= .cse8 .cse36))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse43 (let ((.cse44 (let ((.cse45 (let ((.cse46 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse1 v_ArrVal_1651)))) (store .cse46 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse46 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse45 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse45 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse44 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse44 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse42 (select .cse43 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse42 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= 0 (select (select (store .cse43 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse42 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4))) (not (= (select .cse42 .cse2) 0)))))) (forall ((v_ArrVal_1655 Int)) (let ((.cse48 (let ((.cse49 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse8 v_ArrVal_1655)))) (store .cse49 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse49 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse47 (select .cse48 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse47 .cse1) 0)) (not (= (select .cse47 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse48 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse47 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16) 0)))))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1659 Int)) (= (select (select (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1646 Int)) (let ((.cse51 (let ((.cse52 (let ((.cse53 (let ((.cse54 (let ((.cse55 (let ((.cse56 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse2 v_ArrVal_1646)))) (store .cse56 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse56 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16 0))))) (store .cse55 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse55 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_1651))))) (store .cse54 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse54 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse53 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse53 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse52 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse52 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse50 (select .cse51 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse50 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse51 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse50 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse16) 0)) (not (= (select .cse50 .cse1) 0)))))) (forall ((v_ArrVal_1655 Int)) (let ((.cse58 (let ((.cse59 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse8 v_ArrVal_1655)))) (store .cse59 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse59 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse57 (select .cse58 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse57 .cse1) 0)) (not (= (select .cse57 .cse2) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse58 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse57 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)))))) (or .cse17 (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse18 |c_~#cache~0.offset| 1)))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse60 (let ((.cse62 (let ((.cse63 (let ((.cse64 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse1 v_ArrVal_1651)))) (store .cse64 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse64 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse63 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse63 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse62 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse62 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse61 (select .cse60 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse60 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse61 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)) (not (= (select .cse61 .cse1) 0)) (not (= (select .cse61 .cse2) 0)))))) (or (not (= .cse36 .cse1)) .cse17) (or .cse17 (not (= .cse36 .cse2))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1655 Int)) (let ((.cse66 (let ((.cse67 (let ((.cse68 (let ((.cse69 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse7 .cse1 v_ArrVal_1651)))) (store .cse69 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse69 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse68 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse68 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_1655))))) (store .cse67 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse67 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse65 (select .cse66 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (or (not (= (select .cse65 .cse1) 0)) (forall ((v_ArrVal_1659 Int)) (= (select (select (store .cse66 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse65 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1659)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (select .cse65 .cse2) 0))))))))) is different from true [2022-12-13 19:06:37,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:06:45,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 19:06:47,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]