./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9a849f68 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --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 b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-9a849f6-m [2024-10-26 10:04:56,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-26 10:04:56,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf [2024-10-26 10:04:56,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-26 10:04:56,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-26 10:04:56,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-26 10:04:56,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-26 10:04:56,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-26 10:04:56,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-26 10:04:56,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-26 10:04:56,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-26 10:04:56,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-26 10:04:56,686 INFO L153 SettingsManager]: * Use SBE=true [2024-10-26 10:04:56,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-26 10:04:56,687 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-26 10:04:56,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-26 10:04:56,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-26 10:04:56,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-26 10:04:56,688 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-26 10:04:56,688 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-26 10:04:56,688 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-26 10:04:56,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-26 10:04:56,690 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-26 10:04:56,690 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-26 10:04:56,690 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-26 10:04:56,691 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-26 10:04:56,691 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-26 10:04:56,691 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-26 10:04:56,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-26 10:04:56,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-26 10:04:56,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-26 10:04:56,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 10:04:56,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-26 10:04:56,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-26 10:04:56,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-26 10:04:56,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-26 10:04:56,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-26 10:04:56,695 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-10-26 10:04:56,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-26 10:04:56,695 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-26 10:04:56,695 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-26 10:04:56,695 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:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux 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 -> b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430 [2024-10-26 10:04:56,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-26 10:04:56,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-26 10:04:56,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-26 10:04:56,945 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-26 10:04:56,945 INFO L274 PluginConnector]: CDTParser initialized [2024-10-26 10:04:56,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2024-10-26 10:04:58,298 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-26 10:04:58,549 INFO L384 CDTParser]: Found 1 translation units. [2024-10-26 10:04:58,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2024-10-26 10:04:58,573 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3def38b5c/46d6f5109b8442bdba7cca0347ac67be/FLAG39f8a4a2c [2024-10-26 10:04:58,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3def38b5c/46d6f5109b8442bdba7cca0347ac67be [2024-10-26 10:04:58,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-26 10:04:58,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-26 10:04:58,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-26 10:04:58,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-26 10:04:58,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-26 10:04:58,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:04:58" (1/1) ... [2024-10-26 10:04:58,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2433792d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:04:58, skipping insertion in model container [2024-10-26 10:04:58,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:04:58" (1/1) ... [2024-10-26 10:04:58,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-26 10:04:59,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 10:04:59,176 INFO L200 MainTranslator]: Completed pre-run [2024-10-26 10:04:59,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 10:04:59,286 INFO L204 MainTranslator]: Completed translation [2024-10-26 10:04:59,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:04:59 WrapperNode [2024-10-26 10:04:59,286 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-26 10:04:59,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-26 10:04:59,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-26 10:04:59,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-26 10:04:59,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:04:59" (1/1) ... [2024-10-26 10:04:59,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:04:59" (1/1) ... [2024-10-26 10:04:59,349 INFO L138 Inliner]: procedures = 370, calls = 86, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 180 [2024-10-26 10:04:59,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-26 10:04:59,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-26 10:04:59,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-26 10:04:59,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-26 10:04:59,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:04:59" (1/1) ... [2024-10-26 10:04:59,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:04:59" (1/1) ... [2024-10-26 10:04:59,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:04:59" (1/1) ... [2024-10-26 10:04:59,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:04:59" (1/1) ... [2024-10-26 10:04:59,386 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:04:59" (1/1) ... [2024-10-26 10:04:59,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:04:59" (1/1) ... [2024-10-26 10:04:59,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:04:59" (1/1) ... [2024-10-26 10:04:59,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:04:59" (1/1) ... [2024-10-26 10:04:59,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-26 10:04:59,403 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-26 10:04:59,403 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-26 10:04:59,404 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-26 10:04:59,408 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:04:59" (1/1) ... [2024-10-26 10:04:59,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 10:04:59,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 10:04:59,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-26 10:04:59,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-26 10:04:59,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-10-26 10:04:59,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-10-26 10:04:59,489 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-26 10:04:59,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-26 10:04:59,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-26 10:04:59,489 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-26 10:04:59,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-26 10:04:59,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-26 10:04:59,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-26 10:04:59,490 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-26 10:04:59,490 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-26 10:04:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-26 10:04:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-26 10:04:59,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-26 10:04:59,493 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-26 10:04:59,634 INFO L238 CfgBuilder]: Building ICFG [2024-10-26 10:04:59,636 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-26 10:05:00,057 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-26 10:05:00,057 INFO L287 CfgBuilder]: Performing block encoding [2024-10-26 10:05:00,388 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-26 10:05:00,389 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-26 10:05:00,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:05:00 BoogieIcfgContainer [2024-10-26 10:05:00,389 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-26 10:05:00,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-26 10:05:00,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-26 10:05:00,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-26 10:05:00,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:04:58" (1/3) ... [2024-10-26 10:05:00,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f4c81b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:05:00, skipping insertion in model container [2024-10-26 10:05:00,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:04:59" (2/3) ... [2024-10-26 10:05:00,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f4c81b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:05:00, skipping insertion in model container [2024-10-26 10:05:00,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:05:00" (3/3) ... [2024-10-26 10:05:00,398 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_17-arrayloop_nr.i [2024-10-26 10:05:00,415 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-26 10:05:00,415 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-10-26 10:05:00,416 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-26 10:05:00,465 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-26 10:05:00,504 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 10:05:00,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 10:05:00,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 10:05:00,508 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-26 10:05:00,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-26 10:05:00,549 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 10:05:00,561 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-26 10:05:00,567 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@6f20bd85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 10:05:00,567 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-26 10:05:00,841 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 [2024-10-26 10:05:00,856 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 [2024-10-26 10:05:00,876 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 [2024-10-26 10:05:00,907 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 [2024-10-26 10:05:00,930 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 [2024-10-26 10:05:00,940 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 [2024-10-26 10:05:00,947 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-26 10:05:00,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 10:05:00,952 INFO L85 PathProgramCache]: Analyzing trace with hash 561881054, now seen corresponding path program 1 times [2024-10-26 10:05:00,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 10:05:00,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803567924] [2024-10-26 10:05:00,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 10:05:00,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 10:05:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 10:05:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 10:05:01,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 10:05:01,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803567924] [2024-10-26 10:05:01,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803567924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 10:05:01,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 10:05:01,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 10:05:01,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902948252] [2024-10-26 10:05:01,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 10:05:01,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 10:05:01,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 10:05:01,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 10:05:01,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 10:05:01,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:05:01,316 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 10:05:01,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-10-26 10:05:01,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:05:01,413 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 [2024-10-26 10:05:01,441 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 [2024-10-26 10:05:01,461 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 [2024-10-26 10:05:01,471 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 [2024-10-26 10:05:01,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:01,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-26 10:05:01,479 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-26 10:05:01,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 10:05:01,481 INFO L85 PathProgramCache]: Analyzing trace with hash -639058522, now seen corresponding path program 1 times [2024-10-26 10:05:01,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 10:05:01,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372600696] [2024-10-26 10:05:01,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 10:05:01,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 10:05:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 10:05:01,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 10:05:01,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 10:05:01,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372600696] [2024-10-26 10:05:01,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372600696] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 10:05:01,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753239779] [2024-10-26 10:05:01,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 10:05:01,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 10:05:01,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 10:05:01,671 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 10:05:01,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-26 10:05:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 10:05:01,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-26 10:05:01,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 10:05:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-26 10:05:01,849 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 10:05:01,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753239779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 10:05:01,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-26 10:05:01,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2024-10-26 10:05:01,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150903027] [2024-10-26 10:05:01,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 10:05:01,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 10:05:01,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 10:05:01,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 10:05:01,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-26 10:05:01,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:05:01,854 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 10:05:01,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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) [2024-10-26 10:05:01,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:01,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:05:02,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:02,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:02,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-26 10:05:02,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-26 10:05:02,283 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-26 10:05:02,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 10:05:02,284 INFO L85 PathProgramCache]: Analyzing trace with hash -639058521, now seen corresponding path program 1 times [2024-10-26 10:05:02,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 10:05:02,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726672543] [2024-10-26 10:05:02,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 10:05:02,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 10:05:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 10:05:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 10:05:02,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 10:05:02,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726672543] [2024-10-26 10:05:02,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726672543] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 10:05:02,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576834966] [2024-10-26 10:05:02,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 10:05:02,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 10:05:02,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 10:05:02,380 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 10:05:02,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-26 10:05:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 10:05:02,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-26 10:05:02,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 10:05:02,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 10:05:02,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 10:05:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 10:05:02,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576834966] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 10:05:02,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 10:05:02,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-26 10:05:02,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790720285] [2024-10-26 10:05:02,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 10:05:02,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-26 10:05:02,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 10:05:02,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-26 10:05:02,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-26 10:05:02,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:05:02,582 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 10:05:02,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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) [2024-10-26 10:05:02,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:02,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:02,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:05:02,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:02,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:02,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 10:05:02,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-26 10:05:02,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 10:05:02,843 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-26 10:05:02,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 10:05:02,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1509506815, now seen corresponding path program 2 times [2024-10-26 10:05:02,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 10:05:02,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762784737] [2024-10-26 10:05:02,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 10:05:02,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 10:05:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 10:05:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 10:05:03,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 10:05:03,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762784737] [2024-10-26 10:05:03,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762784737] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 10:05:03,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469744276] [2024-10-26 10:05:03,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 10:05:03,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 10:05:03,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 10:05:03,092 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 10:05:03,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-26 10:05:03,223 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-26 10:05:03,223 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 10:05:03,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-26 10:05:03,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 10:05:03,237 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 [2024-10-26 10:05:03,251 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-26 10:05:03,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 10:05:03,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469744276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 10:05:03,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-26 10:05:03,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2024-10-26 10:05:03,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739872362] [2024-10-26 10:05:03,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 10:05:03,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 10:05:03,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 10:05:03,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 10:05:03,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-26 10:05:03,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:05:03,254 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 10:05:03,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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) [2024-10-26 10:05:03,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:03,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:03,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 10:05:03,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:05:03,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:03,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:03,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 10:05:03,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:03,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-26 10:05:03,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 10:05:03,768 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-26 10:05:03,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 10:05:03,768 INFO L85 PathProgramCache]: Analyzing trace with hash -449928433, now seen corresponding path program 1 times [2024-10-26 10:05:03,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 10:05:03,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583707158] [2024-10-26 10:05:03,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 10:05:03,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 10:05:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 10:05:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 10:05:03,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 10:05:03,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583707158] [2024-10-26 10:05:03,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583707158] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 10:05:03,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490595738] [2024-10-26 10:05:03,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 10:05:03,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 10:05:03,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 10:05:03,956 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 10:05:03,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-26 10:05:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 10:05:04,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-26 10:05:04,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 10:05:04,155 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 10:05:04,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 10:05:04,218 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 10:05:04,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490595738] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 10:05:04,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 10:05:04,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-26 10:05:04,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446426673] [2024-10-26 10:05:04,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 10:05:04,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-26 10:05:04,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 10:05:04,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-26 10:05:04,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-26 10:05:04,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:05:04,222 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 10:05:04,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 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) [2024-10-26 10:05:04,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:04,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:04,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 10:05:04,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:04,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:05:04,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:04,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:04,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 10:05:04,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:04,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 10:05:04,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-26 10:05:04,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 10:05:04,510 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-26 10:05:04,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 10:05:04,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1031553631, now seen corresponding path program 2 times [2024-10-26 10:05:04,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 10:05:04,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482246703] [2024-10-26 10:05:04,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 10:05:04,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 10:05:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 10:05:04,903 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-26 10:05:04,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 10:05:04,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482246703] [2024-10-26 10:05:04,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482246703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 10:05:04,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 10:05:04,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-26 10:05:04,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138660245] [2024-10-26 10:05:04,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 10:05:04,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-26 10:05:04,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 10:05:04,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-26 10:05:04,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-26 10:05:04,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:05:04,906 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 10:05:04,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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) [2024-10-26 10:05:04,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:04,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:04,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 10:05:04,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:04,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 10:05:04,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:05:05,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:05,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:05,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 10:05:05,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:05,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 10:05:05,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:05,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-26 10:05:05,014 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-26 10:05:05,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 10:05:05,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1031553632, now seen corresponding path program 1 times [2024-10-26 10:05:05,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 10:05:05,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590804493] [2024-10-26 10:05:05,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 10:05:05,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 10:05:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 10:05:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 144 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 10:05:05,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 10:05:05,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590804493] [2024-10-26 10:05:05,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590804493] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 10:05:05,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170951462] [2024-10-26 10:05:05,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 10:05:05,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 10:05:05,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 10:05:05,971 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 10:05:05,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-26 10:05:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 10:05:06,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-26 10:05:06,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 10:05:06,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 10:05:06,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 [2024-10-26 10:05:06,471 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 10:05:06,472 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 [2024-10-26 10:05:06,489 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 10:05:06,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 10:05:06,691 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 52 treesize of output 48 [2024-10-26 10:05:06,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 10:05:06,707 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 46 treesize of output 64 [2024-10-26 10:05:07,042 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 10:05:07,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170951462] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 10:05:07,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 10:05:07,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2024-10-26 10:05:07,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728638017] [2024-10-26 10:05:07,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 10:05:07,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-26 10:05:07,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 10:05:07,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-26 10:05:07,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=515, Unknown=0, NotChecked=0, Total=756 [2024-10-26 10:05:07,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:05:07,047 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 10:05:07,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 27 states have internal predecessors, (102), 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) [2024-10-26 10:05:07,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:07,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:07,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 10:05:07,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:07,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 10:05:07,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:07,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:05:07,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:07,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:07,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 10:05:07,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:07,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 10:05:07,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:05:07,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 10:05:07,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-26 10:05:07,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 10:05:07,878 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-26 10:05:07,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 10:05:07,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1913392081, now seen corresponding path program 1 times [2024-10-26 10:05:07,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 10:05:07,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904268322] [2024-10-26 10:05:07,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 10:05:07,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 10:05:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 10:05:15,124 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 50 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 10:05:15,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 10:05:15,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904268322] [2024-10-26 10:05:15,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904268322] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 10:05:15,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110851535] [2024-10-26 10:05:15,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 10:05:15,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 10:05:15,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 10:05:15,127 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 10:05:15,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-26 10:05:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 10:05:15,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 1065 conjuncts, 139 conjuncts are in the unsatisfiable core [2024-10-26 10:05:15,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 10:05:15,449 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 [2024-10-26 10:05:15,472 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 15 treesize of output 1 [2024-10-26 10:05:15,498 INFO L349 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2024-10-26 10:05:15,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2024-10-26 10:05:15,569 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 26 treesize of output 19 [2024-10-26 10:05:15,596 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 26 treesize of output 19 [2024-10-26 10:05:15,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 10:05:15,675 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 37 treesize of output 17 [2024-10-26 10:05:15,791 INFO L349 Elim1Store]: treesize reduction 78, result has 31.6 percent of original size [2024-10-26 10:05:15,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 31 treesize of output 53 [2024-10-26 10:05:15,881 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 34 treesize of output 25 [2024-10-26 10:05:15,909 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 34 treesize of output 25 [2024-10-26 10:05:15,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 10:05:15,986 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 45 treesize of output 21 [2024-10-26 10:05:16,113 INFO L349 Elim1Store]: treesize reduction 96, result has 31.9 percent of original size [2024-10-26 10:05:16,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 65 [2024-10-26 10:05:16,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2024-10-26 10:05:16,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2024-10-26 10:05:16,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 10:05:16,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 25 [2024-10-26 10:05:16,577 INFO L349 Elim1Store]: treesize reduction 114, result has 32.1 percent of original size [2024-10-26 10:05:16,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 41 treesize of output 77 [2024-10-26 10:05:16,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 37 [2024-10-26 10:05:16,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 37 [2024-10-26 10:05:17,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 10:05:17,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 29 [2024-10-26 10:05:17,270 INFO L349 Elim1Store]: treesize reduction 132, result has 32.3 percent of original size [2024-10-26 10:05:17,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 46 treesize of output 89 [2024-10-26 10:05:17,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 43 [2024-10-26 10:05:17,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 43 [2024-10-26 10:05:17,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 10:05:17,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 33 [2024-10-26 10:05:18,251 INFO L349 Elim1Store]: treesize reduction 150, result has 32.4 percent of original size [2024-10-26 10:05:18,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 20 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 101 [2024-10-26 10:05:18,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 49 [2024-10-26 10:05:18,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 49 [2024-10-26 10:05:19,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 10:05:19,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 37 [2024-10-26 10:05:20,127 INFO L349 Elim1Store]: treesize reduction 168, result has 32.5 percent of original size [2024-10-26 10:05:20,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 27 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 56 treesize of output 113 [2024-10-26 10:05:21,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 55 [2024-10-26 10:05:21,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 55 [2024-10-26 10:05:28,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 10:05:28,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 41 [2024-10-26 10:05:30,349 INFO L349 Elim1Store]: treesize reduction 186, result has 32.6 percent of original size [2024-10-26 10:05:30,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 35 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 19 case distinctions, treesize of input 61 treesize of output 125 [2024-10-26 10:05:41,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 61 [2024-10-26 10:05:41,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 61 [2024-10-26 10:05:59,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 10:05:59,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 45 [2024-10-26 10:06:10,826 INFO L349 Elim1Store]: treesize reduction 204, result has 32.7 percent of original size [2024-10-26 10:06:10,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 44 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 66 treesize of output 137 [2024-10-26 10:06:35,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 67 [2024-10-26 10:06:35,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 67 [2024-10-26 10:07:04,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 10:07:04,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 49 [2024-10-26 10:08:10,306 INFO L349 Elim1Store]: treesize reduction 222, result has 32.7 percent of original size [2024-10-26 10:08:10,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 54 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 23 case distinctions, treesize of input 71 treesize of output 149 [2024-10-26 10:08:18,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 19 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 73 [2024-10-26 10:08:18,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 19 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 73 [2024-10-26 10:08:34,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 49 [2024-10-26 10:08:35,101 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 138 proven. 46 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 10:08:35,102 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 10:08:35,149 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_1765) |c_~#slot~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 4) |c_~#slot~0.offset|))) 1)) is different from false [2024-10-26 10:10:12,602 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 10:10:12,602 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 10:10:12,603 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 10:10:12,604 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 10:10:12,605 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 10:10:12,607 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 10:10:12,609 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 10:10:12,611 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 10:10:12,613 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 10:10:12,619 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 10:10:12,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 10:10:12,640 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 117 treesize of output 118 [2024-10-26 10:10:12,649 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 10:10:12,653 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 115 treesize of output 111 [2024-10-26 10:10:19,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 10:10:19,251 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 395858545737728 treesize of output 395824185999362 [2024-10-26 10:10:38,067 WARN L286 SmtUtils]: Spent 18.61s on a formula simplification. DAG size of input: 74007 DAG size of output: 265 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-26 10:12:10,820 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-10-26 10:12:10,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-10-26 10:12:10,822 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-10-26 10:12:10,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-26 10:12:11,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-26 10:12:11,023 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2024-10-26 10:12:11,027 INFO L158 Benchmark]: Toolchain (without parser) took 432436.23ms. Allocated memory was 192.9MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 119.8MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 614.9MB. Max. memory is 16.1GB. [2024-10-26 10:12:11,027 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 150.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-26 10:12:11,028 INFO L158 Benchmark]: CACSL2BoogieTranslator took 693.41ms. Allocated memory is still 192.9MB. Free memory was 119.6MB in the beginning and 131.7MB in the end (delta: -12.1MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2024-10-26 10:12:11,028 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.04ms. Allocated memory is still 192.9MB. Free memory was 131.7MB in the beginning and 127.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-26 10:12:11,030 INFO L158 Benchmark]: Boogie Preprocessor took 52.58ms. Allocated memory is still 192.9MB. Free memory was 127.5MB in the beginning and 125.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-26 10:12:11,030 INFO L158 Benchmark]: RCFGBuilder took 986.38ms. Allocated memory is still 192.9MB. Free memory was 125.4MB in the beginning and 126.4MB in the end (delta: -954.0kB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2024-10-26 10:12:11,031 INFO L158 Benchmark]: TraceAbstraction took 430636.08ms. Allocated memory was 192.9MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 125.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 620.1MB. Max. memory is 16.1GB. [2024-10-26 10:12:11,032 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 150.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 693.41ms. Allocated memory is still 192.9MB. Free memory was 119.6MB in the beginning and 131.7MB in the end (delta: -12.1MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.04ms. Allocated memory is still 192.9MB. Free memory was 131.7MB in the beginning and 127.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.58ms. Allocated memory is still 192.9MB. Free memory was 127.5MB in the beginning and 125.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 986.38ms. Allocated memory is still 192.9MB. Free memory was 125.4MB in the beginning and 126.4MB in the end (delta: -954.0kB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * TraceAbstraction took 430636.08ms. Allocated memory was 192.9MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 125.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 620.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-26 10:12:11,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --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 b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-9a849f6-m [2024-10-26 10:12:13,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-26 10:12:13,391 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Bitvector.epf [2024-10-26 10:12:13,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-26 10:12:13,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-26 10:12:13,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-26 10:12:13,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-26 10:12:13,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-26 10:12:13,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-26 10:12:13,433 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-26 10:12:13,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-26 10:12:13,434 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-26 10:12:13,434 INFO L153 SettingsManager]: * Use SBE=true [2024-10-26 10:12:13,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-26 10:12:13,436 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-26 10:12:13,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-26 10:12:13,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-26 10:12:13,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-26 10:12:13,437 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-26 10:12:13,438 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-26 10:12:13,438 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-26 10:12:13,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-26 10:12:13,439 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-26 10:12:13,439 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-26 10:12:13,439 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-26 10:12:13,440 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-26 10:12:13,440 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-26 10:12:13,440 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-26 10:12:13,441 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-26 10:12:13,441 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-26 10:12:13,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-26 10:12:13,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-26 10:12:13,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-26 10:12:13,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 10:12:13,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-26 10:12:13,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-26 10:12:13,442 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-26 10:12:13,443 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-26 10:12:13,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-26 10:12:13,443 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-10-26 10:12:13,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-26 10:12:13,444 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-26 10:12:13,444 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-26 10:12:13,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-26 10:12:13,445 INFO L153 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux 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 -> b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430 [2024-10-26 10:12:13,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-26 10:12:13,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-26 10:12:13,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-26 10:12:13,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-26 10:12:13,782 INFO L274 PluginConnector]: CDTParser initialized [2024-10-26 10:12:13,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2024-10-26 10:12:15,202 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-26 10:12:15,493 INFO L384 CDTParser]: Found 1 translation units. [2024-10-26 10:12:15,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2024-10-26 10:12:15,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5a75a783b/e2c027d3231c45d8b52454eb73a80c3f/FLAGd6b6fe33d [2024-10-26 10:12:15,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5a75a783b/e2c027d3231c45d8b52454eb73a80c3f [2024-10-26 10:12:15,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-26 10:12:15,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-26 10:12:15,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-26 10:12:15,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-26 10:12:15,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-26 10:12:15,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:12:15" (1/1) ... [2024-10-26 10:12:15,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e4a7656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:12:15, skipping insertion in model container [2024-10-26 10:12:15,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:12:15" (1/1) ... [2024-10-26 10:12:15,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-26 10:12:16,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 10:12:16,458 INFO L200 MainTranslator]: Completed pre-run [2024-10-26 10:12:16,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 10:12:16,620 INFO L204 MainTranslator]: Completed translation [2024-10-26 10:12:16,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:12:16 WrapperNode [2024-10-26 10:12:16,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-26 10:12:16,622 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-26 10:12:16,622 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-26 10:12:16,622 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-26 10:12:16,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:12:16" (1/1) ... [2024-10-26 10:12:16,656 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:12:16" (1/1) ... [2024-10-26 10:12:16,693 INFO L138 Inliner]: procedures = 371, calls = 86, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 181 [2024-10-26 10:12:16,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-26 10:12:16,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-26 10:12:16,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-26 10:12:16,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-26 10:12:16,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:12:16" (1/1) ... [2024-10-26 10:12:16,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:12:16" (1/1) ... [2024-10-26 10:12:16,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:12:16" (1/1) ... [2024-10-26 10:12:16,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:12:16" (1/1) ... [2024-10-26 10:12:16,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:12:16" (1/1) ... [2024-10-26 10:12:16,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:12:16" (1/1) ... [2024-10-26 10:12:16,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:12:16" (1/1) ... [2024-10-26 10:12:16,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:12:16" (1/1) ... [2024-10-26 10:12:16,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-26 10:12:16,767 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-26 10:12:16,767 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-26 10:12:16,767 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-26 10:12:16,769 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:12:16" (1/1) ... [2024-10-26 10:12:16,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 10:12:16,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 10:12:16,801 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-26 10:12:16,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-26 10:12:16,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-10-26 10:12:16,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-10-26 10:12:16,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-10-26 10:12:16,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-10-26 10:12:16,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-10-26 10:12:16,836 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-26 10:12:16,836 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-26 10:12:16,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-26 10:12:16,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-26 10:12:16,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-26 10:12:16,836 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-26 10:12:16,836 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-26 10:12:16,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-26 10:12:16,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-26 10:12:16,838 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-26 10:12:17,013 INFO L238 CfgBuilder]: Building ICFG [2024-10-26 10:12:17,015 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-26 10:12:17,637 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-26 10:12:17,637 INFO L287 CfgBuilder]: Performing block encoding [2024-10-26 10:12:18,076 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-26 10:12:18,077 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-26 10:12:18,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:12:18 BoogieIcfgContainer [2024-10-26 10:12:18,077 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-26 10:12:18,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-26 10:12:18,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-26 10:12:18,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-26 10:12:18,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:12:15" (1/3) ... [2024-10-26 10:12:18,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65c5edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:12:18, skipping insertion in model container [2024-10-26 10:12:18,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:12:16" (2/3) ... [2024-10-26 10:12:18,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65c5edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:12:18, skipping insertion in model container [2024-10-26 10:12:18,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:12:18" (3/3) ... [2024-10-26 10:12:18,086 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_17-arrayloop_nr.i [2024-10-26 10:12:18,100 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-26 10:12:18,101 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-10-26 10:12:18,101 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-26 10:12:18,167 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-26 10:12:18,207 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 10:12:18,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 10:12:18,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 10:12:18,210 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-26 10:12:18,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-26 10:12:18,245 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 10:12:18,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-26 10:12:18,261 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@7bfe3075, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 10:12:18,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-26 10:12:18,558 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 [2024-10-26 10:12:18,583 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 [2024-10-26 10:12:18,631 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 [2024-10-26 10:12:18,676 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 [2024-10-26 10:12:18,722 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 [2024-10-26 10:12:18,736 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 [2024-10-26 10:12:18,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-26 10:12:18,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 10:12:18,756 INFO L85 PathProgramCache]: Analyzing trace with hash -2028200224, now seen corresponding path program 1 times [2024-10-26 10:12:18,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-26 10:12:18,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529088571] [2024-10-26 10:12:18,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 10:12:18,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-26 10:12:18,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-26 10:12:18,782 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-26 10:12:18,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-26 10:12:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 10:12:18,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-26 10:12:18,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 10:12:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 10:12:18,911 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 10:12:18,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-26 10:12:18,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529088571] [2024-10-26 10:12:18,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529088571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 10:12:18,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 10:12:18,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 10:12:18,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705679575] [2024-10-26 10:12:18,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 10:12:18,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 10:12:18,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-26 10:12:18,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 10:12:18,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 10:12:18,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:12:18,942 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 10:12:18,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-10-26 10:12:18,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:12:19,072 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 [2024-10-26 10:12:19,137 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 [2024-10-26 10:12:19,175 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 [2024-10-26 10:12:19,198 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 [2024-10-26 10:12:19,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:19,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-26 10:12:19,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-26 10:12:19,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-26 10:12:19,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 10:12:19,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1045224488, now seen corresponding path program 1 times [2024-10-26 10:12:19,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-26 10:12:19,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [638256204] [2024-10-26 10:12:19,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 10:12:19,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-26 10:12:19,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-26 10:12:19,430 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-26 10:12:19,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-26 10:12:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 10:12:19,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-26 10:12:19,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 10:12:19,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 10:12:19,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 10:12:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 10:12:19,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-26 10:12:19,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [638256204] [2024-10-26 10:12:19,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [638256204] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 10:12:19,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-26 10:12:19,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-10-26 10:12:19,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033513682] [2024-10-26 10:12:19,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-26 10:12:19,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 10:12:19,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-26 10:12:19,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 10:12:19,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-26 10:12:19,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:12:19,604 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 10:12:19,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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) [2024-10-26 10:12:19,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:19,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:12:19,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:19,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 10:12:19,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-26 10:12:19,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-26 10:12:19,953 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-26 10:12:19,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 10:12:19,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1225243648, now seen corresponding path program 2 times [2024-10-26 10:12:19,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-26 10:12:19,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821445881] [2024-10-26 10:12:19,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 10:12:19,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-26 10:12:19,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-26 10:12:19,960 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-26 10:12:19,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-26 10:12:20,075 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-26 10:12:20,076 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 10:12:20,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-26 10:12:20,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 10:12:20,088 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 7 [2024-10-26 10:12:20,095 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-26 10:12:20,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 10:12:20,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-26 10:12:20,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821445881] [2024-10-26 10:12:20,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821445881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 10:12:20,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 10:12:20,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 10:12:20,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512159145] [2024-10-26 10:12:20,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 10:12:20,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 10:12:20,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-26 10:12:20,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 10:12:20,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 10:12:20,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:12:20,099 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 10:12:20,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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) [2024-10-26 10:12:20,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:20,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 10:12:20,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:12:20,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:20,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 10:12:20,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:20,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-26 10:12:20,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-26 10:12:20,654 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-26 10:12:20,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 10:12:20,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1225243649, now seen corresponding path program 1 times [2024-10-26 10:12:20,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-26 10:12:20,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393311469] [2024-10-26 10:12:20,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 10:12:20,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-26 10:12:20,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-26 10:12:20,658 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-26 10:12:20,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-26 10:12:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 10:12:20,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-26 10:12:20,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 10:12:20,933 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 10:12:20,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 10:12:21,032 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 10:12:21,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-26 10:12:21,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393311469] [2024-10-26 10:12:21,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393311469] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 10:12:21,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-26 10:12:21,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-26 10:12:21,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744494631] [2024-10-26 10:12:21,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-26 10:12:21,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-26 10:12:21,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-26 10:12:21,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-26 10:12:21,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-26 10:12:21,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:12:21,036 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 10:12:21,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 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) [2024-10-26 10:12:21,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:21,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 10:12:21,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:21,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:12:21,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:21,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 10:12:21,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:21,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 10:12:21,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-26 10:12:21,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-26 10:12:21,711 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-26 10:12:21,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 10:12:21,711 INFO L85 PathProgramCache]: Analyzing trace with hash 109604785, now seen corresponding path program 2 times [2024-10-26 10:12:21,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-26 10:12:21,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220659890] [2024-10-26 10:12:21,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 10:12:21,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-26 10:12:21,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-26 10:12:21,714 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-26 10:12:21,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-26 10:12:21,866 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-26 10:12:21,866 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 10:12:21,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-26 10:12:21,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 10:12:21,880 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 [2024-10-26 10:12:21,894 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-26 10:12:21,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 10:12:21,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-26 10:12:21,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220659890] [2024-10-26 10:12:21,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220659890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 10:12:21,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 10:12:21,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 10:12:21,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086632730] [2024-10-26 10:12:21,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 10:12:21,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 10:12:21,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-26 10:12:21,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 10:12:21,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 10:12:21,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:12:21,897 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 10:12:21,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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) [2024-10-26 10:12:21,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:21,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 10:12:21,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:21,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 10:12:21,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:12:22,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:22,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 10:12:22,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:22,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 10:12:22,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:22,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-26 10:12:22,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-26 10:12:22,639 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-26 10:12:22,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 10:12:22,640 INFO L85 PathProgramCache]: Analyzing trace with hash -897218401, now seen corresponding path program 1 times [2024-10-26 10:12:22,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-26 10:12:22,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37459201] [2024-10-26 10:12:22,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 10:12:22,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-26 10:12:22,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-26 10:12:22,644 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-26 10:12:22,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-26 10:12:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 10:12:23,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-26 10:12:23,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 10:12:23,248 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 [2024-10-26 10:12:23,281 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-26 10:12:23,281 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 14 treesize of output 20 [2024-10-26 10:12:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-26 10:12:23,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 10:12:23,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-26 10:12:23,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37459201] [2024-10-26 10:12:23,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37459201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 10:12:23,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 10:12:23,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 10:12:23,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47958176] [2024-10-26 10:12:23,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 10:12:23,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 10:12:23,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-26 10:12:23,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 10:12:23,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 10:12:23,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:12:23,303 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 10:12:23,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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) [2024-10-26 10:12:23,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:23,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 10:12:23,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:23,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 10:12:23,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:23,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:12:23,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:23,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 10:12:23,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:23,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 10:12:23,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:23,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:23,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-26 10:12:23,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-26 10:12:23,736 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-26 10:12:23,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 10:12:23,736 INFO L85 PathProgramCache]: Analyzing trace with hash -897218400, now seen corresponding path program 1 times [2024-10-26 10:12:23,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-26 10:12:23,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238632501] [2024-10-26 10:12:23,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 10:12:23,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-26 10:12:23,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-26 10:12:23,740 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-26 10:12:23,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-26 10:12:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 10:12:24,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-26 10:12:24,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 10:12:24,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 10:12:24,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-26 10:12:24,609 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-26 10:12:24,609 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 13 treesize of output 13 [2024-10-26 10:12:24,642 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 10:12:24,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 10:12:25,141 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 53 treesize of output 49 [2024-10-26 10:12:25,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 10:12:25,189 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 48 treesize of output 72 [2024-10-26 10:12:26,180 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 10:12:26,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-26 10:12:26,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238632501] [2024-10-26 10:12:26,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238632501] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 10:12:26,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-26 10:12:26,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2024-10-26 10:12:26,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498929914] [2024-10-26 10:12:26,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-26 10:12:26,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-26 10:12:26,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-26 10:12:26,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-26 10:12:26,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2024-10-26 10:12:26,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:12:26,184 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 10:12:26,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 27 states have internal predecessors, (100), 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) [2024-10-26 10:12:26,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:26,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 10:12:26,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:26,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 10:12:26,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:26,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:26,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:12:29,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:29,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 10:12:29,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:29,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 10:12:29,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:29,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:29,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 10:12:29,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-26 10:12:29,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-26 10:12:29,261 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-26 10:12:29,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 10:12:29,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1235363229, now seen corresponding path program 1 times [2024-10-26 10:12:29,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-26 10:12:29,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326348248] [2024-10-26 10:12:29,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 10:12:29,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-26 10:12:29,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-26 10:12:29,264 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-26 10:12:29,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-26 10:12:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 10:12:29,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 1317 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-26 10:12:29,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 10:12:29,933 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 410 proven. 190 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-26 10:12:29,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 10:12:30,244 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 410 proven. 190 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-26 10:12:30,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-26 10:12:30,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326348248] [2024-10-26 10:12:30,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326348248] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 10:12:30,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-26 10:12:30,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2024-10-26 10:12:30,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270642031] [2024-10-26 10:12:30,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-26 10:12:30,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-26 10:12:30,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-26 10:12:30,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-26 10:12:30,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2024-10-26 10:12:30,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:12:30,249 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 10:12:30,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 23 states have internal predecessors, (98), 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) [2024-10-26 10:12:30,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:30,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 10:12:30,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:30,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 10:12:30,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:30,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:30,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 10:12:30,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 10:12:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 10:12:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 10:12:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 10:12:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 10:12:31,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-26 10:12:31,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-26 10:12:31,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-26 10:12:31,548 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2024-10-26 10:12:31,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 10:12:31,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2043966061, now seen corresponding path program 2 times [2024-10-26 10:12:31,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-26 10:12:31,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058926693] [2024-10-26 10:12:31,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 10:12:31,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-26 10:12:31,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-26 10:12:31,550 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-26 10:12:31,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-26 10:12:32,523 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 10:12:32,523 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 10:12:32,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-10-26 10:12:32,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 10:12:32,570 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-26 10:12:32,570 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 22 [2024-10-26 10:12:32,688 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 15 treesize of output 1 [2024-10-26 10:12:32,765 INFO L349 Elim1Store]: treesize reduction 112, result has 27.3 percent of original size [2024-10-26 10:12:32,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 45 treesize of output 66 [2024-10-26 10:12:32,829 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 44 treesize of output 35 [2024-10-26 10:12:32,874 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 44 treesize of output 35 [2024-10-26 10:12:32,937 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 67 treesize of output 43 [2024-10-26 10:12:33,074 INFO L349 Elim1Store]: treesize reduction 102, result has 33.8 percent of original size [2024-10-26 10:12:33,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 54 treesize of output 85 [2024-10-26 10:12:33,185 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 77 treesize of output 60 [2024-10-26 10:12:33,240 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 77 treesize of output 60 [2024-10-26 10:12:33,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 10:12:33,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 32 [2024-10-26 10:12:33,409 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-10-26 10:12:33,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2024-10-26 10:12:33,477 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 52 treesize of output 39 [2024-10-26 10:12:33,504 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 52 treesize of output 39 [2024-10-26 10:12:33,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 10:12:33,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 32 [2024-10-26 10:12:33,631 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-10-26 10:12:33,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2024-10-26 10:12:33,704 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 52 treesize of output 39 [2024-10-26 10:12:33,733 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 52 treesize of output 39 [2024-10-26 10:12:33,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 10:12:33,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 32 [2024-10-26 10:12:33,874 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-10-26 10:12:33,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2024-10-26 10:12:33,959 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 52 treesize of output 39 [2024-10-26 10:12:33,990 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 52 treesize of output 39 [2024-10-26 10:12:34,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 10:12:34,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 32 [2024-10-26 10:12:34,116 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-10-26 10:12:34,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2024-10-26 10:12:34,198 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 52 treesize of output 39 [2024-10-26 10:12:34,221 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 52 treesize of output 39 [2024-10-26 10:12:34,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 10:12:34,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 32 [2024-10-26 10:12:34,353 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-10-26 10:12:34,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2024-10-26 10:12:34,414 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 52 treesize of output 39 [2024-10-26 10:12:34,444 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 52 treesize of output 39 [2024-10-26 10:12:34,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 42 [2024-10-26 10:12:34,619 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-10-26 10:12:34,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2024-10-26 10:12:34,713 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 76 treesize of output 57 [2024-10-26 10:12:34,746 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 76 treesize of output 57 [2024-10-26 10:12:34,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 10:12:34,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 79 treesize of output 49 [2024-10-26 10:12:34,868 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-10-26 10:12:34,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2024-10-26 10:12:34,966 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 76 treesize of output 57 [2024-10-26 10:12:35,004 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 76 treesize of output 57 [2024-10-26 10:12:35,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 10:12:35,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 79 treesize of output 49 [2024-10-26 10:12:35,274 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-10-26 10:12:35,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2024-10-26 10:12:35,407 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 76 treesize of output 57 [2024-10-26 10:12:35,511 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 76 treesize of output 57 [2024-10-26 10:12:35,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 10:12:35,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 31 [2024-10-26 10:12:35,726 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 10:12:35,726 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 10:12:43,643 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_new_~p~0#1.base_111| (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_110| (_ BitVec 32)) (|ULTIMATE.start_main_#t~ret37#1.base| (_ BitVec 32)) (v_ArrVal_1672 (_ BitVec 1)) (v_ArrVal_1670 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~ret37#1.base_86| (_ BitVec 32)) (v_ArrVal_1674 (Array (_ BitVec 32) (_ BitVec 32))) (|v_t_funThread1of1ForFork0_new_~p~0#1.base_26| (_ BitVec 32)) (v_ArrVal_1678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1668 (_ BitVec 1))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_111| v_ArrVal_1668))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_new_~p~0#1.base_110| v_ArrVal_1672))) (or (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_new_~p~0#1.base_110|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store .cse1 |v_t_funThread1of1ForFork0_new_~p~0#1.base_26| (_ bv1 1)) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_new_~p~0#1.base_111| v_ArrVal_1670))) (store (store .cse2 |v_ULTIMATE.start_new_~p~0#1.base_110| v_ArrVal_1674) |c_~#slot~0.base| (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~j~0#1|))) (store (select (store (store .cse2 |c_~#slot~0.base| (store (select .cse2 |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| .cse3) |ULTIMATE.start_main_#t~ret37#1.base|)) |v_ULTIMATE.start_new_~p~0#1.base_110| v_ArrVal_1674) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv4 32) .cse3) |v_ULTIMATE.start_main_#t~ret37#1.base_86|)))) |v_t_funThread1of1ForFork0_new_~p~0#1.base_26| v_ArrVal_1678) |c_~#slot~0.base|) |c_~#slot~0.offset|)))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse0 |c_~#slot~0.base|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_111|))) (not (= (_ bv0 1) (select .cse1 |v_t_funThread1of1ForFork0_new_~p~0#1.base_26|))))))) is different from false [2024-10-26 10:12:49,096 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1672 (_ BitVec 1)) (v_ArrVal_1664 (_ BitVec 1)) (v_ArrVal_1668 (_ BitVec 1)) (|v_ULTIMATE.start_new_~p~0#1.base_112| (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_111| (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_110| (_ BitVec 32)) (v_ArrVal_1670 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~ret37#1.base_86| (_ BitVec 32)) (v_ArrVal_1666 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~ret37#1.base_88| (_ BitVec 32)) (v_ArrVal_1674 (Array (_ BitVec 32) (_ BitVec 32))) (|v_t_funThread1of1ForFork0_new_~p~0#1.base_26| (_ BitVec 32)) (v_ArrVal_1678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_112| v_ArrVal_1664))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_new_~p~0#1.base_111| v_ArrVal_1668))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_new_~p~0#1.base_110| v_ArrVal_1672))) (or (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_new_~p~0#1.base_111|))) (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_new_~p~0#1.base_110|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_112|))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse0 |c_~#slot~0.base|)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store .cse2 |v_t_funThread1of1ForFork0_new_~p~0#1.base_26| (_ bv1 1)) (select (select (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_new_~p~0#1.base_112| v_ArrVal_1666))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_new_~p~0#1.base_111| v_ArrVal_1670))) (store (store .cse3 |v_ULTIMATE.start_new_~p~0#1.base_110| v_ArrVal_1674) |c_~#slot~0.base| (let ((.cse5 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~j~0#1|))) (store (select (store (store .cse3 |c_~#slot~0.base| (store (select (store (store .cse4 |c_~#slot~0.base| (store (select .cse4 |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| .cse5) |v_ULTIMATE.start_new_~p~0#1.base_112|)) |v_ULTIMATE.start_new_~p~0#1.base_111| v_ArrVal_1670) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv4 32) .cse5) |v_ULTIMATE.start_main_#t~ret37#1.base_88|)) |v_ULTIMATE.start_new_~p~0#1.base_110| v_ArrVal_1674) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv8 32) .cse5) |v_ULTIMATE.start_main_#t~ret37#1.base_86|))))) |v_t_funThread1of1ForFork0_new_~p~0#1.base_26| v_ArrVal_1678) |c_~#slot~0.base|) |c_~#slot~0.offset|)))) (not (= (_ bv0 1) (select .cse2 |v_t_funThread1of1ForFork0_new_~p~0#1.base_26|)))))))) is different from false [2024-10-26 10:13:06,593 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1672 (_ BitVec 1)) (v_ArrVal_1660 (_ BitVec 1)) (v_ArrVal_1664 (_ BitVec 1)) (|v_ULTIMATE.start_new_~p~0#1.base_113| (_ BitVec 32)) (v_ArrVal_1668 (_ BitVec 1)) (|v_ULTIMATE.start_new_~p~0#1.base_112| (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_111| (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_110| (_ BitVec 32)) (v_ArrVal_1662 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~ret37#1.base| (_ BitVec 32)) (v_ArrVal_1670 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~ret37#1.base_86| (_ BitVec 32)) (v_ArrVal_1666 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~ret37#1.base_88| (_ BitVec 32)) (v_ArrVal_1674 (Array (_ BitVec 32) (_ BitVec 32))) (|v_t_funThread1of1ForFork0_new_~p~0#1.base_26| (_ BitVec 32)) (v_ArrVal_1678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_113| v_ArrVal_1660))) (let ((.cse7 (store .cse5 |v_ULTIMATE.start_new_~p~0#1.base_112| v_ArrVal_1664))) (let ((.cse6 (store .cse7 |v_ULTIMATE.start_new_~p~0#1.base_111| v_ArrVal_1668))) (let ((.cse0 (store .cse6 |v_ULTIMATE.start_new_~p~0#1.base_110| v_ArrVal_1672))) (or (not (= (_ bv0 1) (select .cse0 |v_t_funThread1of1ForFork0_new_~p~0#1.base_26|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store .cse0 |v_t_funThread1of1ForFork0_new_~p~0#1.base_26| (_ bv1 1)) (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_new_~p~0#1.base_113| v_ArrVal_1662))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_new_~p~0#1.base_112| v_ArrVal_1666))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_new_~p~0#1.base_111| v_ArrVal_1670))) (store (store .cse1 |v_ULTIMATE.start_new_~p~0#1.base_110| v_ArrVal_1674) |c_~#slot~0.base| (let ((.cse4 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~j~0#1|))) (store (select (store (store .cse1 |c_~#slot~0.base| (store (select (store (store .cse2 |c_~#slot~0.base| (store (select (store (store .cse3 |c_~#slot~0.base| (store (select .cse3 |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| .cse4) |ULTIMATE.start_main_#t~ret37#1.base|)) |v_ULTIMATE.start_new_~p~0#1.base_112| v_ArrVal_1666) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv4 32) .cse4) |v_ULTIMATE.start_new_~p~0#1.base_112|)) |v_ULTIMATE.start_new_~p~0#1.base_111| v_ArrVal_1670) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv8 32) .cse4) |v_ULTIMATE.start_main_#t~ret37#1.base_88|)) |v_ULTIMATE.start_new_~p~0#1.base_110| v_ArrVal_1674) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv12 32) .cse4) |v_ULTIMATE.start_main_#t~ret37#1.base_86|)))))) |v_t_funThread1of1ForFork0_new_~p~0#1.base_26| v_ArrVal_1678) |c_~#slot~0.base|) |c_~#slot~0.offset|)))) (not (= (_ bv0 1) (select .cse5 |v_ULTIMATE.start_new_~p~0#1.base_112|))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse5 |c_~#slot~0.base|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_113|))) (not (= (_ bv0 1) (select .cse6 |v_ULTIMATE.start_new_~p~0#1.base_110|))) (not (= (_ bv0 1) (select .cse7 |v_ULTIMATE.start_new_~p~0#1.base_111|))))))))) is different from false [2024-10-26 10:13:28,476 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1672 (_ BitVec 1)) (v_ArrVal_1660 (_ BitVec 1)) (v_ArrVal_1664 (_ BitVec 1)) (|v_ULTIMATE.start_new_~p~0#1.base_114| (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_113| (_ BitVec 32)) (v_ArrVal_1668 (_ BitVec 1)) (|v_ULTIMATE.start_new_~p~0#1.base_112| (_ BitVec 32)) (v_ArrVal_1656 (_ BitVec 1)) (|v_ULTIMATE.start_new_~p~0#1.base_111| (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_110| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~ret37#1.base_91| (_ BitVec 32)) (|ULTIMATE.start_main_#t~ret37#1.base| (_ BitVec 32)) (v_ArrVal_1662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1670 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~ret37#1.base_86| (_ BitVec 32)) (v_ArrVal_1666 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~ret37#1.base_88| (_ BitVec 32)) (v_ArrVal_1674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1658 (Array (_ BitVec 32) (_ BitVec 32))) (|v_t_funThread1of1ForFork0_new_~p~0#1.base_26| (_ BitVec 32)) (v_ArrVal_1678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_114| v_ArrVal_1656))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_new_~p~0#1.base_113| v_ArrVal_1660))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_new_~p~0#1.base_112| v_ArrVal_1664))) (let ((.cse4 (store .cse3 |v_ULTIMATE.start_new_~p~0#1.base_111| v_ArrVal_1668))) (let ((.cse0 (store .cse4 |v_ULTIMATE.start_new_~p~0#1.base_110| v_ArrVal_1672))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_114|))) (not (= (_ bv0 1) (select .cse0 |v_t_funThread1of1ForFork0_new_~p~0#1.base_26|))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse1 |c_~#slot~0.base|)))) (not (= (_ bv0 1) (select .cse2 |v_ULTIMATE.start_new_~p~0#1.base_112|))) (not (= (_ bv0 1) (select .cse3 |v_ULTIMATE.start_new_~p~0#1.base_111|))) (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_new_~p~0#1.base_110|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store .cse0 |v_t_funThread1of1ForFork0_new_~p~0#1.base_26| (_ bv1 1)) (select (select (store (let ((.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_new_~p~0#1.base_114| v_ArrVal_1658))) (let ((.cse7 (store .cse8 |v_ULTIMATE.start_new_~p~0#1.base_113| v_ArrVal_1662))) (let ((.cse6 (store .cse7 |v_ULTIMATE.start_new_~p~0#1.base_112| v_ArrVal_1666))) (let ((.cse5 (store .cse6 |v_ULTIMATE.start_new_~p~0#1.base_111| v_ArrVal_1670))) (store (store .cse5 |v_ULTIMATE.start_new_~p~0#1.base_110| v_ArrVal_1674) |c_~#slot~0.base| (let ((.cse9 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~j~0#1|))) (store (select (store (store .cse5 |c_~#slot~0.base| (store (select (store (store .cse6 |c_~#slot~0.base| (store (select (store (store .cse7 |c_~#slot~0.base| (store (select (store (store .cse8 |c_~#slot~0.base| (store (select .cse8 |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| .cse9) |ULTIMATE.start_main_#t~ret37#1.base|)) |v_ULTIMATE.start_new_~p~0#1.base_113| v_ArrVal_1662) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv4 32) .cse9) |v_ULTIMATE.start_main_#t~ret37#1.base_91|)) |v_ULTIMATE.start_new_~p~0#1.base_112| v_ArrVal_1666) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv8 32) .cse9) |v_ULTIMATE.start_new_~p~0#1.base_112|)) |v_ULTIMATE.start_new_~p~0#1.base_111| v_ArrVal_1670) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv12 32) .cse9) |v_ULTIMATE.start_main_#t~ret37#1.base_88|)) |v_ULTIMATE.start_new_~p~0#1.base_110| v_ArrVal_1674) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv16 32) .cse9) |v_ULTIMATE.start_main_#t~ret37#1.base_86|))))))) |v_t_funThread1of1ForFork0_new_~p~0#1.base_26| v_ArrVal_1678) |c_~#slot~0.base|) |c_~#slot~0.offset|)))) (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_new_~p~0#1.base_113|)))))))))) is different from false [2024-10-26 10:14:02,743 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1672 (_ BitVec 1)) (v_ArrVal_1652 (_ BitVec 1)) (|v_ULTIMATE.start_new_~p~0#1.base_115| (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_114| (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_113| (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_112| (_ BitVec 32)) (v_ArrVal_1656 (_ BitVec 1)) (|v_ULTIMATE.start_new_~p~0#1.base_111| (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_110| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~ret37#1.base_91| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~ret37#1.base_93| (_ BitVec 32)) (v_ArrVal_1662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1666 (Array (_ BitVec 32) (_ BitVec 32))) (|v_t_funThread1of1ForFork0_new_~p~0#1.base_26| (_ BitVec 32)) (v_ArrVal_1660 (_ BitVec 1)) (v_ArrVal_1664 (_ BitVec 1)) (v_ArrVal_1668 (_ BitVec 1)) (|ULTIMATE.start_main_#t~ret37#1.base| (_ BitVec 32)) (v_ArrVal_1670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1654 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~ret37#1.base_86| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~ret37#1.base_88| (_ BitVec 32)) (v_ArrVal_1674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_115| v_ArrVal_1652))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_new_~p~0#1.base_114| v_ArrVal_1656))) (let ((.cse11 (store .cse1 |v_ULTIMATE.start_new_~p~0#1.base_113| v_ArrVal_1660))) (let ((.cse9 (store .cse11 |v_ULTIMATE.start_new_~p~0#1.base_112| v_ArrVal_1664))) (let ((.cse10 (store .cse9 |v_ULTIMATE.start_new_~p~0#1.base_111| v_ArrVal_1668))) (let ((.cse2 (store .cse10 |v_ULTIMATE.start_new_~p~0#1.base_110| v_ArrVal_1672))) (or (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_new_~p~0#1.base_114|))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse0 |c_~#slot~0.base|)))) (not (= (select .cse1 |v_ULTIMATE.start_new_~p~0#1.base_113|) (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store .cse2 |v_t_funThread1of1ForFork0_new_~p~0#1.base_26| (_ bv1 1)) (select (select (store (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_new_~p~0#1.base_115| v_ArrVal_1654))) (let ((.cse6 (store .cse7 |v_ULTIMATE.start_new_~p~0#1.base_114| v_ArrVal_1658))) (let ((.cse5 (store .cse6 |v_ULTIMATE.start_new_~p~0#1.base_113| v_ArrVal_1662))) (let ((.cse4 (store .cse5 |v_ULTIMATE.start_new_~p~0#1.base_112| v_ArrVal_1666))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_new_~p~0#1.base_111| v_ArrVal_1670))) (store (store .cse3 |v_ULTIMATE.start_new_~p~0#1.base_110| v_ArrVal_1674) |c_~#slot~0.base| (let ((.cse8 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~j~0#1|))) (store (select (store (store .cse3 |c_~#slot~0.base| (store (select (store (store .cse4 |c_~#slot~0.base| (store (select (store (store .cse5 |c_~#slot~0.base| (store (select (store (store .cse6 |c_~#slot~0.base| (store (select (store (store .cse7 |c_~#slot~0.base| (store (select .cse7 |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| .cse8) |ULTIMATE.start_main_#t~ret37#1.base|)) |v_ULTIMATE.start_new_~p~0#1.base_114| v_ArrVal_1658) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv4 32) .cse8) |v_ULTIMATE.start_main_#t~ret37#1.base_93|)) |v_ULTIMATE.start_new_~p~0#1.base_113| v_ArrVal_1662) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv8 32) .cse8) |v_ULTIMATE.start_main_#t~ret37#1.base_91|)) |v_ULTIMATE.start_new_~p~0#1.base_112| v_ArrVal_1666) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv12 32) .cse8) |v_ULTIMATE.start_new_~p~0#1.base_112|)) |v_ULTIMATE.start_new_~p~0#1.base_111| v_ArrVal_1670) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv16 32) .cse8) |v_ULTIMATE.start_main_#t~ret37#1.base_88|)) |v_ULTIMATE.start_new_~p~0#1.base_110| v_ArrVal_1674) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv20 32) .cse8) |v_ULTIMATE.start_main_#t~ret37#1.base_86|)))))))) |v_t_funThread1of1ForFork0_new_~p~0#1.base_26| v_ArrVal_1678) |c_~#slot~0.base|) |c_~#slot~0.offset|)))) (not (= (_ bv0 1) (select .cse9 |v_ULTIMATE.start_new_~p~0#1.base_111|))) (not (= (_ bv0 1) (select .cse10 |v_ULTIMATE.start_new_~p~0#1.base_110|))) (not (= (_ bv0 1) (select .cse2 |v_t_funThread1of1ForFork0_new_~p~0#1.base_26|))) (not (= (_ bv0 1) (select .cse11 |v_ULTIMATE.start_new_~p~0#1.base_112|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_115|))))))))))) is different from false [2024-10-26 10:15:41,716 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1672 (_ BitVec 1)) (|v_ULTIMATE.start_new_~p~0#1.base_117| (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_116| (_ BitVec 32)) (v_ArrVal_1652 (_ BitVec 1)) (|v_ULTIMATE.start_new_~p~0#1.base_115| (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_114| (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_113| (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_112| (_ BitVec 32)) (v_ArrVal_1656 (_ BitVec 1)) (|v_ULTIMATE.start_new_~p~0#1.base_111| (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_110| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~ret37#1.base_91| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~ret37#1.base_93| (_ BitVec 32)) (v_ArrVal_1662 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~ret37#1.base_95| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~ret37#1.base_97| (_ BitVec 32)) (v_ArrVal_1666 (Array (_ BitVec 32) (_ BitVec 32))) (|v_t_funThread1of1ForFork0_new_~p~0#1.base_26| (_ BitVec 32)) (v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1660 (_ BitVec 1)) (v_ArrVal_1644 (_ BitVec 1)) (v_ArrVal_1664 (_ BitVec 1)) (v_ArrVal_1648 (_ BitVec 1)) (v_ArrVal_1668 (_ BitVec 1)) (v_ArrVal_1650 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_#t~ret37#1.base| (_ BitVec 32)) (v_ArrVal_1670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1654 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~ret37#1.base_86| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~ret37#1.base_88| (_ BitVec 32)) (v_ArrVal_1674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_117| v_ArrVal_1644))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_new_~p~0#1.base_116| v_ArrVal_1648))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_new_~p~0#1.base_115| v_ArrVal_1652))) (let ((.cse15 (store .cse0 |v_ULTIMATE.start_new_~p~0#1.base_114| v_ArrVal_1656))) (let ((.cse3 (store .cse15 |v_ULTIMATE.start_new_~p~0#1.base_113| v_ArrVal_1660))) (let ((.cse6 (store .cse3 |v_ULTIMATE.start_new_~p~0#1.base_112| v_ArrVal_1664))) (let ((.cse5 (store .cse6 |v_ULTIMATE.start_new_~p~0#1.base_111| v_ArrVal_1668))) (let ((.cse4 (store .cse5 |v_ULTIMATE.start_new_~p~0#1.base_110| v_ArrVal_1672))) (or (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_new_~p~0#1.base_114|))) (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_new_~p~0#1.base_116|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_117|))) (not (= (_ bv0 1) (select .cse2 |v_ULTIMATE.start_new_~p~0#1.base_115|))) (not (= (_ bv0 1) (select .cse3 |v_ULTIMATE.start_new_~p~0#1.base_112|))) (not (= (_ bv0 1) (select .cse4 |v_t_funThread1of1ForFork0_new_~p~0#1.base_26|))) (not (= (select .cse5 |v_ULTIMATE.start_new_~p~0#1.base_110|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse6 |v_ULTIMATE.start_new_~p~0#1.base_111|))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse1 |c_~#slot~0.base|)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store .cse4 |v_t_funThread1of1ForFork0_new_~p~0#1.base_26| (_ bv1 1)) (select (select (store (let ((.cse13 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_new_~p~0#1.base_117| v_ArrVal_1646))) (let ((.cse12 (store .cse13 |v_ULTIMATE.start_new_~p~0#1.base_116| v_ArrVal_1650))) (let ((.cse11 (store .cse12 |v_ULTIMATE.start_new_~p~0#1.base_115| v_ArrVal_1654))) (let ((.cse10 (store .cse11 |v_ULTIMATE.start_new_~p~0#1.base_114| v_ArrVal_1658))) (let ((.cse9 (store .cse10 |v_ULTIMATE.start_new_~p~0#1.base_113| v_ArrVal_1662))) (let ((.cse8 (store .cse9 |v_ULTIMATE.start_new_~p~0#1.base_112| v_ArrVal_1666))) (let ((.cse7 (store .cse8 |v_ULTIMATE.start_new_~p~0#1.base_111| v_ArrVal_1670))) (store (store .cse7 |v_ULTIMATE.start_new_~p~0#1.base_110| v_ArrVal_1674) |c_~#slot~0.base| (let ((.cse14 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~j~0#1|))) (store (select (store (store .cse7 |c_~#slot~0.base| (store (select (store (store .cse8 |c_~#slot~0.base| (store (select (store (store .cse9 |c_~#slot~0.base| (store (select (store (store .cse10 |c_~#slot~0.base| (store (select (store (store .cse11 |c_~#slot~0.base| (store (select (store (store .cse12 |c_~#slot~0.base| (store (select (store (store .cse13 |c_~#slot~0.base| (store (select .cse13 |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| .cse14) |ULTIMATE.start_main_#t~ret37#1.base|)) |v_ULTIMATE.start_new_~p~0#1.base_116| v_ArrVal_1650) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv4 32) .cse14) |v_ULTIMATE.start_main_#t~ret37#1.base_97|)) |v_ULTIMATE.start_new_~p~0#1.base_115| v_ArrVal_1654) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv8 32) .cse14) |v_ULTIMATE.start_main_#t~ret37#1.base_95|)) |v_ULTIMATE.start_new_~p~0#1.base_114| v_ArrVal_1658) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv12 32) .cse14) |v_ULTIMATE.start_main_#t~ret37#1.base_93|)) |v_ULTIMATE.start_new_~p~0#1.base_113| v_ArrVal_1662) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv16 32) .cse14) |v_ULTIMATE.start_main_#t~ret37#1.base_91|)) |v_ULTIMATE.start_new_~p~0#1.base_112| v_ArrVal_1666) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv20 32) .cse14) |v_ULTIMATE.start_new_~p~0#1.base_112|)) |v_ULTIMATE.start_new_~p~0#1.base_111| v_ArrVal_1670) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv24 32) .cse14) |v_ULTIMATE.start_main_#t~ret37#1.base_88|)) |v_ULTIMATE.start_new_~p~0#1.base_110| v_ArrVal_1674) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv28 32) .cse14) |v_ULTIMATE.start_main_#t~ret37#1.base_86|)))))))))) |v_t_funThread1of1ForFork0_new_~p~0#1.base_26| v_ArrVal_1678) |c_~#slot~0.base|) |c_~#slot~0.offset|)))) (not (= (_ bv0 1) (select .cse15 |v_ULTIMATE.start_new_~p~0#1.base_113|))))))))))))) is different from false [2024-10-26 10:16:30,866 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1672 (_ BitVec 1)) (|v_ULTIMATE.start_new_~p~0#1.base_118| (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_117| (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_116| (_ BitVec 32)) (v_ArrVal_1652 (_ BitVec 1)) (|v_ULTIMATE.start_new_~p~0#1.base_115| (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_114| (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_113| (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_112| (_ BitVec 32)) (v_ArrVal_1656 (_ BitVec 1)) (|v_ULTIMATE.start_new_~p~0#1.base_111| (_ BitVec 32)) (|v_ULTIMATE.start_new_~p~0#1.base_110| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~ret37#1.base_91| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~ret37#1.base_93| (_ BitVec 32)) (v_ArrVal_1662 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~ret37#1.base_95| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~ret37#1.base_97| (_ BitVec 32)) (v_ArrVal_1666 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~ret37#1.base_99| (_ BitVec 32)) (v_ArrVal_1642 (Array (_ BitVec 32) (_ BitVec 32))) (|v_t_funThread1of1ForFork0_new_~p~0#1.base_26| (_ BitVec 32)) (v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1640 (_ BitVec 1)) (v_ArrVal_1660 (_ BitVec 1)) (v_ArrVal_1644 (_ BitVec 1)) (v_ArrVal_1664 (_ BitVec 1)) (v_ArrVal_1648 (_ BitVec 1)) (v_ArrVal_1668 (_ BitVec 1)) (v_ArrVal_1650 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1654 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~ret37#1.base_86| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~ret37#1.base_88| (_ BitVec 32)) (v_ArrVal_1674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_118| v_ArrVal_1640))) (let ((.cse16 (store .cse0 |v_ULTIMATE.start_new_~p~0#1.base_117| v_ArrVal_1644))) (let ((.cse12 (store .cse16 |v_ULTIMATE.start_new_~p~0#1.base_116| v_ArrVal_1648))) (let ((.cse15 (store .cse12 |v_ULTIMATE.start_new_~p~0#1.base_115| v_ArrVal_1652))) (let ((.cse17 (store .cse15 |v_ULTIMATE.start_new_~p~0#1.base_114| v_ArrVal_1656))) (let ((.cse14 (store .cse17 |v_ULTIMATE.start_new_~p~0#1.base_113| v_ArrVal_1660))) (let ((.cse13 (store .cse14 |v_ULTIMATE.start_new_~p~0#1.base_112| v_ArrVal_1664))) (let ((.cse11 (store .cse13 |v_ULTIMATE.start_new_~p~0#1.base_111| v_ArrVal_1668))) (let ((.cse1 (store .cse11 |v_ULTIMATE.start_new_~p~0#1.base_110| v_ArrVal_1672))) (or (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_new_~p~0#1.base_117|))) (not (= (_ bv0 1) (select .cse1 |v_t_funThread1of1ForFork0_new_~p~0#1.base_26|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store .cse1 |v_t_funThread1of1ForFork0_new_~p~0#1.base_26| (_ bv1 1)) (select (select (store (let ((.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_new_~p~0#1.base_118| v_ArrVal_1642))) (let ((.cse8 (store .cse9 |v_ULTIMATE.start_new_~p~0#1.base_117| v_ArrVal_1646))) (let ((.cse7 (store .cse8 |v_ULTIMATE.start_new_~p~0#1.base_116| v_ArrVal_1650))) (let ((.cse6 (store .cse7 |v_ULTIMATE.start_new_~p~0#1.base_115| v_ArrVal_1654))) (let ((.cse5 (store .cse6 |v_ULTIMATE.start_new_~p~0#1.base_114| v_ArrVal_1658))) (let ((.cse4 (store .cse5 |v_ULTIMATE.start_new_~p~0#1.base_113| v_ArrVal_1662))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_new_~p~0#1.base_112| v_ArrVal_1666))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_new_~p~0#1.base_111| v_ArrVal_1670))) (store (store .cse2 |v_ULTIMATE.start_new_~p~0#1.base_110| v_ArrVal_1674) |c_~#slot~0.base| (let ((.cse10 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~j~0#1|))) (store (select (store (store .cse2 |c_~#slot~0.base| (store (select (store (store .cse3 |c_~#slot~0.base| (store (select (store (store .cse4 |c_~#slot~0.base| (store (select (store (store .cse5 |c_~#slot~0.base| (store (select (store (store .cse6 |c_~#slot~0.base| (store (select (store (store .cse7 |c_~#slot~0.base| (store (select (store (store .cse8 |c_~#slot~0.base| (store (select (store (store .cse9 |c_~#slot~0.base| (store (select .cse9 |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| .cse10) |v_ULTIMATE.start_new_~p~0#1.base_118|)) |v_ULTIMATE.start_new_~p~0#1.base_117| v_ArrVal_1646) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv4 32) .cse10) |v_ULTIMATE.start_main_#t~ret37#1.base_99|)) |v_ULTIMATE.start_new_~p~0#1.base_116| v_ArrVal_1650) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv8 32) .cse10) |v_ULTIMATE.start_main_#t~ret37#1.base_97|)) |v_ULTIMATE.start_new_~p~0#1.base_115| v_ArrVal_1654) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv12 32) .cse10) |v_ULTIMATE.start_main_#t~ret37#1.base_95|)) |v_ULTIMATE.start_new_~p~0#1.base_114| v_ArrVal_1658) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv16 32) .cse10) |v_ULTIMATE.start_main_#t~ret37#1.base_93|)) |v_ULTIMATE.start_new_~p~0#1.base_113| v_ArrVal_1662) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv20 32) .cse10) |v_ULTIMATE.start_main_#t~ret37#1.base_91|)) |v_ULTIMATE.start_new_~p~0#1.base_112| v_ArrVal_1666) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv24 32) .cse10) |v_ULTIMATE.start_new_~p~0#1.base_112|)) |v_ULTIMATE.start_new_~p~0#1.base_111| v_ArrVal_1670) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv28 32) .cse10) |v_ULTIMATE.start_main_#t~ret37#1.base_88|)) |v_ULTIMATE.start_new_~p~0#1.base_110| v_ArrVal_1674) |c_~#slot~0.base|) (bvadd |c_~#slot~0.offset| (_ bv32 32) .cse10) |v_ULTIMATE.start_main_#t~ret37#1.base_86|))))))))))) |v_t_funThread1of1ForFork0_new_~p~0#1.base_26| v_ArrVal_1678) |c_~#slot~0.base|) |c_~#slot~0.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_118|))) (not (= (_ bv0 1) (select .cse11 |v_ULTIMATE.start_new_~p~0#1.base_110|))) (not (= (_ bv0 1) (select .cse12 |v_ULTIMATE.start_new_~p~0#1.base_115|))) (not (= (_ bv0 1) (select .cse13 |v_ULTIMATE.start_new_~p~0#1.base_111|))) (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_new_~p~0#1.base_112|))) (not (= (_ bv0 1) (select .cse15 |v_ULTIMATE.start_new_~p~0#1.base_114|))) (not (= (_ bv0 1) (select .cse16 |v_ULTIMATE.start_new_~p~0#1.base_116|))) (not (= (bvadd (_ bv1 1) (select .cse0 |c_~#slot~0.base|)) (_ bv0 1))) (not (= (_ bv0 1) (select .cse17 |v_ULTIMATE.start_new_~p~0#1.base_113|)))))))))))))) is different from false [2024-10-26 10:16:30,934 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 10:16:30,934 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 10:16:30,935 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 10:16:30,937 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 10:16:30,941 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 10:16:30,946 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 10:16:30,955 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 10:16:30,964 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 10:16:30,976 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 10:16:30,988 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 10:16:31,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 10:16:31,064 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 128 treesize of output 129 [2024-10-26 10:16:31,084 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 10:16:31,109 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 126 treesize of output 122 [2024-10-26 10:16:31,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 10:16:31,668 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 922812408 treesize of output 922746876 Killed by 15