./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/config/GemCutterMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d59c014df9ead169c56b7ae39b852ef0f17fdf8c183ee9a03f7bf209d03f772f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 20:46:28,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 20:46:28,638 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf [2023-12-02 20:46:28,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 20:46:28,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 20:46:28,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 20:46:28,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 20:46:28,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 20:46:28,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 20:46:28,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 20:46:28,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 20:46:28,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 20:46:28,672 INFO L153 SettingsManager]: * Use SBE=true [2023-12-02 20:46:28,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 20:46:28,673 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 20:46:28,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 20:46:28,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 20:46:28,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 20:46:28,675 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 20:46:28,675 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 20:46:28,676 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 20:46:28,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 20:46:28,677 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 20:46:28,677 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 20:46:28,678 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 20:46:28,678 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 20:46:28,679 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 20:46:28,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 20:46:28,679 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 20:46:28,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 20:46:28,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:46:28,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 20:46:28,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 20:46:28,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-02 20:46:28,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 20:46:28,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 20:46:28,683 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-12-02 20:46:28,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-12-02 20:46:28,683 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-12-02 20:46:28,684 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-12-02 20:46:28,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/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_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d59c014df9ead169c56b7ae39b852ef0f17fdf8c183ee9a03f7bf209d03f772f [2023-12-02 20:46:28,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 20:46:28,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 20:46:28,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 20:46:28,909 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 20:46:28,909 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 20:46:28,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/../../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i [2023-12-02 20:46:31,666 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 20:46:31,878 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 20:46:31,879 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i [2023-12-02 20:46:31,893 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/data/685aac874/8a0aa64bb7494b368d82f42f5c400b5a/FLAG2c3bf6bf4 [2023-12-02 20:46:31,906 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/data/685aac874/8a0aa64bb7494b368d82f42f5c400b5a [2023-12-02 20:46:31,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 20:46:31,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 20:46:31,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 20:46:31,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 20:46:31,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 20:46:31,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:46:31" (1/1) ... [2023-12-02 20:46:31,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1681ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:31, skipping insertion in model container [2023-12-02 20:46:31,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:46:31" (1/1) ... [2023-12-02 20:46:31,962 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 20:46:32,240 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:46:32,255 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 20:46:32,303 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:46:32,344 INFO L206 MainTranslator]: Completed translation [2023-12-02 20:46:32,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:32 WrapperNode [2023-12-02 20:46:32,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 20:46:32,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 20:46:32,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 20:46:32,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 20:46:32,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:32" (1/1) ... [2023-12-02 20:46:32,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:32" (1/1) ... [2023-12-02 20:46:32,392 INFO L138 Inliner]: procedures = 165, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 91 [2023-12-02 20:46:32,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 20:46:32,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 20:46:32,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 20:46:32,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 20:46:32,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:32" (1/1) ... [2023-12-02 20:46:32,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:32" (1/1) ... [2023-12-02 20:46:32,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:32" (1/1) ... [2023-12-02 20:46:32,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:32" (1/1) ... [2023-12-02 20:46:32,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:32" (1/1) ... [2023-12-02 20:46:32,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:32" (1/1) ... [2023-12-02 20:46:32,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:32" (1/1) ... [2023-12-02 20:46:32,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:32" (1/1) ... [2023-12-02 20:46:32,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 20:46:32,426 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 20:46:32,426 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 20:46:32,427 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 20:46:32,427 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:32" (1/1) ... [2023-12-02 20:46:32,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:46:32,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:46:32,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 20:46:32,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 20:46:32,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 20:46:32,488 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-02 20:46:32,488 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-02 20:46:32,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 20:46:32,488 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-02 20:46:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 20:46:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 20:46:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 20:46:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 20:46:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-02 20:46:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 20:46:32,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 20:46:32,491 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 20:46:32,619 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 20:46:32,621 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 20:46:32,844 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 20:46:32,990 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 20:46:32,990 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 20:46:32,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:46:32 BoogieIcfgContainer [2023-12-02 20:46:32,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 20:46:32,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 20:46:32,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 20:46:32,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 20:46:32,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:46:31" (1/3) ... [2023-12-02 20:46:32,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f88238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:46:32, skipping insertion in model container [2023-12-02 20:46:32,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:46:32" (2/3) ... [2023-12-02 20:46:32,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f88238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:46:32, skipping insertion in model container [2023-12-02 20:46:32,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:46:32" (3/3) ... [2023-12-02 20:46:33,000 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur-pthread.i [2023-12-02 20:46:33,019 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 20:46:33,020 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-12-02 20:46:33,020 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 20:46:33,073 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 20:46:33,117 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:46:33,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:46:33,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:46:33,123 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:46:33,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-12-02 20:46:33,168 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:46:33,181 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2023-12-02 20:46:33,187 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=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@648a7552, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:46:33,188 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-12-02 20:46:33,393 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:46:33,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:33,399 INFO L85 PathProgramCache]: Analyzing trace with hash 711052001, now seen corresponding path program 1 times [2023-12-02 20:46:33,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:33,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3354629] [2023-12-02 20:46:33,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:33,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:33,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:33,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:33,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3354629] [2023-12-02 20:46:33,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3354629] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:46:33,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:46:33,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 20:46:33,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178715313] [2023-12-02 20:46:33,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:46:33,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:46:33,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:33,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:46:33,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:46:33,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:33,672 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:33,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2023-12-02 20:46:33,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:33,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:33,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 20:46:33,732 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:46:33,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:33,740 INFO L85 PathProgramCache]: Analyzing trace with hash 711052003, now seen corresponding path program 1 times [2023-12-02 20:46:33,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:33,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442122170] [2023-12-02 20:46:33,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:33,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:33,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:33,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:33,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442122170] [2023-12-02 20:46:33,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442122170] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:46:33,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:46:33,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:46:33,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143947928] [2023-12-02 20:46:33,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:46:33,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:46:33,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:33,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:46:33,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:46:33,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:33,855 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:33,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-12-02 20:46:33,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:33,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:33,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:33,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:33,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 20:46:33,937 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:46:33,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:33,938 INFO L85 PathProgramCache]: Analyzing trace with hash 711052004, now seen corresponding path program 1 times [2023-12-02 20:46:33,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:33,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573641291] [2023-12-02 20:46:33,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:33,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:34,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:34,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573641291] [2023-12-02 20:46:34,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573641291] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:46:34,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:46:34,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:46:34,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640387400] [2023-12-02 20:46:34,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:46:34,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:46:34,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:34,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:46:34,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:46:34,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:34,057 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:34,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-12-02 20:46:34,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:34,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:34,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:34,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:34,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:34,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:34,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 20:46:34,171 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:46:34,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:34,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1033714636, now seen corresponding path program 1 times [2023-12-02 20:46:34,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:34,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191836799] [2023-12-02 20:46:34,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:34,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:34,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:34,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:34,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191836799] [2023-12-02 20:46:34,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191836799] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:46:34,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:46:34,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 20:46:34,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907727763] [2023-12-02 20:46:34,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:46:34,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 20:46:34,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:34,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 20:46:34,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 20:46:34,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:34,344 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:34,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2023-12-02 20:46:34,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:34,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:34,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:34,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:34,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:34,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:34,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:34,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:34,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 20:46:34,520 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err11ASSERT_VIOLATIONARRAY_INDEX === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:46:34,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:34,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1919653877, now seen corresponding path program 1 times [2023-12-02 20:46:34,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:34,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018693372] [2023-12-02 20:46:34,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:34,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:34,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:34,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018693372] [2023-12-02 20:46:34,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018693372] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:46:34,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:46:34,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 20:46:34,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62870044] [2023-12-02 20:46:34,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:46:34,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:46:34,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:34,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:46:34,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:46:34,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:34,702 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:34,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2023-12-02 20:46:34,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:34,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:34,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:34,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:34,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:34,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:34,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:34,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:34,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:34,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:34,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 20:46:34,990 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:46:34,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:34,990 INFO L85 PathProgramCache]: Analyzing trace with hash 870085727, now seen corresponding path program 1 times [2023-12-02 20:46:34,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:34,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951234368] [2023-12-02 20:46:34,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:34,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:35,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:35,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:35,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951234368] [2023-12-02 20:46:35,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951234368] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:46:35,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:46:35,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 20:46:35,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002071552] [2023-12-02 20:46:35,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:46:35,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:46:35,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:35,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:46:35,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:46:35,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:35,240 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:35,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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) [2023-12-02 20:46:35,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:35,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:35,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:35,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:35,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:35,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:35,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:35,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:35,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:35,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:35,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:35,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:35,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 20:46:35,388 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:46:35,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:35,389 INFO L85 PathProgramCache]: Analyzing trace with hash 337018515, now seen corresponding path program 1 times [2023-12-02 20:46:35,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:35,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696774516] [2023-12-02 20:46:35,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:35,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:35,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:35,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:35,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696774516] [2023-12-02 20:46:35,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696774516] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:46:35,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:46:35,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:46:35,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144799160] [2023-12-02 20:46:35,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:46:35,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 20:46:35,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:35,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 20:46:35,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 20:46:35,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:35,466 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:35,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) [2023-12-02 20:46:35,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:35,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:35,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:35,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:35,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:35,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:35,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:35,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:35,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:35,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:35,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:35,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:35,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:35,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:35,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 20:46:35,680 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:46:35,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:35,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1266407864, now seen corresponding path program 1 times [2023-12-02 20:46:35,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:35,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640624878] [2023-12-02 20:46:35,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:35,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:35,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:35,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:35,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640624878] [2023-12-02 20:46:35,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640624878] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:46:35,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976813346] [2023-12-02 20:46:35,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:35,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:46:35,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:46:36,019 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:46:36,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 20:46:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:36,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 20:46:36,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:46:36,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:46:36,203 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:46:36,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:46:36,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:46:36,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-12-02 20:46:36,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:46:36,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:46:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:36,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:46:36,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:36,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 84 [2023-12-02 20:46:36,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2023-12-02 20:46:36,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2023-12-02 20:46:36,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:36,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 20:46:36,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2023-12-02 20:46:36,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 20:46:36,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-02 20:46:36,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2023-12-02 20:46:36,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 20:46:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:36,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976813346] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:46:36,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:46:36,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 15 [2023-12-02 20:46:36,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996995889] [2023-12-02 20:46:36,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:46:36,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 20:46:36,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:36,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 20:46:36,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=191, Unknown=2, NotChecked=0, Total=240 [2023-12-02 20:46:36,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:36,802 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:36,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 15 states have internal predecessors, (67), 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) [2023-12-02 20:46:36,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:36,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:36,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:36,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:36,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:36,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:36,804 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:36,804 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:37,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:37,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:37,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:37,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:37,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:37,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:37,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:37,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:46:37,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 20:46:37,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:46:37,353 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err11ASSERT_VIOLATIONARRAY_INDEX === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:46:37,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:37,354 INFO L85 PathProgramCache]: Analyzing trace with hash 871891614, now seen corresponding path program 1 times [2023-12-02 20:46:37,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:37,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739083861] [2023-12-02 20:46:37,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:37,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:37,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:37,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739083861] [2023-12-02 20:46:37,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739083861] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:46:37,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155333517] [2023-12-02 20:46:37,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:37,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:46:37,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:46:37,591 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:46:37,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 20:46:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:37,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 20:46:37,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:46:37,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:46:37,726 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:46:37,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:46:37,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:46:37,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-12-02 20:46:37,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:46:37,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:46:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:37,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:46:37,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:37,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 84 [2023-12-02 20:46:37,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2023-12-02 20:46:38,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2023-12-02 20:46:38,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:38,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 20:46:38,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2023-12-02 20:46:38,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-12-02 20:46:38,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-12-02 20:46:38,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2023-12-02 20:46:38,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2023-12-02 20:46:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:38,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155333517] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:46:38,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:46:38,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 15 [2023-12-02 20:46:38,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058782199] [2023-12-02 20:46:38,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:46:38,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 20:46:38,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:38,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 20:46:38,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=219, Unknown=1, NotChecked=0, Total=272 [2023-12-02 20:46:38,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:38,251 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:38,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:46:38,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:38,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:38,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:38,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:38,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:38,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:38,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:38,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:46:38,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:38,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:38,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:38,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:38,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:38,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:38,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:38,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:38,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:46:38,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:38,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 20:46:38,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-12-02 20:46:38,805 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:46:38,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:38,805 INFO L85 PathProgramCache]: Analyzing trace with hash 441495843, now seen corresponding path program 1 times [2023-12-02 20:46:38,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:38,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481579229] [2023-12-02 20:46:38,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:38,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:39,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:39,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481579229] [2023-12-02 20:46:39,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481579229] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:46:39,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124341426] [2023-12-02 20:46:39,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:39,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:46:39,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:46:39,038 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:46:39,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 20:46:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:39,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 20:46:39,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:46:39,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:46:39,155 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:46:39,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:46:39,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-12-02 20:46:39,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:46:39,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:46:39,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:46:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:46:39,236 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:46:39,267 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_198 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_198) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 4294967296) 65)) is different from false [2023-12-02 20:46:39,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:39,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 84 [2023-12-02 20:46:39,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2023-12-02 20:46:39,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2023-12-02 20:46:39,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:39,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 20:46:39,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2023-12-02 20:46:39,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-02 20:46:39,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-02 20:46:39,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2023-12-02 20:46:39,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-12-02 20:46:39,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 20:46:39,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124341426] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:46:39,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:46:39,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 15 [2023-12-02 20:46:39,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849693183] [2023-12-02 20:46:39,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:46:39,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 20:46:39,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:39,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 20:46:39,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=193, Unknown=1, NotChecked=28, Total=272 [2023-12-02 20:46:39,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:39,561 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:39,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:46:39,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:39,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:39,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:39,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:39,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:39,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:39,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:39,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:46:39,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:39,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:39,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:46:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:46:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:39,950 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2023-12-02 20:46:39,950 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2023-12-02 20:46:39,951 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-12-02 20:46:39,951 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-12-02 20:46:39,951 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-12-02 20:46:39,951 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-12-02 20:46:39,951 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-12-02 20:46:39,951 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-12-02 20:46:39,951 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (6 of 15 remaining) [2023-12-02 20:46:39,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-12-02 20:46:39,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2023-12-02 20:46:39,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (3 of 15 remaining) [2023-12-02 20:46:39,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err14ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2023-12-02 20:46:39,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2023-12-02 20:46:39,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2023-12-02 20:46:39,957 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 20:46:40,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 20:46:40,165 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:46:40,167 INFO L307 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-12-02 20:46:40,170 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:46:40,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:46:40,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:46:40,172 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:46:40,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2023-12-02 20:46:40,179 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:46:40,179 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-12-02 20:46:40,180 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=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@648a7552, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:46:40,180 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-02 20:46:40,259 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 1 more)] === [2023-12-02 20:46:40,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:40,260 INFO L85 PathProgramCache]: Analyzing trace with hash 567016496, now seen corresponding path program 1 times [2023-12-02 20:46:40,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:40,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554959582] [2023-12-02 20:46:40,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:40,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 20:46:40,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 20:46:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 20:46:40,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-02 20:46:40,286 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 20:46:40,286 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-12-02 20:46:40,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 4 remaining) [2023-12-02 20:46:40,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 4 remaining) [2023-12-02 20:46:40,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2023-12-02 20:46:40,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 20:46:40,288 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-12-02 20:46:40,288 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-12-02 20:46:40,289 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-02 20:46:40,289 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-02 20:46:40,317 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 20:46:40,320 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:46:40,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:46:40,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:46:40,329 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:46:40,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2023-12-02 20:46:40,332 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:46:40,332 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-12-02 20:46:40,333 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=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@648a7552, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:46:40,333 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-02 20:46:40,445 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 1 more)] === [2023-12-02 20:46:40,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:40,445 INFO L85 PathProgramCache]: Analyzing trace with hash -826450871, now seen corresponding path program 1 times [2023-12-02 20:46:40,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:40,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125934397] [2023-12-02 20:46:40,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:40,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 20:46:40,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 20:46:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 20:46:40,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-02 20:46:40,467 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 20:46:40,467 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-12-02 20:46:40,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 4 remaining) [2023-12-02 20:46:40,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 4 remaining) [2023-12-02 20:46:40,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2023-12-02 20:46:40,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 20:46:40,469 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-12-02 20:46:40,469 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/3) [2023-12-02 20:46:40,470 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-02 20:46:40,470 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-02 20:46:40,525 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 20:46:40,529 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:46:40,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:46:40,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:46:40,530 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:46:40,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2023-12-02 20:46:40,541 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:46:40,541 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2023-12-02 20:46:40,542 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=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@648a7552, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:46:40,542 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-12-02 20:46:40,764 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:46:40,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:40,765 INFO L85 PathProgramCache]: Analyzing trace with hash 994107796, now seen corresponding path program 1 times [2023-12-02 20:46:40,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:40,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106887038] [2023-12-02 20:46:40,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:40,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:46:40,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:40,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106887038] [2023-12-02 20:46:40,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106887038] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:46:40,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:46:40,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 20:46:40,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693682231] [2023-12-02 20:46:40,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:46:40,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:46:40,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:40,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:46:40,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:46:40,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:40,801 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:40,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2023-12-02 20:46:40,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:40,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:40,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 20:46:40,876 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:46:40,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:40,876 INFO L85 PathProgramCache]: Analyzing trace with hash 994107798, now seen corresponding path program 1 times [2023-12-02 20:46:40,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:40,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30232171] [2023-12-02 20:46:40,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:40,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:46:40,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:40,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30232171] [2023-12-02 20:46:40,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30232171] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:46:40,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:46:40,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:46:40,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093515285] [2023-12-02 20:46:40,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:46:40,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:46:40,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:40,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:46:40,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:46:40,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:40,929 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:40,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-12-02 20:46:40,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:40,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:41,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:41,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:41,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 20:46:41,077 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:46:41,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:41,077 INFO L85 PathProgramCache]: Analyzing trace with hash 994107799, now seen corresponding path program 1 times [2023-12-02 20:46:41,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:41,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578319209] [2023-12-02 20:46:41,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:41,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:41,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:46:41,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:41,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578319209] [2023-12-02 20:46:41,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578319209] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:46:41,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:46:41,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:46:41,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405768814] [2023-12-02 20:46:41,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:46:41,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:46:41,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:41,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:46:41,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:46:41,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:41,182 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:41,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-12-02 20:46:41,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:41,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:41,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:41,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:41,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:41,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:41,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 20:46:41,358 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:46:41,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:41,358 INFO L85 PathProgramCache]: Analyzing trace with hash 131011199, now seen corresponding path program 1 times [2023-12-02 20:46:41,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:41,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063339548] [2023-12-02 20:46:41,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:41,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:41,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:46:41,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:41,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063339548] [2023-12-02 20:46:41,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063339548] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:46:41,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:46:41,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 20:46:41,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351666342] [2023-12-02 20:46:41,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:46:41,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 20:46:41,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:41,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 20:46:41,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 20:46:41,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:41,472 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:41,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2023-12-02 20:46:41,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:41,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:41,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:41,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:41,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:41,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:41,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:41,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:41,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 20:46:41,707 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err11ASSERT_VIOLATIONARRAY_INDEX === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:46:41,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:41,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1903153496, now seen corresponding path program 1 times [2023-12-02 20:46:41,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:41,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227061526] [2023-12-02 20:46:41,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:41,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:41,895 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:46:41,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:41,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227061526] [2023-12-02 20:46:41,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227061526] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:46:41,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:46:41,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 20:46:41,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759423962] [2023-12-02 20:46:41,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:46:41,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:46:41,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:41,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:46:41,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:46:41,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:41,897 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:41,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-12-02 20:46:41,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:41,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:41,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:41,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:41,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:42,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:42,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:42,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:42,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:42,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:42,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-02 20:46:42,210 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:46:42,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:42,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1715541522, now seen corresponding path program 1 times [2023-12-02 20:46:42,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:42,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995200426] [2023-12-02 20:46:42,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:42,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:46:42,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:42,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995200426] [2023-12-02 20:46:42,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995200426] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:46:42,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:46:42,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 20:46:42,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420800820] [2023-12-02 20:46:42,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:46:42,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:46:42,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:42,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:46:42,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:46:42,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:42,407 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:42,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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) [2023-12-02 20:46:42,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:42,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:42,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:42,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:42,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:42,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:43,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:43,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:43,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:43,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-02 20:46:43,842 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:46:43,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:43,843 INFO L85 PathProgramCache]: Analyzing trace with hash 124731462, now seen corresponding path program 1 times [2023-12-02 20:46:43,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:43,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220379757] [2023-12-02 20:46:43,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:43,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:46:43,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:43,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220379757] [2023-12-02 20:46:43,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220379757] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:46:43,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:46:43,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:46:43,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804056272] [2023-12-02 20:46:43,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:46:43,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 20:46:43,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:43,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 20:46:43,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 20:46:43,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:43,926 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:43,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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) [2023-12-02 20:46:43,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:43,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:43,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:43,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:43,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:43,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:43,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:45,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:45,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:45,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:45,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:45,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:45,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:45,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:45,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-02 20:46:45,033 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:46:45,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:45,033 INFO L85 PathProgramCache]: Analyzing trace with hash 2057610649, now seen corresponding path program 1 times [2023-12-02 20:46:45,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:45,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501220193] [2023-12-02 20:46:45,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:45,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:45,140 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:46:45,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:45,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501220193] [2023-12-02 20:46:45,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501220193] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:46:45,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616245251] [2023-12-02 20:46:45,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:45,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:46:45,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:46:45,144 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:46:45,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 20:46:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:45,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 20:46:45,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:46:45,355 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:46:45,355 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:46:45,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:45,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 81 [2023-12-02 20:46:45,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2023-12-02 20:46:45,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2023-12-02 20:46:45,488 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:46:45,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616245251] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:46:45,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:46:45,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-12-02 20:46:45,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765771668] [2023-12-02 20:46:45,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:46:45,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 20:46:45,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:45,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 20:46:45,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-02 20:46:45,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:45,490 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:45,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:46:45,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:45,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:45,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:45,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:45,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:45,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:45,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:45,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:46,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:46,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:46,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:46,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:46,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:46,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:46,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:46,083 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 20:46:46,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:46:46,278 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:46:46,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:46,278 INFO L85 PathProgramCache]: Analyzing trace with hash 368666907, now seen corresponding path program 1 times [2023-12-02 20:46:46,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:46,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086596959] [2023-12-02 20:46:46,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:46,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-02 20:46:46,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:46,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086596959] [2023-12-02 20:46:46,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086596959] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:46:46,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:46:46,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:46:46,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144134417] [2023-12-02 20:46:46,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:46:46,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 20:46:46,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:46,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 20:46:46,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 20:46:46,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:46,382 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:46,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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) [2023-12-02 20:46:46,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:46,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:46,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:46,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:46,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:46,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:46,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:46,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:46,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:47,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:47,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-02 20:46:47,626 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:46:47,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:47,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1025251337, now seen corresponding path program 1 times [2023-12-02 20:46:47,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:47,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785941449] [2023-12-02 20:46:47,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:47,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-02 20:46:47,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:47,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785941449] [2023-12-02 20:46:47,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785941449] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:46:47,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:46:47,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:46:47,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646006466] [2023-12-02 20:46:47,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:46:47,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 20:46:47,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:47,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 20:46:47,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 20:46:47,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:47,700 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:47,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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) [2023-12-02 20:46:47,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:47,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:47,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:47,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:47,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:47,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:47,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:47,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:47,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:47,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:48,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:48,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:48,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:48,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:48,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:48,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:48,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:48,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:48,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:48,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:48,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-02 20:46:48,865 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:46:48,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:48,865 INFO L85 PathProgramCache]: Analyzing trace with hash 822591711, now seen corresponding path program 1 times [2023-12-02 20:46:48,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:48,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189038748] [2023-12-02 20:46:48,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:48,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:49,225 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:46:49,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:49,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189038748] [2023-12-02 20:46:49,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189038748] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:46:49,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729385830] [2023-12-02 20:46:49,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:49,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:46:49,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:46:49,226 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:46:49,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 20:46:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:49,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 20:46:49,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:46:49,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 20:46:49,462 INFO L378 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 [2023-12-02 20:46:49,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-02 20:46:49,565 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:46:49,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:46:49,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:46:49,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:46:49,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:46:49,652 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:46:49,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:46:49,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2023-12-02 20:46:49,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2023-12-02 20:46:49,742 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_DerPreprocessor_1 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_2 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_2) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))))) is different from false [2023-12-02 20:46:49,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:49,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 84 [2023-12-02 20:46:49,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2023-12-02 20:46:50,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:50,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 20:46:50,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 72 [2023-12-02 20:46:50,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-12-02 20:46:50,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 20:46:50,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2023-12-02 20:46:50,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 20:46:50,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:50,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 81 [2023-12-02 20:46:50,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2023-12-02 20:46:50,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2023-12-02 20:46:50,329 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:46:50,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729385830] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:46:50,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:46:50,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 8] total 21 [2023-12-02 20:46:50,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233727782] [2023-12-02 20:46:50,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:46:50,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 20:46:50,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:50,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 20:46:50,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=343, Unknown=1, NotChecked=38, Total=462 [2023-12-02 20:46:50,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:50,332 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:50,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.590909090909091) internal successors, (123), 21 states have internal predecessors, (123), 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) [2023-12-02 20:46:50,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:50,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:50,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:50,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:50,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:50,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:50,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:50,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:50,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:50,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:50,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:53,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-02 20:46:53,139 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 20:46:53,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:46:53,333 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:46:53,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:53,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1142331840, now seen corresponding path program 1 times [2023-12-02 20:46:53,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:53,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840943253] [2023-12-02 20:46:53,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:53,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:53,654 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:46:53,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:53,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840943253] [2023-12-02 20:46:53,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840943253] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:46:53,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106658664] [2023-12-02 20:46:53,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:53,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:46:53,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:46:53,656 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:46:53,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 20:46:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:53,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 20:46:53,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:46:53,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:46:53,885 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:46:53,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:46:53,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:46:53,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:46:53,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 20:46:53,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:46:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:46:54,040 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:46:54,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:54,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 84 [2023-12-02 20:46:54,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:54,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 110 [2023-12-02 20:46:54,288 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 20:46:54,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 94 [2023-12-02 20:46:54,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:54,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 20:46:54,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 137 [2023-12-02 20:46:54,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2023-12-02 20:46:54,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2023-12-02 20:46:54,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2023-12-02 20:46:54,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2023-12-02 20:46:54,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-12-02 20:46:54,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-12-02 20:46:54,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:46:54,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 81 [2023-12-02 20:46:54,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2023-12-02 20:46:54,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2023-12-02 20:46:54,832 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:46:54,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106658664] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:46:54,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:46:54,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2023-12-02 20:46:54,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367814281] [2023-12-02 20:46:54,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:46:54,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 20:46:54,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:46:54,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 20:46:54,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2023-12-02 20:46:54,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:46:54,835 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:46:54,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.421052631578948) internal successors, (122), 18 states have internal predecessors, (122), 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) [2023-12-02 20:46:54,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:54,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:54,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:54,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:54,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:54,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:54,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:54,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:46:54,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:54,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:54,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-12-02 20:46:54,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:47:01,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:01,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:01,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:01,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:47:01,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:01,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:01,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:01,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:01,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:01,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:01,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:47:01,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2023-12-02 20:47:01,438 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 20:47:01,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:47:01,634 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:47:01,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:47:01,634 INFO L85 PathProgramCache]: Analyzing trace with hash 860865214, now seen corresponding path program 1 times [2023-12-02 20:47:01,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:47:01,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895517844] [2023-12-02 20:47:01,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:47:01,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:47:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:47:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 20:47:01,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:47:01,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895517844] [2023-12-02 20:47:01,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895517844] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:47:01,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:47:01,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 20:47:01,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714309269] [2023-12-02 20:47:01,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:47:01,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:47:01,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:47:01,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:47:01,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:47:01,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:47:01,780 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:47:01,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2023-12-02 20:47:01,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:01,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:01,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:01,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:47:01,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:01,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:01,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:01,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:01,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:01,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:01,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:47:01,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2023-12-02 20:47:01,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:47:03,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:03,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:03,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:03,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:47:03,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:03,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:03,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:03,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:03,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:03,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:03,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:47:03,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2023-12-02 20:47:03,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:03,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-02 20:47:03,590 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:47:03,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:47:03,590 INFO L85 PathProgramCache]: Analyzing trace with hash -29577225, now seen corresponding path program 2 times [2023-12-02 20:47:03,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:47:03,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933028467] [2023-12-02 20:47:03,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:47:03,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:47:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:47:03,996 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:47:03,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:47:03,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933028467] [2023-12-02 20:47:03,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933028467] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:47:03,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212163450] [2023-12-02 20:47:03,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:47:03,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:47:03,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:47:03,998 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:47:04,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 20:47:04,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:47:04,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:47:04,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 20:47:04,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:47:04,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:47:04,233 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 20:47:04,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 20:47:04,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:47:04,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 20:47:04,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2023-12-02 20:47:04,394 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:47:04,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:47:04,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-12-02 20:47:04,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:47:04,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:47:04,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:47:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:47:04,558 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:47:04,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2023-12-02 20:47:04,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2023-12-02 20:47:05,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:47:05,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 81 [2023-12-02 20:47:05,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2023-12-02 20:47:05,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2023-12-02 20:47:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:47:05,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212163450] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:47:05,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:47:05,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2023-12-02 20:47:05,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521779291] [2023-12-02 20:47:05,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:47:05,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-02 20:47:05,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:47:05,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-02 20:47:05,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=685, Unknown=5, NotChecked=0, Total=812 [2023-12-02 20:47:05,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:47:05,327 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:47:05,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.7241379310344827) internal successors, (108), 28 states have internal predecessors, (108), 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) [2023-12-02 20:47:05,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:05,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:05,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:05,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:47:05,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:05,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:05,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:05,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:05,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:05,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:05,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:47:05,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2023-12-02 20:47:05,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:05,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:47:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:47:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:47:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2023-12-02 20:47:09,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:09,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-02 20:47:09,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 20:47:09,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-02 20:47:09,367 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:47:09,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:47:09,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1905916127, now seen corresponding path program 2 times [2023-12-02 20:47:09,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:47:09,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819916202] [2023-12-02 20:47:09,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:47:09,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:47:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:47:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:47:09,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:47:09,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819916202] [2023-12-02 20:47:09,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819916202] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:47:09,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834543685] [2023-12-02 20:47:09,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:47:09,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:47:09,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:47:09,990 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:47:09,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 20:47:10,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:47:10,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:47:10,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 20:47:10,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:47:10,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:47:10,205 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 20:47:10,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 20:47:10,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 20:47:10,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:47:10,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2023-12-02 20:47:10,347 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:47:10,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:47:10,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-12-02 20:47:10,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 20:47:10,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:47:10,530 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:47:10,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:47:10,560 INFO L378 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 17 treesize of output 12 [2023-12-02 20:47:10,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:47:10,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:47:10,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-02 20:47:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:47:10,589 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:47:10,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2023-12-02 20:47:10,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2023-12-02 20:47:10,641 WARN L854 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_7 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_8 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))))) is different from false [2023-12-02 20:47:11,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2023-12-02 20:47:11,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:47:11,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 132 [2023-12-02 20:47:11,593 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|))) (and (or (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_889 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_48| Int) (v_DerPreprocessor_8 (Array Int Int))) (or (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= 0 (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_889) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_48| v_DerPreprocessor_8) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= (select v_DerPreprocessor_10 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (= |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_48|))) (< c_~next_alloc_idx~0 65)) (or (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_889 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_48| Int) (v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 (Array Int Int))) (or (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| v_DerPreprocessor_9)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_889) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_48| v_DerPreprocessor_8) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_48|) (= v_DerPreprocessor_9 0))) (< c_~next_alloc_idx~0 63) (< 64 c_~next_alloc_idx~0)) (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_18 Int) (v_DerPreprocessor_9 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_prenex_17 (Array Int Int))) (or (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (= v_prenex_18 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| v_DerPreprocessor_9)) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_17) v_prenex_18 v_DerPreprocessor_7) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= v_DerPreprocessor_9 0)))))) is different from false [2023-12-02 20:47:12,017 WARN L854 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (forall ((v_ArrVal_885 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_889 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_48| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_49| Int) (v_DerPreprocessor_8 (Array Int Int))) (or (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_49| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_48|) (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (= (select v_DerPreprocessor_10 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_49| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_889) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_48| v_DerPreprocessor_8) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_49|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select (store |c_#valid| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_885) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_49|) 0))))) (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_885 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_18 Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_49| Int) (v_DerPreprocessor_9 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_prenex_17 (Array Int Int))) (or (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_49| (store (select |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_49|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| v_DerPreprocessor_9)) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_17) v_prenex_18 v_DerPreprocessor_7) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_49|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_49| v_prenex_18) (= v_DerPreprocessor_9 0) (not (= (select (store |c_#valid| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_885) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_49|) 0))))) (or (< c_~next_alloc_idx~0 63) (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_885 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_889 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_48| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_49| Int) (v_DerPreprocessor_9 Int) (v_DerPreprocessor_8 (Array Int Int))) (or (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_49| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_48|) (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_49| (store (select |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_49|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| v_DerPreprocessor_9)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_889) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_48| v_DerPreprocessor_8) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_49|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= v_DerPreprocessor_9 0) (not (= (select (store |c_#valid| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_885) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_49|) 0)))))) is different from false [2023-12-02 20:47:12,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:47:12,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 81 [2023-12-02 20:47:12,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2023-12-02 20:47:12,891 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:47:12,902 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:47:12,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2023-12-02 20:47:12,925 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:47:12,932 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:47:12,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2023-12-02 20:47:13,609 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 5 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:47:13,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834543685] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:47:13,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:47:13,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 35 [2023-12-02 20:47:13,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028154604] [2023-12-02 20:47:13,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:47:13,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 20:47:13,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:47:13,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 20:47:13,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=918, Unknown=7, NotChecked=192, Total=1260 [2023-12-02 20:47:13,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:47:13,613 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:47:13,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.5555555555555554) internal successors, (128), 35 states have internal predecessors, (128), 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) [2023-12-02 20:47:13,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:13,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:13,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:13,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:47:13,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:13,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:13,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:13,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:47:13,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:13,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:13,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:47:13,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2023-12-02 20:47:13,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:13,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-12-02 20:47:13,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:47:19,414 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] [2023-12-02 20:47:21,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:47:23,491 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] [2023-12-02 20:47:25,504 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] [2023-12-02 20:47:32,480 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] [2023-12-02 20:47:34,491 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] [2023-12-02 20:47:36,502 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] [2023-12-02 20:47:38,518 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] [2023-12-02 20:47:40,544 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] [2023-12-02 20:47:42,561 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] [2023-12-02 20:47:44,592 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] [2023-12-02 20:47:46,607 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] [2023-12-02 20:47:48,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:47:50,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:47:52,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] [2023-12-02 20:47:54,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:47:56,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:47:58,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:48:01,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:48:03,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:48:04,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:48:04,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:48:04,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:48:04,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:48:04,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:48:04,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:48:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:48:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:48:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:48:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:48:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:48:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2023-12-02 20:48:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:48:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-02 20:48:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:48:04,161 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 20:48:04,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-02 20:48:04,357 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:48:04,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:48:04,357 INFO L85 PathProgramCache]: Analyzing trace with hash 967853734, now seen corresponding path program 2 times [2023-12-02 20:48:04,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:48:04,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315662968] [2023-12-02 20:48:04,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:48:04,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:48:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:48:04,590 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:48:04,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:48:04,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315662968] [2023-12-02 20:48:04,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315662968] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:48:04,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393010070] [2023-12-02 20:48:04,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:48:04,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:48:04,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:48:04,592 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:48:04,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 20:48:04,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:48:04,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:48:04,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 20:48:04,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:48:04,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:48:04,901 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 20:48:04,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 20:48:04,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 20:48:04,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:48:05,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2023-12-02 20:48:05,056 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 20:48:05,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 20:48:05,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-12-02 20:48:05,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 20:48:05,242 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-02 20:48:05,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-12-02 20:48:05,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:48:05,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 20:48:05,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-12-02 20:48:05,407 INFO L378 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 31 treesize of output 27 [2023-12-02 20:48:05,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-12-02 20:48:05,675 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:48:05,675 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:48:05,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2023-12-02 20:48:05,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2023-12-02 20:48:06,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2023-12-02 20:48:08,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:48:08,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 81 [2023-12-02 20:48:08,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2023-12-02 20:48:08,215 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:48:08,230 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:48:08,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2023-12-02 20:48:09,309 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:48:09,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393010070] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:48:09,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:48:09,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 15, 15] total 33 [2023-12-02 20:48:09,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584064388] [2023-12-02 20:48:09,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:48:09,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 20:48:09,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:48:09,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 20:48:09,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=967, Unknown=15, NotChecked=0, Total=1122 [2023-12-02 20:48:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:48:09,313 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:48:09,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.382352941176471) internal successors, (149), 33 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:48:09,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:48:09,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:48:09,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:48:09,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:48:09,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:48:09,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:48:09,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:48:09,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:48:09,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:48:09,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:48:09,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:48:09,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2023-12-02 20:48:09,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:48:09,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-12-02 20:48:09,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:48:09,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:48:15,569 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] [2023-12-02 20:48:16,052 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~next_alloc_idx~0 2))) (let ((.cse7 (forall ((v_ArrVal_989 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (.cse0 (< c_~next_alloc_idx~0 65)) (.cse6 (= .cse5 0)) (.cse2 (< c_~next_alloc_idx~0 63)) (.cse3 (< 62 c_~next_alloc_idx~0)) (.cse8 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse1 (< 64 c_~next_alloc_idx~0)) (.cse10 (= c_~next_alloc_idx~0 0))) (and (or (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) 0)) (= 0 (select v_DerPreprocessor_12 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (or .cse1 (and (or .cse2 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_74 (Array Int Int)) (v_prenex_76 Int) (v_prenex_75 Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| Int) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= 0 (select (store |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| 1) v_prenex_76))) (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (= (select v_DerPreprocessor_12 v_prenex_75) 0) (< v_prenex_75 0) (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| v_DerPreprocessor_13) v_prenex_76 v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_74) v_prenex_76) v_prenex_75) 0)) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51|) 0)) (= (select v_DerPreprocessor_13 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (or .cse3 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| Int) (v_DerPreprocessor_13 (Array Int Int))) (or (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (let ((.cse4 (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| v_DerPreprocessor_13))) (store .cse4 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| (store (select .cse4 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| .cse5))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51|) 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| 1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) 0)) (= (select v_DerPreprocessor_13 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))) .cse6))) (or (= |c_thr1Thread2of3ForFork0_push_#t~mem1#1| 0) .cse7) (not (= c_~top~0 0)) (or .cse7 (= (select .cse8 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse0 (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= 0 (select v_DerPreprocessor_12 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0)))) (or (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 1)) .cse1 (and (or .cse3 .cse6 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) 0)) (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (let ((.cse9 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13))) (store .cse9 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| (store (select .cse9 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| .cse5))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (= (select v_DerPreprocessor_13 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (or .cse2 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_74 (Array Int Int)) (v_prenex_76 Int) (v_prenex_75 Int) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (= (select v_DerPreprocessor_12 v_prenex_75) 0) (< v_prenex_75 0) (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) v_prenex_76 v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_74) v_prenex_76) v_prenex_75) 0)) (= (select v_DerPreprocessor_13 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select |c_#valid| v_prenex_76) 0))))))) (or .cse1 (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))) .cse10) (or .cse3 (and (or (< 60 c_~next_alloc_idx~0) (forall ((v_prenex_90 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54| Int) (v_prenex_91 Int)) (let ((.cse11 (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54| v_prenex_90))) (or (not (= (select (store .cse11 v_prenex_91 1) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= (select .cse11 v_prenex_91) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54|) 0))))) (= (+ c_~next_alloc_idx~0 4) 0)) (or (forall ((v_ArrVal_982 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| Int)) (let ((.cse12 (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_982))) (or (not (= (select .cse12 |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51|) 0)) (not (= 0 (select (store .cse12 |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| 1) |c_ULTIMATE.start_main_~#t~0#1.base|))) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54|) 0))))) (< c_~next_alloc_idx~0 61)))) (or (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse8 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))) .cse1 .cse10)))) is different from false [2023-12-02 20:48:18,402 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] [2023-12-02 20:48:20,715 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] [2023-12-02 20:48:22,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 [0] [2023-12-02 20:48:24,727 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] [2023-12-02 20:48:28,860 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, 1] [2023-12-02 20:48:30,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, 1] [2023-12-02 20:48:32,874 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, 1] [2023-12-02 20:48:34,883 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, 1] [2023-12-02 20:48:44,823 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] [2023-12-02 20:48:45,274 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~next_alloc_idx~0 2))) (let ((.cse7 (forall ((v_ArrVal_989 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (.cse0 (< c_~next_alloc_idx~0 65)) (.cse6 (= .cse5 0)) (.cse2 (< c_~next_alloc_idx~0 63)) (.cse3 (< 62 c_~next_alloc_idx~0)) (.cse8 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse1 (< 64 c_~next_alloc_idx~0)) (.cse10 (= c_~next_alloc_idx~0 0))) (and (or (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) 0)) (= 0 (select v_DerPreprocessor_12 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (or .cse1 (and (or .cse2 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_74 (Array Int Int)) (v_prenex_76 Int) (v_prenex_75 Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| Int) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= 0 (select (store |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| 1) v_prenex_76))) (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (= (select v_DerPreprocessor_12 v_prenex_75) 0) (< v_prenex_75 0) (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| v_DerPreprocessor_13) v_prenex_76 v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_74) v_prenex_76) v_prenex_75) 0)) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51|) 0)) (= (select v_DerPreprocessor_13 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (or .cse3 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| Int) (v_DerPreprocessor_13 (Array Int Int))) (or (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (let ((.cse4 (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| v_DerPreprocessor_13))) (store .cse4 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| (store (select .cse4 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| .cse5))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51|) 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| 1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) 0)) (= (select v_DerPreprocessor_13 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))) .cse6))) (or (= |c_thr1Thread2of3ForFork0_push_#t~mem1#1| 0) .cse7) (or .cse7 (= (select .cse8 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse0 (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= 0 (select v_DerPreprocessor_12 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0)))) (or (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 1)) .cse1 (and (or .cse3 .cse6 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) 0)) (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (let ((.cse9 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13))) (store .cse9 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| (store (select .cse9 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| .cse5))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (= (select v_DerPreprocessor_13 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (or .cse2 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_74 (Array Int Int)) (v_prenex_76 Int) (v_prenex_75 Int) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (= (select v_DerPreprocessor_12 v_prenex_75) 0) (< v_prenex_75 0) (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) v_prenex_76 v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_74) v_prenex_76) v_prenex_75) 0)) (= (select v_DerPreprocessor_13 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select |c_#valid| v_prenex_76) 0))))))) (or .cse1 (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))) .cse10) (or .cse3 (and (or (< 60 c_~next_alloc_idx~0) (forall ((v_prenex_90 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54| Int) (v_prenex_91 Int)) (let ((.cse11 (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54| v_prenex_90))) (or (not (= (select (store .cse11 v_prenex_91 1) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= (select .cse11 v_prenex_91) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54|) 0))))) (= (+ c_~next_alloc_idx~0 4) 0)) (or (forall ((v_ArrVal_982 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| Int)) (let ((.cse12 (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_982))) (or (not (= (select .cse12 |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51|) 0)) (not (= 0 (select (store .cse12 |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| 1) |c_ULTIMATE.start_main_~#t~0#1.base|))) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54|) 0))))) (< c_~next_alloc_idx~0 61)))) (or (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse8 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))) .cse1 .cse10)))) is different from false [2023-12-02 20:48:47,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 [0] [2023-12-02 20:48:49,625 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] [2023-12-02 20:48:51,628 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] [2023-12-02 20:48:53,635 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] [2023-12-02 20:48:57,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, 1] [2023-12-02 20:48:59,804 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, 1] [2023-12-02 20:49:01,808 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, 1] [2023-12-02 20:49:03,816 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, 1] [2023-12-02 20:49:15,690 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, 1] [2023-12-02 20:49:17,695 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, 1] [2023-12-02 20:49:19,697 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, 1] [2023-12-02 20:49:21,701 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, 1] [2023-12-02 20:49:23,722 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, 1] [2023-12-02 20:49:25,743 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, 1] [2023-12-02 20:49:27,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, 1] [2023-12-02 20:49:28,140 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~next_alloc_idx~0 2))) (let ((.cse7 (forall ((v_ArrVal_989 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (.cse0 (< c_~next_alloc_idx~0 65)) (.cse6 (= .cse5 0)) (.cse2 (< c_~next_alloc_idx~0 63)) (.cse3 (< 62 c_~next_alloc_idx~0)) (.cse8 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse1 (< 64 c_~next_alloc_idx~0)) (.cse10 (= c_~next_alloc_idx~0 0))) (and (<= 0 (div |c_thr1Thread1of3ForFork0_push_#t~mem2#1| 4294967296)) (or (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) 0)) (= 0 (select v_DerPreprocessor_12 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (or .cse1 (and (or .cse2 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_74 (Array Int Int)) (v_prenex_76 Int) (v_prenex_75 Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| Int) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= 0 (select (store |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| 1) v_prenex_76))) (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (= (select v_DerPreprocessor_12 v_prenex_75) 0) (< v_prenex_75 0) (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| v_DerPreprocessor_13) v_prenex_76 v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_74) v_prenex_76) v_prenex_75) 0)) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51|) 0)) (= (select v_DerPreprocessor_13 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (or .cse3 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| Int) (v_DerPreprocessor_13 (Array Int Int))) (or (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (let ((.cse4 (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| v_DerPreprocessor_13))) (store .cse4 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| (store (select .cse4 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| .cse5))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51|) 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| 1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) 0)) (= (select v_DerPreprocessor_13 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))) .cse6))) (or (= |c_thr1Thread2of3ForFork0_push_#t~mem1#1| 0) .cse7) (<= |c_thr1Thread1of3ForFork0_push_#t~mem2#1| 3) (or .cse7 (= (select .cse8 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse0 (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= 0 (select v_DerPreprocessor_12 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0)))) (or (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 1)) .cse1 (and (or .cse3 .cse6 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) 0)) (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (let ((.cse9 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13))) (store .cse9 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| (store (select .cse9 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| .cse5))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (= (select v_DerPreprocessor_13 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (or .cse2 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_74 (Array Int Int)) (v_prenex_76 Int) (v_prenex_75 Int) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (= (select v_DerPreprocessor_12 v_prenex_75) 0) (< v_prenex_75 0) (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) v_prenex_76 v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_74) v_prenex_76) v_prenex_75) 0)) (= (select v_DerPreprocessor_13 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select |c_#valid| v_prenex_76) 0))))))) (or .cse1 (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))) .cse10) (or .cse3 (and (or (< 60 c_~next_alloc_idx~0) (forall ((v_prenex_90 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54| Int) (v_prenex_91 Int)) (let ((.cse11 (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54| v_prenex_90))) (or (not (= (select (store .cse11 v_prenex_91 1) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= (select .cse11 v_prenex_91) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54|) 0))))) (= (+ c_~next_alloc_idx~0 4) 0)) (or (forall ((v_ArrVal_982 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| Int)) (let ((.cse12 (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_982))) (or (not (= (select .cse12 |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51|) 0)) (not (= 0 (select (store .cse12 |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| 1) |c_ULTIMATE.start_main_~#t~0#1.base|))) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54|) 0))))) (< c_~next_alloc_idx~0 61)))) (or (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse8 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))) .cse1 .cse10)))) is different from false [2023-12-02 20:49:31,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 [0, 1] [2023-12-02 20:49:33,998 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, 1] [2023-12-02 20:49:50,719 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_989 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|))) (and (or (= |c_thr1Thread2of3ForFork0_push_#t~mem1#1| 0) .cse0) (not (= c_~top~0 0)) (or .cse0 (= (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or (< c_~next_alloc_idx~0 65) (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= 0 (select v_DerPreprocessor_12 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0)))) (or (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))) (< 64 c_~next_alloc_idx~0) (= c_~next_alloc_idx~0 0)))) is different from false [2023-12-02 20:49:51,067 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|))) (and (or (forall ((v_ArrVal_989 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) (= (select .cse0 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or (< c_~next_alloc_idx~0 65) (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= 0 (select v_DerPreprocessor_12 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0)))) (or (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))) (< 64 c_~next_alloc_idx~0) (= c_~next_alloc_idx~0 0)))) is different from false [2023-12-02 20:49:55,045 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] [2023-12-02 20:50:11,793 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] [2023-12-02 20:50:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:50:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:50:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:50:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:50:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:50:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:50:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:50:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:50:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:50:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:50:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:50:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2023-12-02 20:50:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:50:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-12-02 20:50:11,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-02 20:50:11,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2023-12-02 20:50:11,988 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 20:50:12,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-02 20:50:12,184 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:50:12,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:50:12,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1804580191, now seen corresponding path program 3 times [2023-12-02 20:50:12,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:50:12,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046682583] [2023-12-02 20:50:12,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:50:12,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:50:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:50:12,782 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:50:12,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:50:12,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046682583] [2023-12-02 20:50:12,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046682583] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:50:12,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772161609] [2023-12-02 20:50:12,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 20:50:12,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:50:12,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:50:12,784 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:50:12,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 20:50:12,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 20:50:12,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:50:12,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 20:50:12,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:50:12,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:50:13,060 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 20:50:13,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 20:50:13,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:50:13,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 20:50:13,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2023-12-02 20:50:13,225 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:50:13,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:50:13,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 20:50:13,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-12-02 20:50:13,396 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:50:13,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:50:13,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-12-02 20:50:13,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:50:13,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:50:13,465 INFO L378 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 17 treesize of output 12 [2023-12-02 20:50:13,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-02 20:50:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:50:13,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:50:13,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2023-12-02 20:50:13,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2023-12-02 20:50:14,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2023-12-02 20:50:14,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:50:14,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 141 treesize of output 209 [2023-12-02 20:50:14,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:50:14,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 81 [2023-12-02 20:50:14,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2023-12-02 20:50:14,690 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:50:14,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772161609] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:50:14,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:50:14,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 34 [2023-12-02 20:50:14,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690477906] [2023-12-02 20:50:14,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:50:14,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-02 20:50:14,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:50:14,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-02 20:50:14,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2023-12-02 20:50:14,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:50:14,693 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:50:14,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.6) internal successors, (126), 34 states have internal predecessors, (126), 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) [2023-12-02 20:50:14,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:50:14,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:50:14,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:50:14,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:50:14,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:50:14,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:50:14,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:50:14,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:50:14,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:50:14,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:50:14,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:50:14,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2023-12-02 20:50:14,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:50:14,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-12-02 20:50:14,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2023-12-02 20:50:14,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 152 states. [2023-12-02 20:50:14,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:50:22,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:50:22,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:50:22,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:50:22,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:50:22,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:50:22,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:50:22,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:50:22,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:50:22,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:50:22,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:50:22,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:50:22,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2023-12-02 20:50:22,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:50:22,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-12-02 20:50:22,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-02 20:50:22,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2023-12-02 20:50:22,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 20:50:22,338 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-02 20:50:22,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-02 20:50:22,535 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:50:22,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:50:22,536 INFO L85 PathProgramCache]: Analyzing trace with hash 727865247, now seen corresponding path program 4 times [2023-12-02 20:50:22,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:50:22,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762570495] [2023-12-02 20:50:22,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:50:22,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:50:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:50:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:50:23,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:50:23,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762570495] [2023-12-02 20:50:23,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762570495] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:50:23,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656445944] [2023-12-02 20:50:23,208 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 20:50:23,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:50:23,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:50:23,209 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:50:23,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 20:50:23,395 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 20:50:23,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:50:23,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 20:50:23,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:50:23,465 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 20:50:23,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 20:50:23,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 20:50:23,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:50:23,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2023-12-02 20:50:23,646 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:50:23,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:50:23,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-12-02 20:50:23,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:50:23,743 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:50:23,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:50:23,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:50:23,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:50:23,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:50:23,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:50:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 20:50:23,953 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:50:23,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2023-12-02 20:50:23,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2023-12-02 20:50:24,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2023-12-02 20:50:24,214 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 20:50:24,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 70 [2023-12-02 20:50:24,271 WARN L854 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_1181 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_19 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_54| Int)) (or (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (= |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_54|) (not (= 0 (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1181) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_54| v_DerPreprocessor_19) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (or (forall ((v_ArrVal_1181 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_54| Int)) (or (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (= |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_54|) (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1181) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_54| v_DerPreprocessor_19) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (< c_~next_alloc_idx~0 65))) is different from false [2023-12-02 20:50:24,523 WARN L854 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (forall ((v_ArrVal_1181 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_1177 Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_54| Int)) (or (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_54|) (not (= (select (store |c_#valid| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1177) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55|) 0)) (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55| v_DerPreprocessor_20) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1181) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_54| v_DerPreprocessor_19) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_1181 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_1177 Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_54| Int)) (or (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55| (store (select |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1181) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_54| v_DerPreprocessor_19) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_54|) (not (= (select (store |c_#valid| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1177) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55|) 0)))))) is different from false [2023-12-02 20:50:24,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:50:24,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 81 [2023-12-02 20:50:24,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2023-12-02 20:50:25,002 INFO L349 Elim1Store]: treesize reduction 12, result has 65.7 percent of original size [2023-12-02 20:50:25,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 180 treesize of output 197 [2023-12-02 20:50:25,020 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:50:25,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 262 treesize of output 242 [2023-12-02 20:50:25,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 134 [2023-12-02 20:50:25,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 132 [2023-12-02 20:50:25,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 130 [2023-12-02 20:50:25,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 243 treesize of output 241 [2023-12-02 20:50:25,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 133 [2023-12-02 20:50:25,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 131 [2023-12-02 20:50:25,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:50:26,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 138 treesize of output 344 [2023-12-02 20:50:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 20:50:26,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656445944] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:50:26,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:50:26,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 33 [2023-12-02 20:50:26,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755161662] [2023-12-02 20:50:26,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:50:26,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 20:50:26,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:50:26,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 20:50:26,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=861, Unknown=15, NotChecked=122, Total=1122 [2023-12-02 20:50:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:50:26,984 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:50:26,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.764705882352941) internal successors, (128), 33 states have internal predecessors, (128), 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) [2023-12-02 20:50:26,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:50:26,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:50:26,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:50:26,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:50:26,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:50:26,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:50:26,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:50:26,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:50:26,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:50:26,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:50:26,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:50:26,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2023-12-02 20:50:26,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:50:26,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-12-02 20:50:26,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2023-12-02 20:50:26,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 152 states. [2023-12-02 20:50:26,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2023-12-02 20:50:26,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:50:30,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:50:32,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:50:34,216 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] [2023-12-02 20:50:36,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:50:40,413 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] [2023-12-02 20:50:44,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:50:49,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:50:53,057 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] [2023-12-02 20:50:55,069 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] [2023-12-02 20:50:58,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:51:00,347 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] [2023-12-02 20:51:02,660 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] [2023-12-02 20:51:06,710 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (+ c_~next_alloc_idx~0 2) 0))) (.cse1 (< 64 c_~next_alloc_idx~0)) (.cse0 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (forall ((v_ArrVal_1181 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_54| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55|) 0)) (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_54|) (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55| v_DerPreprocessor_20) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1181) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_54| v_DerPreprocessor_19) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (or .cse1 (and (or (< 62 c_~next_alloc_idx~0) (and (or (forall ((v_prenex_123 Int) (v_prenex_124 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60|) 0)) (not (= (select (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60| v_prenex_123) v_prenex_124) 0)))) .cse2) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60| Int)) (or (forall ((v_prenex_123 Int)) (not (= (select (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60| v_prenex_123) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60|) 0)))))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_1177 Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60|) 0)) (not (= (select (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_1177) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55|) 0)))) (< c_~next_alloc_idx~0 63)))) (<= c_~next_alloc_idx~0 62) (not (= c_~top~0 0)) .cse2 (or (forall ((v_ArrVal_1181 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_19 (Array Int Int)) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_54| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55|) 0)) (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55| (store (select |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1181) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_54| v_DerPreprocessor_19) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_54|))) .cse1) (forall ((v_DerPreprocessor_19 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_19) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))) (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60| Int) (v_prenex_130 Int) (v_prenex_131 Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60|) 0)) (not (= (select (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60| v_prenex_130) v_prenex_131) 0))))))) is different from false [2023-12-02 20:51:07,407 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (+ c_~next_alloc_idx~0 2) 0)))) (and (= 3 c_~top~0) (or (< 64 c_~next_alloc_idx~0) (and (or (< 62 c_~next_alloc_idx~0) (and (or (forall ((v_prenex_123 Int) (v_prenex_124 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60|) 0)) (not (= (select (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60| v_prenex_123) v_prenex_124) 0)))) .cse0) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60| Int)) (or (forall ((v_prenex_123 Int)) (not (= (select (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60| v_prenex_123) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60|) 0)))))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60| Int) (v_ArrVal_1177 Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60|) 0)) (not (= (select (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60| v_ArrVal_1177) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_55|) 0)))) (< c_~next_alloc_idx~0 63)))) (<= c_~next_alloc_idx~0 62) .cse0 (forall ((v_DerPreprocessor_19 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_19) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))) (or (< c_~next_alloc_idx~0 65) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60| Int) (v_prenex_130 Int) (v_prenex_131 Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60|) 0)) (not (= (select (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_60| v_prenex_130) v_prenex_131) 0))))))) is different from false [2023-12-02 20:51:14,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:51:14,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:51:14,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:51:14,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:51:14,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:51:14,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:51:14,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:51:14,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:51:14,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:51:14,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:51:14,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:51:14,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2023-12-02 20:51:14,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:51:14,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-12-02 20:51:14,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-02 20:51:14,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2023-12-02 20:51:14,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 20:51:14,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-12-02 20:51:14,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-02 20:51:14,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:51:14,433 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:51:14,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:51:14,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1734106444, now seen corresponding path program 1 times [2023-12-02 20:51:14,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:51:14,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675209022] [2023-12-02 20:51:14,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:51:14,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:51:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:51:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:51:14,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:51:14,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675209022] [2023-12-02 20:51:14,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675209022] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:51:14,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783635591] [2023-12-02 20:51:14,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:51:14,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:51:14,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:51:14,805 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:51:14,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 20:51:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:51:14,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-02 20:51:14,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:51:14,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:51:15,083 INFO L378 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 [2023-12-02 20:51:15,138 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:51:15,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:51:15,175 INFO L378 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 18 treesize of output 13 [2023-12-02 20:51:15,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:51:15,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:51:15,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:51:15,379 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:51:15,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:51:15,450 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2023-12-02 20:51:15,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2023-12-02 20:51:15,573 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-12-02 20:51:15,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 36 [2023-12-02 20:51:15,742 INFO L378 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 31 treesize of output 22 [2023-12-02 20:51:15,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:51:15,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:51:15,951 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 20:51:15,952 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:51:16,408 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:51:16,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 133 [2023-12-02 20:51:16,418 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 20:51:16,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 121 [2023-12-02 20:51:17,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:51:17,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:51:17,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:51:17,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:51:17,114 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 20:51:17,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783635591] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 20:51:17,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:51:17,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13, 15] total 34 [2023-12-02 20:51:17,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999455179] [2023-12-02 20:51:17,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:51:17,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 20:51:17,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:51:17,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 20:51:17,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=961, Unknown=6, NotChecked=0, Total=1122 [2023-12-02 20:51:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:51:17,116 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:51:17,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 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) [2023-12-02 20:51:17,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:51:17,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:51:17,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:51:17,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:51:17,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:51:17,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:51:17,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:51:17,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:51:17,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:51:17,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:51:17,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:51:17,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2023-12-02 20:51:17,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:51:17,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-12-02 20:51:17,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2023-12-02 20:51:17,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 152 states. [2023-12-02 20:51:17,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2023-12-02 20:51:17,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-12-02 20:51:17,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:51:17,806 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (< c_~next_alloc_idx~0 65)) (.cse2 (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 1))) (.cse3 (< (select |c_#length| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4))) (let ((.cse0 (and (or (forall ((v_DerPreprocessor_22 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) .cse4 .cse2 .cse3) (or .cse2 .cse3 (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))))))) (and (not (= c_~top~0 0)) (or (= |c_thr1Thread2of3ForFork0_push_#t~mem1#1| 0) .cse0) (or .cse0 (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|)))) (or (= (select (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0) (and (or .cse2 .cse3 (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_DerPreprocessor_22 (Array Int Int))) (not (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) .cse4 .cse2 .cse3)))) (or (and (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 1) 0)) (forall ((v_DerPreprocessor_23 (Array Int Int))) (let ((.cse5 (let ((.cse6 (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| v_DerPreprocessor_23))) (store .cse6 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|))))) (or (= (select (select .cse5 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0) (forall ((v_DerPreprocessor_22 (Array Int Int))) (not (= 0 (select (select (store .cse5 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0))))))))) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0)) (forall ((v_DerPreprocessor_23 (Array Int Int))) (let ((.cse7 (let ((.cse8 (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| v_DerPreprocessor_23))) (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|))))) (or (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store .cse7 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0))) (= (select (select .cse7 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0)))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 1) 0))))) .cse4) (or (and (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| Int) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse10 (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|))) (let ((.cse9 (let ((.cse11 (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| (store .cse10 0 c_~next_alloc_idx~0)))) (store .cse11 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|))))) (or (= (select (select .cse9 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0)) (not (= (select (select (store .cse9 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0)) (not (= (+ (select .cse10 0) 1) 0))))))) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| Int)) (let ((.cse13 (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|))) (let ((.cse12 (let ((.cse14 (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| (store .cse13 0 c_~next_alloc_idx~0)))) (store .cse14 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|))))) (or (= (select (select .cse12 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0)) (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store .cse12 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0))) (not (= (+ (select .cse13 0) 1) 0))))))) (< 64 c_~next_alloc_idx~0))))) is different from false [2023-12-02 20:51:21,509 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] [2023-12-02 20:51:23,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:51:23,156 WARN L854 $PredicateComparison]: unable to prove that (and (not (= c_~top~0 0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|)))) (or (= (select (select .cse0 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0) (let ((.cse1 (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 1))) (.cse2 (< (select |c_#length| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4))) (and (or .cse1 .cse2 (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_DerPreprocessor_22 (Array Int Int))) (not (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) (< c_~next_alloc_idx~0 65) .cse1 .cse2)))))) is different from false [2023-12-02 20:51:24,338 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 1))) (.cse2 (< (select |c_#length| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4)) (.cse0 (< c_~next_alloc_idx~0 65))) (and (or (and (or (forall ((v_DerPreprocessor_22 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0 .cse1 .cse2) (or .cse1 .cse2 (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|)))) (or (= (select (select .cse3 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0) (and (or .cse1 .cse2 (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store .cse3 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_DerPreprocessor_22 (Array Int Int))) (not (= (select (select (store .cse3 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0 .cse1 .cse2)))) (or (and (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 1) 0)) (forall ((v_DerPreprocessor_23 (Array Int Int))) (let ((.cse4 (let ((.cse5 (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| v_DerPreprocessor_23))) (store .cse5 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|))))) (or (= (select (select .cse4 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0) (forall ((v_DerPreprocessor_22 (Array Int Int))) (not (= 0 (select (select (store .cse4 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0))))))))) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0)) (forall ((v_DerPreprocessor_23 (Array Int Int))) (let ((.cse6 (let ((.cse7 (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| v_DerPreprocessor_23))) (store .cse7 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|))))) (or (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store .cse6 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0))) (= (select (select .cse6 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0)))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 1) 0))))) .cse0) (or (and (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| Int) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse9 (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|))) (let ((.cse8 (let ((.cse10 (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| (store .cse9 0 c_~next_alloc_idx~0)))) (store .cse10 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|))))) (or (= (select (select .cse8 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0)) (not (= (select (select (store .cse8 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0)) (not (= (+ (select .cse9 0) 1) 0))))))) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| Int)) (let ((.cse12 (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|))) (let ((.cse11 (let ((.cse13 (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| (store .cse12 0 c_~next_alloc_idx~0)))) (store .cse13 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|))))) (or (= (select (select .cse11 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0)) (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store .cse11 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0))) (not (= (+ (select .cse12 0) 1) 0))))))) (< 64 c_~next_alloc_idx~0)))) is different from false [2023-12-02 20:51:27,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:51:28,822 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 1))) (.cse2 (< (select |c_#length| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4)) (.cse0 (< c_~next_alloc_idx~0 65))) (and (not (= c_~top~0 0)) (or (and (or (forall ((v_DerPreprocessor_22 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0 .cse1 .cse2) (or .cse1 .cse2 (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|)))) (or (= (select (select .cse3 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0) (and (or .cse1 .cse2 (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store .cse3 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_DerPreprocessor_22 (Array Int Int))) (not (= (select (select (store .cse3 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0 .cse1 .cse2)))) (or (and (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 1) 0)) (forall ((v_DerPreprocessor_23 (Array Int Int))) (let ((.cse4 (let ((.cse5 (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| v_DerPreprocessor_23))) (store .cse5 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|))))) (or (= (select (select .cse4 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0) (forall ((v_DerPreprocessor_22 (Array Int Int))) (not (= 0 (select (select (store .cse4 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0))))))))) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0)) (forall ((v_DerPreprocessor_23 (Array Int Int))) (let ((.cse6 (let ((.cse7 (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| v_DerPreprocessor_23))) (store .cse7 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|))))) (or (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store .cse6 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0))) (= (select (select .cse6 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0)))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 1) 0))))) .cse0) (or (and (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| Int) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse9 (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|))) (let ((.cse8 (let ((.cse10 (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| (store .cse9 0 c_~next_alloc_idx~0)))) (store .cse10 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|))))) (or (= (select (select .cse8 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0)) (not (= (select (select (store .cse8 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0)) (not (= (+ (select .cse9 0) 1) 0))))))) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| Int)) (let ((.cse12 (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|))) (let ((.cse11 (let ((.cse13 (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| (store .cse12 0 c_~next_alloc_idx~0)))) (store .cse13 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|))))) (or (= (select (select .cse11 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0)) (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store .cse11 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0))) (not (= (+ (select .cse12 0) 1) 0))))))) (< 64 c_~next_alloc_idx~0)))) is different from false [2023-12-02 20:51:30,960 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] [2023-12-02 20:51:31,026 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~next_alloc_idx~0 65)) (.cse1 (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 1))) (.cse2 (< (select |c_#length| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4))) (and (not (= c_~top~0 0)) (or (and (or (forall ((v_DerPreprocessor_22 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0 .cse1 .cse2) (or .cse1 .cse2 (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|)))) (or (= (select (select .cse3 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0) (and (or .cse1 .cse2 (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store .cse3 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_DerPreprocessor_22 (Array Int Int))) (not (= (select (select (store .cse3 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0 .cse1 .cse2)))))) is different from false [2023-12-02 20:51:34,463 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (< c_~next_alloc_idx~0 65)) (.cse2 (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 1))) (.cse3 (< (select |c_#length| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4))) (let ((.cse0 (and (or (forall ((v_DerPreprocessor_22 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) .cse4 .cse2 .cse3) (or .cse2 .cse3 (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))))))) (and (not (= c_~top~0 0)) (or (= |c_thr1Thread2of3ForFork0_push_#t~mem1#1| 0) .cse0) (or .cse0 (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|)))) (or (= (select (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0) (and (or .cse2 .cse3 (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_DerPreprocessor_22 (Array Int Int))) (not (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) .cse4 .cse2 .cse3))))))) is different from false [2023-12-02 20:51:36,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:51:41,340 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] [2023-12-02 20:51:44,521 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] [2023-12-02 20:51:47,481 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] [2023-12-02 20:51:51,184 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] [2023-12-02 20:51:53,415 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] [2023-12-02 20:51:55,483 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] [2023-12-02 20:52:00,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:52:03,070 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] [2023-12-02 20:52:05,521 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] [2023-12-02 20:52:07,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:52:09,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:52:10,252 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (< c_~next_alloc_idx~0 65))) (and (not (= c_~top~0 0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|)))) (or (= (select (select .cse0 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0) (let ((.cse1 (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 1))) (.cse2 (< (select |c_#length| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4))) (and (or .cse1 .cse2 (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (forall ((v_DerPreprocessor_22 (Array Int Int))) (not (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) .cse3 .cse1 .cse2))))) (or (and (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 1) 0)) (forall ((v_DerPreprocessor_23 (Array Int Int))) (let ((.cse4 (let ((.cse5 (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| v_DerPreprocessor_23))) (store .cse5 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|))))) (or (= (select (select .cse4 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0) (forall ((v_DerPreprocessor_22 (Array Int Int))) (not (= 0 (select (select (store .cse4 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0))))))))) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0)) (forall ((v_DerPreprocessor_23 (Array Int Int))) (let ((.cse6 (let ((.cse7 (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| v_DerPreprocessor_23))) (store .cse7 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|))))) (or (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store .cse6 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0))) (= (select (select .cse6 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0)))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 1) 0))))) .cse3) (or (and (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| Int) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse9 (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|))) (let ((.cse8 (let ((.cse10 (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| (store .cse9 0 c_~next_alloc_idx~0)))) (store .cse10 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|))))) (or (= (select (select .cse8 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0)) (not (= (select (select (store .cse8 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0)) (not (= (+ (select .cse9 0) 1) 0))))))) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| Int)) (let ((.cse12 (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|))) (let ((.cse11 (let ((.cse13 (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56| (store .cse12 0 c_~next_alloc_idx~0)))) (store .cse13 |c_ULTIMATE.start_main_~#t~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~#t~0#1.base|) |c_ULTIMATE.start_main_~#t~0#1.offset| |c_ULTIMATE.start_main_#t~pre9#1|))))) (or (= (select (select .cse11 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0)) (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store .cse11 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_56|) 0) 0))) (not (= (+ (select .cse12 0) 1) 0))))))) (< 64 c_~next_alloc_idx~0)))) is different from false [2023-12-02 20:52:15,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:52:19,317 WARN L854 $PredicateComparison]: unable to prove that (and (not (= c_~top~0 0)) (or (let ((.cse0 (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 1))) (.cse1 (< (select |c_#length| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4))) (and (or (forall ((v_DerPreprocessor_22 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) (< c_~next_alloc_idx~0 65) .cse0 .cse1) (or .cse0 .cse1 (forall ((v_DerPreprocessor_21 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))))) (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2023-12-02 20:52:28,287 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] [2023-12-02 20:52:30,293 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] [2023-12-02 20:52:36,565 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] [2023-12-02 20:52:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:52:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:52:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:52:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:52:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:52:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:52:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:52:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:52:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:52:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:52:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:52:38,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2023-12-02 20:52:38,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:52:38,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-12-02 20:52:38,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-02 20:52:38,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2023-12-02 20:52:38,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 20:52:38,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-12-02 20:52:38,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-12-02 20:52:38,350 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 20:52:38,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:52:38,545 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:52:38,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:52:38,546 INFO L85 PathProgramCache]: Analyzing trace with hash -288289774, now seen corresponding path program 2 times [2023-12-02 20:52:38,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:52:38,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398883887] [2023-12-02 20:52:38,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:52:38,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:52:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:52:39,250 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:52:39,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:52:39,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398883887] [2023-12-02 20:52:39,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398883887] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:52:39,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333724038] [2023-12-02 20:52:39,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:52:39,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:52:39,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:52:39,252 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:52:39,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 20:52:39,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:52:39,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:52:39,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 20:52:39,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:52:39,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:52:39,605 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 20:52:39,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 20:52:39,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 20:52:39,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:52:39,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2023-12-02 20:52:39,763 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 20:52:39,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-12-02 20:52:39,805 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-12-02 20:52:39,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-12-02 20:52:39,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2023-12-02 20:52:39,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:52:39,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:52:39,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 20:52:39,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:52:40,089 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:52:40,089 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:52:40,352 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 20:52:40,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 119 [2023-12-02 20:52:40,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:52:40,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 119 [2023-12-02 20:52:40,570 WARN L854 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (and (forall ((v_ArrVal_1403 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1403) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_24) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))) (forall ((v_prenex_140 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_140) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))))) (or (< 64 c_~next_alloc_idx~0) (let ((.cse0 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|))) (and (or (< c_~next_alloc_idx~0 63) (forall ((v_ArrVal_1403 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int))) (or (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1403) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_24) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (forall ((v_prenex_140 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_140) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))))))) is different from false [2023-12-02 20:52:41,304 WARN L854 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (and (or (< c_~next_alloc_idx~0 63) (forall ((v_ArrVal_1403 (Array Int Int)) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1399 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| Int) (v_DerPreprocessor_24 (Array Int Int))) (or (not (= (select (store (store |c_#valid| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1399) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| 1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1403) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| v_DerPreprocessor_24) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| Int) (v_ArrVal_1399 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| Int)) (or (not (= (select (store (store |c_#valid| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1399) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| 1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) 0)) (forall ((v_prenex_140 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_140) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| v_DerPreprocessor_25) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))))))) (or (and (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| Int) (v_ArrVal_1399 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| Int)) (or (not (= (select (store (store |c_#valid| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1399) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| 1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) 0)) (forall ((v_ArrVal_1403 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1403) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| v_DerPreprocessor_24) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))))) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| Int) (v_ArrVal_1399 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| Int)) (or (not (= (select (store (store |c_#valid| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1399) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| 1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) 0)) (forall ((v_prenex_140 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_140) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| v_DerPreprocessor_25) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))))))) (< c_~next_alloc_idx~0 65))) is different from false [2023-12-02 20:52:42,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:52:42,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 81 [2023-12-02 20:52:42,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2023-12-02 20:52:42,351 INFO L349 Elim1Store]: treesize reduction 65, result has 49.6 percent of original size [2023-12-02 20:52:42,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 396 treesize of output 472 [2023-12-02 20:52:42,435 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:52:42,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 613 treesize of output 604 [2023-12-02 20:52:42,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 404 treesize of output 400 [2023-12-02 20:52:42,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 400 treesize of output 398 [2023-12-02 20:52:42,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 398 treesize of output 396 [2023-12-02 20:52:42,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 396 treesize of output 392 [2023-12-02 20:52:42,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 392 treesize of output 390 [2023-12-02 20:52:42,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 390 treesize of output 388 [2023-12-02 20:52:42,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 388 treesize of output 384 [2023-12-02 20:52:42,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 382 [2023-12-02 20:52:42,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:52:42,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 470 treesize of output 466 [2023-12-02 20:52:42,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 422 treesize of output 418 [2023-12-02 20:52:42,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 418 treesize of output 416 [2023-12-02 20:52:42,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 416 treesize of output 414 [2023-12-02 20:52:42,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 414 treesize of output 412 [2023-12-02 20:52:42,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 408 [2023-12-02 20:52:42,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 408 treesize of output 406 [2023-12-02 20:52:42,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 406 treesize of output 402 [2023-12-02 20:52:42,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 402 treesize of output 400 [2023-12-02 20:52:42,925 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:52:42,927 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:52:42,961 INFO L349 Elim1Store]: treesize reduction 37, result has 39.3 percent of original size [2023-12-02 20:52:42,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 677 treesize of output 684 [2023-12-02 20:52:42,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 444 treesize of output 440 [2023-12-02 20:52:43,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 440 treesize of output 438 [2023-12-02 20:52:43,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 438 treesize of output 436 [2023-12-02 20:52:43,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 436 treesize of output 434 [2023-12-02 20:52:43,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 434 treesize of output 432 [2023-12-02 20:52:43,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 432 treesize of output 428 [2023-12-02 20:52:43,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 428 treesize of output 424 [2023-12-02 20:52:43,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 424 treesize of output 422 [2023-12-02 20:52:43,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 422 treesize of output 418 [2023-12-02 20:52:43,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 418 treesize of output 416 [2023-12-02 20:52:43,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 416 treesize of output 414 [2023-12-02 20:52:43,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 414 treesize of output 412 [2023-12-02 20:52:43,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 410 [2023-12-02 20:52:43,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 410 treesize of output 406 [2023-12-02 20:52:43,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 406 treesize of output 402 [2023-12-02 20:52:43,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 402 treesize of output 400 [2023-12-02 20:52:43,243 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:52:43,245 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:52:43,267 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 20:52:43,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 53 [2023-12-02 20:52:43,660 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 20:52:43,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 535 treesize of output 517 [2023-12-02 20:52:43,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 404 treesize of output 400 [2023-12-02 20:52:43,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 400 treesize of output 398 [2023-12-02 20:52:43,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 398 treesize of output 396 [2023-12-02 20:52:43,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 396 treesize of output 394 [2023-12-02 20:52:43,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 392 [2023-12-02 20:52:43,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 392 treesize of output 388 [2023-12-02 20:52:43,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:52:43,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 519 treesize of output 519 [2023-12-02 20:52:43,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 428 treesize of output 426 [2023-12-02 20:52:43,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 426 treesize of output 422 [2023-12-02 20:52:43,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 422 treesize of output 420 [2023-12-02 20:52:43,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 420 treesize of output 416 [2023-12-02 20:52:43,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 416 treesize of output 414 [2023-12-02 20:52:43,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 414 treesize of output 412 [2023-12-02 20:52:43,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 408 [2023-12-02 20:52:43,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 408 treesize of output 406 [2023-12-02 20:52:43,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 406 treesize of output 404 [2023-12-02 20:52:43,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 404 treesize of output 400 [2023-12-02 20:52:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:52:47,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333724038] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:52:47,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:52:47,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 33 [2023-12-02 20:52:47,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794684174] [2023-12-02 20:52:47,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:52:47,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 20:52:47,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:52:47,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 20:52:47,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=882, Unknown=5, NotChecked=122, Total=1122 [2023-12-02 20:52:47,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:52:47,547 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:52:47,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.529411764705882) internal successors, (154), 33 states have internal predecessors, (154), 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) [2023-12-02 20:52:47,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:52:47,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:52:47,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:52:47,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:52:47,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:52:47,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:52:47,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:52:47,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:52:47,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:52:47,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:52:47,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:52:47,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 117 states. [2023-12-02 20:52:47,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:52:47,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-12-02 20:52:47,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2023-12-02 20:52:47,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 156 states. [2023-12-02 20:52:47,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2023-12-02 20:52:47,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2023-12-02 20:52:47,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2023-12-02 20:52:47,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:52:50,028 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~next_alloc_idx~0 65)) (.cse2 (< 64 c_~next_alloc_idx~0)) (.cse3 (< c_~next_alloc_idx~0 63)) (.cse0 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|))) (and (not (= c_~top~0 0)) (not (= (select .cse0 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse1 (and (forall ((v_ArrVal_1403 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1403) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_24) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))) (forall ((v_prenex_140 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_140) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))))) (or .cse2 (and (or .cse3 (forall ((v_ArrVal_1403 (Array Int Int)) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| Int) (v_DerPreprocessor_24 (Array Int Int))) (or (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1403) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| v_DerPreprocessor_24) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| 1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) 0))))) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| Int)) (or (forall ((v_prenex_140 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_140) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| v_DerPreprocessor_25) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| 1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) 0)))))) (or .cse1 (and (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| Int)) (or (forall ((v_ArrVal_1403 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1403) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| v_DerPreprocessor_24) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))) (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| 1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) 0)))) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| Int)) (or (forall ((v_prenex_140 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_140) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| v_DerPreprocessor_25) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| 1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) 0)))))) (or .cse2 (and (or .cse3 (forall ((v_ArrVal_1403 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int))) (or (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1403) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_24) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (forall ((v_prenex_140 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_140) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))))))) is different from false [2023-12-02 20:52:52,786 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] [2023-12-02 20:53:11,521 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] [2023-12-02 20:53:49,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:53:52,948 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (< c_~next_alloc_idx~0 63))) (let ((.cse5 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) (.cse1 (or .cse8 (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63|) 0)) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| Int) (v_ArrVal_1399 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| Int)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| v_ArrVal_1399) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| 1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) 0))))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63|) 0)) (forall ((v_prenex_196 Int) (v_prenex_195 Int) (v_prenex_192 Int)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| v_prenex_195) v_prenex_192 1) v_prenex_196) 0)))))))) (.cse2 (< 62 c_~next_alloc_idx~0)) (.cse3 (not (= (+ c_~next_alloc_idx~0 2) 0))) (.cse4 (< c_~next_alloc_idx~0 61)) (.cse7 (< c_~next_alloc_idx~0 65)) (.cse0 (< 64 c_~next_alloc_idx~0)) (.cse6 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|))) (and (or .cse0 (and .cse1 (or .cse2 (and (or (forall ((v_prenex_205 Int) (v_prenex_203 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| v_prenex_205) v_prenex_203 1) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63|) 0)))) .cse3) (or (forall ((v_prenex_199 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| Int) (v_prenex_197 Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| v_prenex_199) v_prenex_197 1) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))) .cse4) (or (forall ((v_prenex_205 Int) (v_prenex_203 Int)) (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_205) v_prenex_203 1) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) .cse5))))) (or (and (or .cse2 (and (or (forall ((v_prenex_205 Int) (v_prenex_203 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| Int) (v_prenex_206 Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| v_prenex_205) v_prenex_203 1) v_prenex_206) 0)))) .cse3) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63|) 0)) (forall ((v_prenex_205 Int) (v_prenex_203 Int)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| v_prenex_205) v_prenex_203 1) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))))) (or .cse5 (forall ((v_prenex_199 Int) (v_prenex_197 Int)) (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_199) v_prenex_197 1) |c_ULTIMATE.start_main_~#t~0#1.base|) 0))) .cse4))) .cse1) .cse0) (not (= (select .cse6 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or (and .cse1 (or .cse2 (and (or (forall ((v_prenex_205 Int) (v_prenex_203 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| Int) (v_prenex_206 Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| v_prenex_205) v_prenex_203 1) v_prenex_206) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| v_prenex_206))) .cse3) (or (forall ((v_prenex_199 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| Int) (v_prenex_197 Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| v_prenex_199) v_prenex_197 1) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| |c_ULTIMATE.start_main_~#t~0#1.base|))) .cse4) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| |c_ULTIMATE.start_main_~#t~0#1.base|) (forall ((v_prenex_205 Int) (v_prenex_203 Int)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| v_prenex_205) v_prenex_203 1) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))))))) .cse0) (or (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63|) 0)) (forall ((v_prenex_216 Int) (v_prenex_220 Int) (v_prenex_219 Int)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| v_prenex_219) v_prenex_216 1) v_prenex_220) 0))))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63|) 0)) (forall ((v_prenex_213 Int) (v_prenex_212 Int) (v_prenex_209 Int)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_63| v_prenex_212) v_prenex_209 1) v_prenex_213) 0)))))) .cse7) (or .cse7 (and (forall ((v_ArrVal_1403 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1403) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_24) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))) (forall ((v_prenex_140 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_140) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))))) (or .cse0 (and (or .cse8 (forall ((v_ArrVal_1403 (Array Int Int)) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| Int) (v_DerPreprocessor_24 (Array Int Int))) (or (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1403) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| v_DerPreprocessor_24) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| 1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) 0))))) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| Int)) (or (forall ((v_prenex_140 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_140) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| v_DerPreprocessor_25) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| 1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) 0)))))) (or .cse7 (and (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| Int)) (or (forall ((v_ArrVal_1403 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1403) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| v_DerPreprocessor_24) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))) (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| 1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) 0)))) (forall ((|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| Int)) (or (forall ((v_prenex_140 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_140) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| v_DerPreprocessor_25) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_58| 1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_57|) 0)))))) (or .cse0 (and (or .cse8 (forall ((v_ArrVal_1403 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int))) (or (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse6 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1403) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_24) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (forall ((v_prenex_140 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse6 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_140) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0)))))))) is different from false [2023-12-02 20:53:56,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:54:38,397 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] [2023-12-02 20:55:10,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:55:10,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:55:10,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:55:10,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:55:10,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:55:10,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:55:10,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:55:10,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:55:10,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:55:10,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:55:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:55:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2023-12-02 20:55:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:55:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-12-02 20:55:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-02 20:55:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2023-12-02 20:55:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 20:55:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-12-02 20:55:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-12-02 20:55:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2023-12-02 20:55:10,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-12-02 20:55:10,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:55:10,263 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:55:10,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:55:10,263 INFO L85 PathProgramCache]: Analyzing trace with hash 169604622, now seen corresponding path program 1 times [2023-12-02 20:55:10,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:55:10,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530330651] [2023-12-02 20:55:10,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:55:10,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:55:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:55:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 20:55:10,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:55:10,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530330651] [2023-12-02 20:55:10,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530330651] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:55:10,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:55:10,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 20:55:10,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258951501] [2023-12-02 20:55:10,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:55:10,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:55:10,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:55:10,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:55:10,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:55:10,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:55:10,305 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:55:10,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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) [2023-12-02 20:55:10,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:55:10,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:55:10,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:55:10,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:55:10,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:55:10,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:55:10,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:55:10,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:55:10,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:55:10,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:55:10,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:55:10,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 117 states. [2023-12-02 20:55:10,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:55:10,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-12-02 20:55:10,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2023-12-02 20:55:10,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 156 states. [2023-12-02 20:55:10,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2023-12-02 20:55:10,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2023-12-02 20:55:10,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2023-12-02 20:55:10,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 192 states. [2023-12-02 20:55:10,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:55:15,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:55:15,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:55:15,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:55:15,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:55:15,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:55:15,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:55:15,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:55:15,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:55:15,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:55:15,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:55:15,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:55:15,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2023-12-02 20:55:15,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:55:15,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-12-02 20:55:15,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-02 20:55:15,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2023-12-02 20:55:15,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 20:55:15,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-12-02 20:55:15,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-12-02 20:55:15,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2023-12-02 20:55:15,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:55:15,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-02 20:55:15,065 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:55:15,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:55:15,066 INFO L85 PathProgramCache]: Analyzing trace with hash -360971845, now seen corresponding path program 1 times [2023-12-02 20:55:15,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:55:15,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675801032] [2023-12-02 20:55:15,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:55:15,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:55:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:55:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:55:15,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:55:15,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675801032] [2023-12-02 20:55:15,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675801032] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:55:15,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025685691] [2023-12-02 20:55:15,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:55:15,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:55:15,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:55:15,511 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:55:15,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-02 20:55:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:55:15,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 20:55:15,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:55:15,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:55:15,721 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 20:55:15,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 20:55:15,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:55:15,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 20:55:15,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2023-12-02 20:55:15,875 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 20:55:15,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-12-02 20:55:15,919 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-12-02 20:55:15,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-12-02 20:55:15,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2023-12-02 20:55:16,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:55:16,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 20:55:16,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:55:16,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:55:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:55:16,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:55:16,131 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1546 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1546) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2023-12-02 20:55:16,258 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 20:55:16,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 119 [2023-12-02 20:55:16,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:55:16,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 119 [2023-12-02 20:55:18,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:55:18,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 81 [2023-12-02 20:55:18,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2023-12-02 20:55:18,420 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:55:18,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-12-02 20:55:18,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 20:55:18,440 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:55:18,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-12-02 20:55:18,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 20:55:18,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:55:18,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-12-02 20:55:18,470 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:55:18,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2023-12-02 20:55:18,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-12-02 20:55:18,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:55:18,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-12-02 20:55:18,502 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:55:18,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2023-12-02 20:55:18,521 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:55:18,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-12-02 20:55:18,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 20:55:18,539 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:55:18,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-12-02 20:55:18,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 20:55:20,003 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 3 not checked. [2023-12-02 20:55:20,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025685691] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:55:20,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:55:20,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 31 [2023-12-02 20:55:20,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714401519] [2023-12-02 20:55:20,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:55:20,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-02 20:55:20,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:55:20,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-02 20:55:20,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=818, Unknown=10, NotChecked=58, Total=992 [2023-12-02 20:55:20,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:55:20,005 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:55:20,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.65625) internal successors, (117), 31 states have internal predecessors, (117), 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) [2023-12-02 20:55:20,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:55:20,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:55:20,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:55:20,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:55:20,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:55:20,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:55:20,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:55:20,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:55:20,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:55:20,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:55:20,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:55:20,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 117 states. [2023-12-02 20:55:20,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:55:20,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-12-02 20:55:20,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2023-12-02 20:55:20,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 156 states. [2023-12-02 20:55:20,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2023-12-02 20:55:20,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2023-12-02 20:55:20,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2023-12-02 20:55:20,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 192 states. [2023-12-02 20:55:20,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:55:20,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:56:33,321 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] [2023-12-02 20:56:43,936 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] [2023-12-02 20:56:52,318 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] [2023-12-02 20:56:57,060 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, 1] [2023-12-02 20:57:00,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 [0, 1] [2023-12-02 20:57:00,840 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (forall ((v_ArrVal_989 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (.cse1 (< 62 c_~next_alloc_idx~0)) (.cse5 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse0 (< 64 c_~next_alloc_idx~0))) (and (<= c_~top~0 5) (or .cse0 (and (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_74 (Array Int Int)) (v_prenex_76 Int) (v_prenex_75 Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| Int) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= 0 (select (store |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| 1) v_prenex_76))) (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (= (select v_DerPreprocessor_12 v_prenex_75) 0) (< v_prenex_75 0) (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| v_DerPreprocessor_13) v_prenex_76 v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_74) v_prenex_76) v_prenex_75) 0)) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51|) 0)) (= (select v_DerPreprocessor_13 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (let ((.cse3 (+ c_~next_alloc_idx~0 2))) (or .cse1 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| Int) (v_DerPreprocessor_13 (Array Int Int))) (or (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (let ((.cse2 (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| v_DerPreprocessor_13))) (store .cse2 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| (store (select .cse2 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| .cse3))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51|) 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| 1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) 0)) (= (select v_DerPreprocessor_13 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))) (= .cse3 0))))) (or (= |c_thr1Thread2of3ForFork0_push_#t~mem1#1| 0) .cse4) (not (= c_~top~0 0)) (or .cse4 (= (select .cse5 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or (< c_~next_alloc_idx~0 65) (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= 0 (select v_DerPreprocessor_12 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0)))) (or .cse1 (and (or (< 60 c_~next_alloc_idx~0) (forall ((v_prenex_90 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54| Int) (v_prenex_91 Int)) (let ((.cse6 (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54| v_prenex_90))) (or (not (= (select (store .cse6 v_prenex_91 1) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= (select .cse6 v_prenex_91) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54|) 0))))) (= (+ c_~next_alloc_idx~0 4) 0)) (or (forall ((v_ArrVal_982 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| Int)) (let ((.cse7 (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_982))) (or (not (= (select .cse7 |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51|) 0)) (not (= 0 (select (store .cse7 |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| 1) |c_ULTIMATE.start_main_~#t~0#1.base|))) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54|) 0))))) (< c_~next_alloc_idx~0 61)))) (or (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse5 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))) .cse0 (= c_~next_alloc_idx~0 0)))) is different from false [2023-12-02 20:57:02,402 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_989 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|))) (and (<= c_~top~0 5) (or (= |c_thr1Thread2of3ForFork0_push_#t~mem1#1| 0) .cse0) (not (= c_~top~0 0)) (or .cse0 (= (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or (< c_~next_alloc_idx~0 65) (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= 0 (select v_DerPreprocessor_12 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0)))) (or (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))) (< 64 c_~next_alloc_idx~0) (= c_~next_alloc_idx~0 0)))) is different from false [2023-12-02 20:57:22,402 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] [2023-12-02 20:57:24,444 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] [2023-12-02 20:57:26,629 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, 1] [2023-12-02 20:57:32,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:57:32,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:57:32,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:57:32,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:57:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:57:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:57:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:57:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:57:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:57:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:57:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-02 20:57:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2023-12-02 20:57:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:57:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-12-02 20:57:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-12-02 20:57:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2023-12-02 20:57:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-12-02 20:57:32,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-12-02 20:57:32,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-12-02 20:57:32,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2023-12-02 20:57:32,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:57:32,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2023-12-02 20:57:32,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-12-02 20:57:32,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-12-02 20:57:32,667 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thr1Err14ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-12-02 20:57:32,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:57:32,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1477415142, now seen corresponding path program 1 times [2023-12-02 20:57:32,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:57:32,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717686293] [2023-12-02 20:57:32,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:57:32,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:57:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:57:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:57:33,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:57:33,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717686293] [2023-12-02 20:57:33,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717686293] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:57:33,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739391244] [2023-12-02 20:57:33,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:57:33,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:57:33,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:57:33,517 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:57:33,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_106ca790-74fd-4961-9e5a-9ceba62c32cd/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 20:57:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:57:33,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 20:57:33,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:57:33,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:57:33,769 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 20:57:33,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 20:57:33,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:57:33,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:57:33,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2023-12-02 20:57:34,083 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 20:57:34,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 20:57:34,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:57:34,174 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 20:57:34,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 22 [2023-12-02 20:57:34,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 12 [2023-12-02 20:57:34,498 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:57:34,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:57:34,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2023-12-02 20:57:34,585 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2023-12-02 20:57:34,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-12-02 20:57:34,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 20:57:34,740 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-12-02 20:57:34,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-12-02 20:57:34,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:57:34,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2023-12-02 20:57:34,956 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:57:34,957 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:57:35,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2023-12-02 20:57:35,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2023-12-02 20:57:35,221 WARN L854 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_ArrVal_1660 (Array Int Int))) (or (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (= (select v_DerPreprocessor_42 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1660) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (or (< 64 c_~next_alloc_idx~0) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1660 (Array Int Int)) (v_DerPreprocessor_41 Int)) (or (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (= v_DerPreprocessor_41 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| v_DerPreprocessor_41)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1660) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)))))) is different from false [2023-12-02 20:57:35,385 WARN L854 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_ArrVal_1660 (Array Int Int)) (v_ArrVal_1656 Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_62| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1656) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_62|) 0)) (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (= (select v_DerPreprocessor_42 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_62| v_DerPreprocessor_42) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1660) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_62|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (or (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1660 (Array Int Int)) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_62| Int) (v_ArrVal_1656 Int) (v_DerPreprocessor_41 Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1656) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_62|) 0)) (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (= v_DerPreprocessor_41 0) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_62| (store (select |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_62|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| v_DerPreprocessor_41)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1660) |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_62|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (< 64 c_~next_alloc_idx~0))) is different from false [2023-12-02 20:57:35,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2023-12-02 20:57:38,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:57:38,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 84 [2023-12-02 20:57:38,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2023-12-02 20:57:38,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:57:38,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-12-02 20:57:38,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:57:38,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 342 treesize of output 414 [2023-12-02 20:57:38,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 261 treesize of output 257 [2023-12-02 20:57:38,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 255 [2023-12-02 20:57:38,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 255 treesize of output 253 [2023-12-02 20:57:38,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 251 [2023-12-02 20:57:38,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 249 [2023-12-02 20:57:38,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 247 [2023-12-02 20:57:39,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 245 [2023-12-02 20:57:39,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 243 [2023-12-02 20:58:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 20:58:04,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739391244] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:58:04,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:58:04,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 40 [2023-12-02 20:58:04,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252039560] [2023-12-02 20:58:04,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:58:04,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 20:58:04,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:58:04,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 20:58:04,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1300, Unknown=9, NotChecked=150, Total=1640 [2023-12-02 20:58:04,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:58:04,641 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:58:04,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.658536585365854) internal successors, (150), 40 states have internal predecessors, (150), 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) [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 171 states. [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 199 states. [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2023-12-02 20:58:04,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:59:53,303 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] [2023-12-02 21:00:01,254 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] [2023-12-02 21:00:03,258 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] [2023-12-02 21:00:05,262 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] [2023-12-02 21:00:15,694 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, 1] [2023-12-02 21:00:17,800 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, 1] [2023-12-02 21:00:19,802 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, 1] [2023-12-02 21:00:21,809 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, 1] [2023-12-02 21:00:24,657 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, 1] [2023-12-02 21:00:26,888 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, 1] [2023-12-02 21:00:29,135 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, 1] [2023-12-02 21:00:29,145 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~next_alloc_idx~0 2))) (let ((.cse0 (< c_~next_alloc_idx~0 65)) (.cse6 (= .cse5 0)) (.cse2 (< c_~next_alloc_idx~0 63)) (.cse3 (< 62 c_~next_alloc_idx~0)) (.cse7 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse1 (< 64 c_~next_alloc_idx~0)) (.cse9 (= c_~next_alloc_idx~0 0))) (and (<= 0 (div |c_thr1Thread1of3ForFork0_push_#t~mem2#1| 4294967296)) (or (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) 0)) (= 0 (select v_DerPreprocessor_12 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (or .cse1 (and (or .cse2 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_74 (Array Int Int)) (v_prenex_76 Int) (v_prenex_75 Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| Int) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= 0 (select (store |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| 1) v_prenex_76))) (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (= (select v_DerPreprocessor_12 v_prenex_75) 0) (< v_prenex_75 0) (not (= (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| v_DerPreprocessor_13) v_prenex_76 v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_74) v_prenex_76) v_prenex_75) 0)) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51|) 0)) (= (select v_DerPreprocessor_13 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (or .cse3 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| Int) (v_DerPreprocessor_13 (Array Int Int))) (or (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (let ((.cse4 (store |c_#memory_int| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| v_DerPreprocessor_13))) (store .cse4 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| (store (select .cse4 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| .cse5))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51|) 0)) (not (= (select (store |c_#valid| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| 1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) 0)) (= (select v_DerPreprocessor_13 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))) .cse6))) (<= |c_thr1Thread1of3ForFork0_push_#t~mem2#1| 3) (not (= c_~top~0 0)) (or (forall ((v_ArrVal_989 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) (= (select .cse7 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse0 (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= 0 (select v_DerPreprocessor_12 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0)))) (or (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 1)) .cse1 (and (or .cse3 .cse6 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| Int) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) 0)) (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (not (= (select (select (store (let ((.cse8 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13))) (store .cse8 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| (store (select .cse8 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| .cse5))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0) (= (select v_DerPreprocessor_13 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (or .cse2 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_74 (Array Int Int)) (v_prenex_76 Int) (v_prenex_75 Int) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (< |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (= (select v_DerPreprocessor_12 v_prenex_75) 0) (< v_prenex_75 0) (not (= (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) v_prenex_76 v_DerPreprocessor_12) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_74) v_prenex_76) v_prenex_75) 0)) (= (select v_DerPreprocessor_13 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select |c_#valid| v_prenex_76) 0))))))) (or .cse1 (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_50|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))) .cse9) (or .cse3 (and (or (< 60 c_~next_alloc_idx~0) (forall ((v_prenex_90 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54| Int) (v_prenex_91 Int)) (let ((.cse10 (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54| v_prenex_90))) (or (not (= (select (store .cse10 v_prenex_91 1) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)) (not (= (select .cse10 v_prenex_91) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54|) 0))))) (= (+ c_~next_alloc_idx~0 4) 0)) (or (forall ((v_ArrVal_982 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54| Int) (|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| Int)) (let ((.cse11 (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54| v_ArrVal_982))) (or (not (= (select .cse11 |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51|) 0)) (not (= 0 (select (store .cse11 |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_51| 1) |c_ULTIMATE.start_main_~#t~0#1.base|))) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_54|) 0))))) (< c_~next_alloc_idx~0 61)))) (or (forall ((v_ArrVal_989 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse7 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_989) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (< |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0))) .cse1 .cse9)))) is different from false [2023-12-02 21:00:33,777 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] [2023-12-02 21:00:35,805 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] [2023-12-02 21:00:39,957 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] [2023-12-02 21:00:44,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] [2023-12-02 21:00:46,232 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]