./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-09-02_08-21-23.files/protection-local/28-race_reach_12-ptr_racefree.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e94c40da 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/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i ./goblint.2024-09-02_08-21-23.files/protection-local/28-race_reach_12-ptr_racefree.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-e94c40d-m [2024-09-24 08:55:45,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-24 08:55:45,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-24 08:55:45,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-24 08:55:45,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-24 08:55:45,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-24 08:55:45,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-24 08:55:45,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-24 08:55:45,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-24 08:55:45,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-24 08:55:45,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-24 08:55:45,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-24 08:55:45,470 INFO L153 SettingsManager]: * Use SBE=true [2024-09-24 08:55:45,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-24 08:55:45,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-24 08:55:45,472 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-24 08:55:45,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-24 08:55:45,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-24 08:55:45,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-24 08:55:45,473 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-24 08:55:45,473 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-24 08:55:45,473 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-24 08:55:45,473 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-24 08:55:45,473 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-24 08:55:45,474 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-24 08:55:45,474 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-24 08:55:45,474 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-24 08:55:45,474 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-24 08:55:45,474 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-24 08:55:45,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-24 08:55:45,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-24 08:55:45,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-24 08:55:45,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-24 08:55:45,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-24 08:55:45,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-24 08:55:45,475 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-24 08:55:45,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-24 08:55:45,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-24 08:55:45,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-24 08:55:45,476 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-24 08:55:45,476 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-24 08:55:45,478 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.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-09-24 08:55:45,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-24 08:55:45,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-24 08:55:45,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-24 08:55:45,694 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-24 08:55:45,695 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-24 08:55:45,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-09-02_08-21-23.files/protection-local/28-race_reach_12-ptr_racefree.yml/witness.yml [2024-09-24 08:55:45,745 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-24 08:55:45,745 INFO L274 PluginConnector]: CDTParser initialized [2024-09-24 08:55:45,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i [2024-09-24 08:55:47,022 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-24 08:55:47,233 INFO L384 CDTParser]: Found 1 translation units. [2024-09-24 08:55:47,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i [2024-09-24 08:55:47,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6e2c32966/275bd44f30e541d39972e8b689d0481f/FLAGe9e82712e [2024-09-24 08:55:47,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6e2c32966/275bd44f30e541d39972e8b689d0481f [2024-09-24 08:55:47,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-24 08:55:47,257 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-24 08:55:47,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-24 08:55:47,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-24 08:55:47,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-24 08:55:47,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 24.09 08:55:45" (1/2) ... [2024-09-24 08:55:47,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@239c9b33 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 08:55:47, skipping insertion in model container [2024-09-24 08:55:47,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 24.09 08:55:45" (1/2) ... [2024-09-24 08:55:47,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2548456c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 08:55:47, skipping insertion in model container [2024-09-24 08:55:47,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 08:55:47" (2/2) ... [2024-09-24 08:55:47,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@239c9b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 08:55:47, skipping insertion in model container [2024-09-24 08:55:47,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 08:55:47" (2/2) ... [2024-09-24 08:55:47,289 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-24 08:55:47,291 INFO L1541 ArrayList]: Location invariant before [L703-L703] 1 <= global [2024-09-24 08:55:47,291 INFO L1541 ArrayList]: Location invariant before [L710-L710] 0 <= global [2024-09-24 08:55:47,291 INFO L1541 ArrayList]: Location invariant before [L710-L710] 0 <= global [2024-09-24 08:55:47,291 INFO L1541 ArrayList]: Location invariant before [L703-L703] 0 <= global [2024-09-24 08:55:47,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-24 08:55:47,555 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i[30176,30189] [2024-09-24 08:55:47,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 08:55:47,585 INFO L200 MainTranslator]: Completed pre-run [2024-09-24 08:55:47,616 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i[30176,30189] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-09-24 08:55:47,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 08:55:47,677 INFO L204 MainTranslator]: Completed translation [2024-09-24 08:55:47,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 08:55:47 WrapperNode [2024-09-24 08:55:47,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-24 08:55:47,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-24 08:55:47,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-24 08:55:47,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-24 08:55:47,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 08:55:47" (1/1) ... [2024-09-24 08:55:47,694 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 08:55:47" (1/1) ... [2024-09-24 08:55:47,711 INFO L138 Inliner]: procedures = 171, calls = 46, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2024-09-24 08:55:47,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-24 08:55:47,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-24 08:55:47,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-24 08:55:47,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-24 08:55:47,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 08:55:47" (1/1) ... [2024-09-24 08:55:47,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 08:55:47" (1/1) ... [2024-09-24 08:55:47,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 08:55:47" (1/1) ... [2024-09-24 08:55:47,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 08:55:47" (1/1) ... [2024-09-24 08:55:47,726 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 08:55:47" (1/1) ... [2024-09-24 08:55:47,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 08:55:47" (1/1) ... [2024-09-24 08:55:47,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 08:55:47" (1/1) ... [2024-09-24 08:55:47,730 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 08:55:47" (1/1) ... [2024-09-24 08:55:47,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-24 08:55:47,733 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-24 08:55:47,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-24 08:55:47,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-24 08:55:47,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 08:55:47" (1/1) ... [2024-09-24 08:55:47,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-24 08:55:47,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 08:55:47,756 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-09-24 08:55:47,758 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-09-24 08:55:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-09-24 08:55:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-09-24 08:55:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-09-24 08:55:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-24 08:55:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-24 08:55:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-09-24 08:55:47,794 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-09-24 08:55:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-24 08:55:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-24 08:55:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-09-24 08:55:47,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-24 08:55:47,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-24 08:55:47,795 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-24 08:55:47,890 INFO L242 CfgBuilder]: Building ICFG [2024-09-24 08:55:47,891 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-24 08:55:48,050 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-24 08:55:48,050 INFO L291 CfgBuilder]: Performing block encoding [2024-09-24 08:55:48,225 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-24 08:55:48,225 INFO L318 CfgBuilder]: Removed 10 assume(true) statements. [2024-09-24 08:55:48,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 08:55:48 BoogieIcfgContainer [2024-09-24 08:55:48,226 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-24 08:55:48,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-24 08:55:48,233 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-24 08:55:48,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-24 08:55:48,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 24.09 08:55:45" (1/4) ... [2024-09-24 08:55:48,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1845f10a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 24.09 08:55:48, skipping insertion in model container [2024-09-24 08:55:48,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 08:55:47" (2/4) ... [2024-09-24 08:55:48,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1845f10a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 08:55:48, skipping insertion in model container [2024-09-24 08:55:48,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 08:55:47" (3/4) ... [2024-09-24 08:55:48,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1845f10a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 08:55:48, skipping insertion in model container [2024-09-24 08:55:48,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 08:55:48" (4/4) ... [2024-09-24 08:55:48,248 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_12-ptr_racefree.i [2024-09-24 08:55:48,262 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-24 08:55:48,263 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-09-24 08:55:48,263 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-24 08:55:48,294 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-09-24 08:55:48,332 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 08:55:48,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 08:55:48,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 08:55:48,333 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-09-24 08:55:48,335 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-09-24 08:55:48,359 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 08:55:48,370 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-09-24 08:55:48,376 INFO L336 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;@342e22f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 08:55:48,376 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-24 08:55:48,488 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 08:55:48,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:48,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2082627238, now seen corresponding path program 1 times [2024-09-24 08:55:48,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:48,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76314320] [2024-09-24 08:55:48,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:48,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:48,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-24 08:55:48,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:48,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76314320] [2024-09-24 08:55:48,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76314320] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 08:55:48,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 08:55:48,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 08:55:48,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426177903] [2024-09-24 08:55:48,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 08:55:48,675 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-24 08:55:48,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:48,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-24 08:55:48,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 08:55:48,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:48,698 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:48,699 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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-09-24 08:55:48,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:48,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:48,725 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-24 08:55:48,726 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 08:55:48,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:48,726 INFO L85 PathProgramCache]: Analyzing trace with hash -344275208, now seen corresponding path program 1 times [2024-09-24 08:55:48,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:48,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671836598] [2024-09-24 08:55:48,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:48,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:48,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 08:55:48,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:48,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671836598] [2024-09-24 08:55:48,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671836598] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 08:55:48,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068547165] [2024-09-24 08:55:48,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:48,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 08:55:48,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 08:55:48,967 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-09-24 08:55:48,968 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-09-24 08:55:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:49,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-24 08:55:49,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 08:55:49,087 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-24 08:55:49,087 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-09-24 08:55:49,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 08:55:49,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 08:55:49,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 08:55:49,182 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 08:55:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 08:55:49,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068547165] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 08:55:49,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 08:55:49,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2024-09-24 08:55:49,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288441448] [2024-09-24 08:55:49,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 08:55:49,246 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-24 08:55:49,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:49,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-24 08:55:49,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=33, Unknown=2, NotChecked=0, Total=56 [2024-09-24 08:55:49,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:49,249 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:49,249 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-09-24 08:55:49,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:49,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:49,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:49,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 08:55:49,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-24 08:55:49,504 WARN L456 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-09-24 08:55:49,505 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 08:55:49,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:49,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1521507440, now seen corresponding path program 1 times [2024-09-24 08:55:49,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:49,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995068405] [2024-09-24 08:55:49,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:49,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:49,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 08:55:49,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:49,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995068405] [2024-09-24 08:55:49,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995068405] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 08:55:49,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 08:55:49,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 08:55:49,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087045871] [2024-09-24 08:55:49,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 08:55:49,726 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 08:55:49,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:49,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 08:55:49,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-24 08:55:49,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:49,727 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:49,727 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-09-24 08:55:49,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:49,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 08:55:49,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:50,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:50,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 08:55:50,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 08:55:50,202 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-24 08:55:50,202 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 08:55:50,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:50,202 INFO L85 PathProgramCache]: Analyzing trace with hash -21435472, now seen corresponding path program 2 times [2024-09-24 08:55:50,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:50,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731946790] [2024-09-24 08:55:50,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:50,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:50,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 08:55:50,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:50,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731946790] [2024-09-24 08:55:50,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731946790] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 08:55:50,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157083944] [2024-09-24 08:55:50,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 08:55:50,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 08:55:50,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 08:55:50,414 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-09-24 08:55:50,415 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-09-24 08:55:50,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-24 08:55:50,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 08:55:50,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-24 08:55:50,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 08:55:50,492 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-24 08:55:50,492 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-09-24 08:55:50,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-09-24 08:55:50,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 08:55:50,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 08:55:50,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 08:55:50,645 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_82 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_82) |c_~#global~0.base|) |c_~#global~0.offset|))) is different from false [2024-09-24 08:55:50,693 INFO L349 Elim1Store]: treesize reduction 17, result has 70.2 percent of original size [2024-09-24 08:55:50,694 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 53 [2024-09-24 08:55:50,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 08:55:50,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2024-09-24 08:55:50,741 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 5 treesize of output 3 [2024-09-24 08:55:50,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-09-24 08:55:50,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157083944] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 08:55:50,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 08:55:50,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2024-09-24 08:55:50,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287995870] [2024-09-24 08:55:50,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 08:55:50,815 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-24 08:55:50,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:50,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-24 08:55:50,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=132, Unknown=1, NotChecked=24, Total=210 [2024-09-24 08:55:50,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:50,816 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:50,816 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 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-09-24 08:55:50,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:50,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 08:55:50,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 08:55:50,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:51,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:51,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 08:55:51,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 08:55:51,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 08:55:51,128 INFO L785 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 2 remaining) [2024-09-24 08:55:51,128 INFO L785 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 2 remaining) [2024-09-24 08:55:51,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-24 08:55:51,328 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 08:55:51,333 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-09-24 08:55:51,334 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE,SAFE (1/2) [2024-09-24 08:55:51,337 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 08:55:51,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 08:55:51,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 08:55:51,341 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-24 08:55:51,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-09-24 08:55:51,344 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 08:55:51,344 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-24 08:55:51,345 INFO L336 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;@342e22f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 08:55:51,345 INFO L337 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-09-24 08:55:51,378 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 08:55:51,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:51,379 INFO L85 PathProgramCache]: Analyzing trace with hash -288132235, now seen corresponding path program 1 times [2024-09-24 08:55:51,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:51,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158370997] [2024-09-24 08:55:51,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:51,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 08:55:51,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:51,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158370997] [2024-09-24 08:55:51,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158370997] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 08:55:51,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 08:55:51,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 08:55:51,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684786187] [2024-09-24 08:55:51,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 08:55:51,394 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-24 08:55:51,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:51,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-24 08:55:51,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 08:55:51,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:51,395 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:51,395 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-09-24 08:55:51,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:51,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:51,413 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-24 08:55:51,413 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 08:55:51,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:51,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1055047341, now seen corresponding path program 1 times [2024-09-24 08:55:51,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:51,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067401058] [2024-09-24 08:55:51,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:51,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 08:55:51,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-24 08:55:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 08:55:51,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-24 08:55:51,450 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-24 08:55:51,450 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-09-24 08:55:51,451 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-09-24 08:55:51,451 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-09-24 08:55:51,451 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-09-24 08:55:51,452 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-24 08:55:51,453 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1] [2024-09-24 08:55:51,454 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2024-09-24 08:55:51,454 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-24 08:55:51,454 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-09-24 08:55:51,470 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-09-24 08:55:51,473 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 08:55:51,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 08:55:51,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 08:55:51,475 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-24 08:55:51,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-09-24 08:55:51,480 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 08:55:51,480 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-09-24 08:55:51,483 INFO L336 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;@342e22f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 08:55:51,483 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-24 08:55:51,660 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 08:55:51,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:51,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1634440545, now seen corresponding path program 1 times [2024-09-24 08:55:51,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:51,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642237753] [2024-09-24 08:55:51,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:51,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 08:55:51,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:51,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642237753] [2024-09-24 08:55:51,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642237753] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 08:55:51,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 08:55:51,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 08:55:51,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780215064] [2024-09-24 08:55:51,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 08:55:51,742 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 08:55:51,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:51,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 08:55:51,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 08:55:51,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:51,743 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:51,743 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-09-24 08:55:51,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:51,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:51,765 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-24 08:55:51,766 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 08:55:51,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:51,766 INFO L85 PathProgramCache]: Analyzing trace with hash -983777725, now seen corresponding path program 1 times [2024-09-24 08:55:51,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:51,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630719813] [2024-09-24 08:55:51,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:51,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:51,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 08:55:51,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:51,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630719813] [2024-09-24 08:55:51,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630719813] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 08:55:51,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428879836] [2024-09-24 08:55:51,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:51,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 08:55:51,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 08:55:51,849 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-09-24 08:55:51,850 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-09-24 08:55:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:51,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-24 08:55:51,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 08:55:51,926 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-24 08:55:51,926 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-09-24 08:55:51,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 08:55:51,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 08:55:51,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 08:55:51,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 08:55:52,014 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_138 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_138) |c_~#global~0.base|) |c_~#global~0.offset|) 1))) is different from false [2024-09-24 08:55:52,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-09-24 08:55:52,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428879836] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 08:55:52,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 08:55:52,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2024-09-24 08:55:52,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313762079] [2024-09-24 08:55:52,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 08:55:52,033 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-24 08:55:52,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:52,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-24 08:55:52,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=26, Unknown=1, NotChecked=10, Total=56 [2024-09-24 08:55:52,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:52,034 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:52,034 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 08:55:52,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:52,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:52,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:52,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 08:55:52,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-24 08:55:52,306 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 08:55:52,306 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 08:55:52,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:52,307 INFO L85 PathProgramCache]: Analyzing trace with hash 817742600, now seen corresponding path program 1 times [2024-09-24 08:55:52,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:52,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141947564] [2024-09-24 08:55:52,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:52,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 08:55:52,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:52,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141947564] [2024-09-24 08:55:52,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141947564] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 08:55:52,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448368641] [2024-09-24 08:55:52,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:52,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 08:55:52,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 08:55:52,534 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-09-24 08:55:52,534 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-09-24 08:55:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:52,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-24 08:55:52,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 08:55:52,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-24 08:55:52,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 08:55:52,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 08:55:52,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 08:55:52,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 08:55:52,700 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 08:55:52,701 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 08:55:52,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448368641] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 08:55:52,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-24 08:55:52,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-09-24 08:55:52,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177971784] [2024-09-24 08:55:52,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 08:55:52,702 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 08:55:52,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:52,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 08:55:52,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-09-24 08:55:52,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:52,702 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:52,703 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-09-24 08:55:52,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:52,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 08:55:52,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:52,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:52,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 08:55:52,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 08:55:52,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-24 08:55:52,929 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-09-24 08:55:52,929 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 08:55:52,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:52,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1634917495, now seen corresponding path program 1 times [2024-09-24 08:55:52,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:52,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508456991] [2024-09-24 08:55:52,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:52,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 08:55:53,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:53,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508456991] [2024-09-24 08:55:53,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508456991] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 08:55:53,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858668543] [2024-09-24 08:55:53,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:53,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 08:55:53,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 08:55:53,112 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 08:55:53,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-24 08:55:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:53,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-24 08:55:53,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 08:55:53,195 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-24 08:55:53,195 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-09-24 08:55:53,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-09-24 08:55:53,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 08:55:53,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 08:55:53,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 08:55:53,378 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_220 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_220) |c_~#global~0.base|) |c_~#global~0.offset|))) is different from false [2024-09-24 08:55:54,264 INFO L349 Elim1Store]: treesize reduction 15, result has 71.7 percent of original size [2024-09-24 08:55:54,265 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 56 [2024-09-24 08:55:54,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 08:55:54,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 48 [2024-09-24 08:55:54,281 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 5 treesize of output 3 [2024-09-24 08:55:54,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-09-24 08:55:54,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858668543] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 08:55:54,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 08:55:54,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-09-24 08:55:54,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94042823] [2024-09-24 08:55:54,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 08:55:54,361 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-24 08:55:54,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:54,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-24 08:55:54,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=109, Unknown=2, NotChecked=22, Total=182 [2024-09-24 08:55:54,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:54,361 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:54,362 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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-09-24 08:55:54,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:54,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 08:55:54,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 08:55:54,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:54,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:54,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 08:55:54,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 08:55:54,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 08:55:54,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-24 08:55:55,107 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 08:55:55,108 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 08:55:55,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:55,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1891748844, now seen corresponding path program 1 times [2024-09-24 08:55:55,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:55,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646015202] [2024-09-24 08:55:55,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:55,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-24 08:55:55,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:55,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646015202] [2024-09-24 08:55:55,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646015202] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 08:55:55,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 08:55:55,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 08:55:55,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206096608] [2024-09-24 08:55:55,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 08:55:55,171 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 08:55:55,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:55,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 08:55:55,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 08:55:55,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:55,173 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:55,173 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-09-24 08:55:55,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:55,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 08:55:55,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 08:55:55,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 08:55:55,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:55,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:55,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 08:55:55,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 08:55:55,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 08:55:55,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:55,357 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-24 08:55:55,357 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 08:55:55,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:55,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1159976035, now seen corresponding path program 1 times [2024-09-24 08:55:55,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:55,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542390371] [2024-09-24 08:55:55,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:55,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-24 08:55:55,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:55,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542390371] [2024-09-24 08:55:55,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542390371] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 08:55:55,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355407416] [2024-09-24 08:55:55,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:55,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 08:55:55,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 08:55:55,454 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 08:55:55,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-24 08:55:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:55,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-24 08:55:55,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 08:55:55,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 08:55:55,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 08:55:55,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 08:55:55,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355407416] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 08:55:55,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 08:55:55,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-09-24 08:55:55,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697057102] [2024-09-24 08:55:55,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 08:55:55,587 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-24 08:55:55,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:55,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-24 08:55:55,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-24 08:55:55,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:55,589 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:55,589 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 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-09-24 08:55:55,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:55,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 08:55:55,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 08:55:55,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 08:55:55,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:55,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:55,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:55,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 08:55:55,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 08:55:55,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 08:55:55,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:55,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 08:55:55,756 INFO L785 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 2 remaining) [2024-09-24 08:55:55,756 INFO L785 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 2 remaining) [2024-09-24 08:55:55,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-24 08:55:55,956 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 08:55:55,958 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-09-24 08:55:55,958 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was SAFE,SAFE (1/3) [2024-09-24 08:55:55,963 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 08:55:55,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 08:55:55,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 08:55:55,965 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-24 08:55:55,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2024-09-24 08:55:55,969 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 08:55:55,970 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-24 08:55:55,970 INFO L336 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;@342e22f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 08:55:55,970 INFO L337 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-09-24 08:55:56,025 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 08:55:56,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:56,026 INFO L85 PathProgramCache]: Analyzing trace with hash 194378609, now seen corresponding path program 1 times [2024-09-24 08:55:56,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:56,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733548774] [2024-09-24 08:55:56,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:56,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-24 08:55:56,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:56,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733548774] [2024-09-24 08:55:56,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733548774] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 08:55:56,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 08:55:56,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 08:55:56,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152425475] [2024-09-24 08:55:56,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 08:55:56,044 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-24 08:55:56,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:56,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-24 08:55:56,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 08:55:56,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,045 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:56,045 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-09-24 08:55:56,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,077 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-24 08:55:56,077 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 08:55:56,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:56,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2097391505, now seen corresponding path program 1 times [2024-09-24 08:55:56,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:56,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147473962] [2024-09-24 08:55:56,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:56,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 08:55:56,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:56,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147473962] [2024-09-24 08:55:56,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147473962] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 08:55:56,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 08:55:56,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 08:55:56,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767240810] [2024-09-24 08:55:56,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 08:55:56,131 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 08:55:56,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:56,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 08:55:56,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 08:55:56,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,132 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:56,133 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-09-24 08:55:56,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:56,153 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-24 08:55:56,153 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 08:55:56,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:56,154 INFO L85 PathProgramCache]: Analyzing trace with hash -517574246, now seen corresponding path program 1 times [2024-09-24 08:55:56,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:56,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362437069] [2024-09-24 08:55:56,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:56,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-24 08:55:56,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:56,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362437069] [2024-09-24 08:55:56,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362437069] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 08:55:56,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 08:55:56,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 08:55:56,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433005347] [2024-09-24 08:55:56,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 08:55:56,213 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 08:55:56,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:56,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 08:55:56,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 08:55:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,213 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:56,213 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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-09-24 08:55:56,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:56,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:56,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:56,269 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-24 08:55:56,269 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 08:55:56,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:56,269 INFO L85 PathProgramCache]: Analyzing trace with hash 918822592, now seen corresponding path program 1 times [2024-09-24 08:55:56,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:56,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928383439] [2024-09-24 08:55:56,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:56,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 08:55:56,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:56,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928383439] [2024-09-24 08:55:56,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928383439] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 08:55:56,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 08:55:56,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 08:55:56,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980674927] [2024-09-24 08:55:56,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 08:55:56,361 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 08:55:56,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:56,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 08:55:56,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-24 08:55:56,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,361 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:56,361 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-09-24 08:55:56,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:56,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:56,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:56,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:56,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 08:55:56,384 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-24 08:55:56,384 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 08:55:56,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:56,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1532004897, now seen corresponding path program 1 times [2024-09-24 08:55:56,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:56,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805287249] [2024-09-24 08:55:56,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:56,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 08:55:56,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-24 08:55:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 08:55:56,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-24 08:55:56,410 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-24 08:55:56,410 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-09-24 08:55:56,410 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-09-24 08:55:56,410 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-09-24 08:55:56,410 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-09-24 08:55:56,410 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-24 08:55:56,413 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-09-24 08:55:56,413 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/3) [2024-09-24 08:55:56,413 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-24 08:55:56,413 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-09-24 08:55:56,433 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-09-24 08:55:56,435 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 08:55:56,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 08:55:56,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 08:55:56,438 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-24 08:55:56,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Waiting until timeout for monitored process [2024-09-24 08:55:56,442 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 08:55:56,442 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-24 08:55:56,443 INFO L336 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;@342e22f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 08:55:56,443 INFO L337 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-09-24 08:55:56,505 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 08:55:56,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:56,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1802919074, now seen corresponding path program 1 times [2024-09-24 08:55:56,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:56,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007811093] [2024-09-24 08:55:56,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:56,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:56,519 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-24 08:55:56,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:56,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007811093] [2024-09-24 08:55:56,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007811093] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 08:55:56,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 08:55:56,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 08:55:56,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207739571] [2024-09-24 08:55:56,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 08:55:56,520 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-24 08:55:56,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:56,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-24 08:55:56,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 08:55:56,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,520 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:56,520 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 08:55:56,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,581 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-24 08:55:56,582 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 08:55:56,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:56,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1561299360, now seen corresponding path program 1 times [2024-09-24 08:55:56,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:56,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146625789] [2024-09-24 08:55:56,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:56,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:56,636 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-24 08:55:56,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:56,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146625789] [2024-09-24 08:55:56,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146625789] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 08:55:56,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 08:55:56,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 08:55:56,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602724194] [2024-09-24 08:55:56,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 08:55:56,636 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 08:55:56,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:56,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 08:55:56,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 08:55:56,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,637 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:56,637 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-09-24 08:55:56,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:56,662 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-09-24 08:55:56,662 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 08:55:56,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:56,662 INFO L85 PathProgramCache]: Analyzing trace with hash 168449567, now seen corresponding path program 1 times [2024-09-24 08:55:56,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:56,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719584199] [2024-09-24 08:55:56,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:56,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-24 08:55:56,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:56,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719584199] [2024-09-24 08:55:56,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719584199] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 08:55:56,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 08:55:56,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 08:55:56,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024783028] [2024-09-24 08:55:56,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 08:55:56,722 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 08:55:56,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:56,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 08:55:56,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 08:55:56,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,722 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:56,722 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 08:55:56,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:56,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:56,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:56,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:56,802 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-09-24 08:55:56,802 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 08:55:56,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:56,802 INFO L85 PathProgramCache]: Analyzing trace with hash 851463362, now seen corresponding path program 1 times [2024-09-24 08:55:56,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:56,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408064212] [2024-09-24 08:55:56,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:56,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:56,961 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 08:55:56,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:56,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408064212] [2024-09-24 08:55:56,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408064212] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 08:55:56,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702320103] [2024-09-24 08:55:56,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:56,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 08:55:56,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 08:55:56,964 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 08:55:56,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-24 08:55:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:57,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-24 08:55:57,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 08:55:57,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-24 08:55:57,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 08:55:57,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 08:55:57,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 08:55:57,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 08:55:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-24 08:55:57,156 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 08:55:57,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702320103] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 08:55:57,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-24 08:55:57,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-09-24 08:55:57,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507640482] [2024-09-24 08:55:57,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 08:55:57,156 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 08:55:57,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:57,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 08:55:57,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-09-24 08:55:57,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:57,157 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:57,157 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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-09-24 08:55:57,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:57,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:57,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:57,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:57,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:57,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:57,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:57,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 08:55:57,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-09-24 08:55:57,393 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-09-24 08:55:57,393 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 08:55:57,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:57,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1573137024, now seen corresponding path program 1 times [2024-09-24 08:55:57,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:57,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722166416] [2024-09-24 08:55:57,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:57,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 08:55:57,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:57,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722166416] [2024-09-24 08:55:57,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722166416] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 08:55:57,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110671305] [2024-09-24 08:55:57,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:57,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 08:55:57,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 08:55:57,515 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 08:55:57,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-09-24 08:55:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:57,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-24 08:55:57,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 08:55:57,605 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-24 08:55:57,605 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-09-24 08:55:57,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-09-24 08:55:57,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 16 treesize of output 11 [2024-09-24 08:55:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 08:55:57,758 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 08:55:57,844 INFO L349 Elim1Store]: treesize reduction 17, result has 70.2 percent of original size [2024-09-24 08:55:57,845 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 53 [2024-09-24 08:55:57,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 08:55:57,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2024-09-24 08:55:57,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-09-24 08:55:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 08:55:57,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110671305] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 08:55:57,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 08:55:57,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-09-24 08:55:57,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994814827] [2024-09-24 08:55:57,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 08:55:57,935 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-24 08:55:57,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:57,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-24 08:55:57,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=125, Unknown=4, NotChecked=0, Total=182 [2024-09-24 08:55:57,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:57,936 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:57,936 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 13 states have internal predecessors, (58), 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-09-24 08:55:57,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:57,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:57,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:57,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 08:55:57,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:58,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:58,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:58,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:58,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 08:55:58,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 08:55:58,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-09-24 08:55:58,314 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-09-24 08:55:58,314 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 08:55:58,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:58,314 INFO L85 PathProgramCache]: Analyzing trace with hash 73433281, now seen corresponding path program 1 times [2024-09-24 08:55:58,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:58,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98388780] [2024-09-24 08:55:58,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:58,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 08:55:58,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-24 08:55:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 08:55:58,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-24 08:55:58,360 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-24 08:55:58,360 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-09-24 08:55:58,361 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-09-24 08:55:58,361 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-09-24 08:55:58,361 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-09-24 08:55:58,361 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-09-24 08:55:58,363 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-09-24 08:55:58,363 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/4) [2024-09-24 08:55:58,364 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-24 08:55:58,364 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-09-24 08:55:58,390 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-09-24 08:55:58,392 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 08:55:58,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 08:55:58,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 08:55:58,397 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-24 08:55:58,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Waiting until timeout for monitored process [2024-09-24 08:55:58,400 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 08:55:58,400 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread4of4ForFork0 ======== [2024-09-24 08:55:58,401 INFO L336 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;@342e22f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 08:55:58,401 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-24 08:55:58,525 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 08:55:58,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:58,526 INFO L85 PathProgramCache]: Analyzing trace with hash 639993504, now seen corresponding path program 1 times [2024-09-24 08:55:58,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:58,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104802729] [2024-09-24 08:55:58,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:58,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:58,544 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-24 08:55:58,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:58,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104802729] [2024-09-24 08:55:58,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104802729] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 08:55:58,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 08:55:58,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 08:55:58,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123983781] [2024-09-24 08:55:58,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 08:55:58,545 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-24 08:55:58,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:58,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-24 08:55:58,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 08:55:58,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:58,546 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:58,546 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 08:55:58,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:58,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:58,636 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-09-24 08:55:58,636 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 08:55:58,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:58,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1578287137, now seen corresponding path program 1 times [2024-09-24 08:55:58,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:58,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916469286] [2024-09-24 08:55:58,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:58,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-24 08:55:58,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:58,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916469286] [2024-09-24 08:55:58,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916469286] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 08:55:58,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 08:55:58,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 08:55:58,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668975148] [2024-09-24 08:55:58,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 08:55:58,682 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 08:55:58,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:58,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 08:55:58,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 08:55:58,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:58,683 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:58,683 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-09-24 08:55:58,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:58,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:58,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:58,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:58,861 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-09-24 08:55:58,861 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 08:55:58,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:58,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1403642537, now seen corresponding path program 1 times [2024-09-24 08:55:58,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:58,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254771557] [2024-09-24 08:55:58,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:58,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:58,917 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-24 08:55:58,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:58,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254771557] [2024-09-24 08:55:58,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254771557] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 08:55:58,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 08:55:58,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 08:55:58,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074751276] [2024-09-24 08:55:58,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 08:55:58,918 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 08:55:58,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:58,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 08:55:58,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 08:55:58,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:58,918 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:58,918 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-09-24 08:55:58,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:58,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:58,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:59,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:59,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:59,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:59,116 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-09-24 08:55:59,116 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 08:55:59,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:59,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1983358310, now seen corresponding path program 1 times [2024-09-24 08:55:59,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:59,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14330864] [2024-09-24 08:55:59,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:59,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-24 08:55:59,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:59,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14330864] [2024-09-24 08:55:59,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14330864] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 08:55:59,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 08:55:59,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 08:55:59,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547811473] [2024-09-24 08:55:59,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 08:55:59,284 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 08:55:59,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:59,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 08:55:59,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-24 08:55:59,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:59,285 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:59,285 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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-09-24 08:55:59,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:59,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:59,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:59,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:59,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:59,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:59,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:59,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 08:55:59,426 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-09-24 08:55:59,426 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 08:55:59,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:59,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1416773956, now seen corresponding path program 1 times [2024-09-24 08:55:59,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:59,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576562257] [2024-09-24 08:55:59,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:59,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:55:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-24 08:55:59,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:55:59,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576562257] [2024-09-24 08:55:59,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576562257] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 08:55:59,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 08:55:59,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 08:55:59,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584791708] [2024-09-24 08:55:59,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 08:55:59,620 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 08:55:59,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:55:59,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 08:55:59,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-24 08:55:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:59,621 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:55:59,621 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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-09-24 08:55:59,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:59,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:59,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:59,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 08:55:59,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:59,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:55:59,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:59,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:55:59,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 08:55:59,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 08:55:59,795 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-09-24 08:55:59,795 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 08:55:59,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:55:59,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1515231556, now seen corresponding path program 2 times [2024-09-24 08:55:59,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:55:59,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267012066] [2024-09-24 08:55:59,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:55:59,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:55:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:56:00,119 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-24 08:56:00,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:56:00,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267012066] [2024-09-24 08:56:00,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267012066] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 08:56:00,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 08:56:00,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-24 08:56:00,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611376016] [2024-09-24 08:56:00,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 08:56:00,120 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-24 08:56:00,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 08:56:00,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-24 08:56:00,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-09-24 08:56:00,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:56:00,120 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 08:56:00,120 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 8 states have internal predecessors, (89), 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-09-24 08:56:00,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:56:00,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:56:00,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:56:00,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 08:56:00,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 08:56:00,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:56:00,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 08:56:00,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:56:00,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 08:56:00,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 08:56:00,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 08:56:00,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 08:56:00,703 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-09-24 08:56:00,703 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 08:56:00,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 08:56:00,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1862191756, now seen corresponding path program 3 times [2024-09-24 08:56:00,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 08:56:00,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168023873] [2024-09-24 08:56:00,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 08:56:00,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 08:56:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 08:56:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 08:56:01,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 08:56:01,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168023873] [2024-09-24 08:56:01,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168023873] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 08:56:01,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636174218] [2024-09-24 08:56:01,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-24 08:56:01,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 08:56:01,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 08:56:01,356 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 08:56:01,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-09-24 08:56:01,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-24 08:56:01,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 08:56:01,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-24 08:56:01,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 08:56:01,497 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-24 08:56:01,497 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-09-24 08:56:01,669 INFO L349 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2024-09-24 08:56:01,670 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 2 case distinctions, treesize of input 25 treesize of output 40 [2024-09-24 08:56:01,835 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 45 treesize of output 36 [2024-09-24 08:56:01,997 INFO L349 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2024-09-24 08:56:01,998 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 5 case distinctions, treesize of input 65 treesize of output 88 [2024-09-24 08:56:02,514 INFO L349 Elim1Store]: treesize reduction 88, result has 42.9 percent of original size [2024-09-24 08:56:02,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 115 treesize of output 137 [2024-09-24 08:56:03,113 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2024-09-24 08:56:03,114 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 2 case distinctions, treesize of input 66 treesize of output 54 [2024-09-24 08:56:03,236 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-09-24 08:56:03,236 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 2 case distinctions, treesize of input 61 treesize of output 57 [2024-09-24 08:56:03,281 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-24 08:56:03,281 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 08:56:13,703 WARN L854 $PredicateComparison]: unable to prove that (forall ((t_funThread3of4ForFork0_~p~0.offset Int) (v_ArrVal_1030 Int) (v_ArrVal_1028 (Array Int Int)) (v_ArrVal_1033 Int) (v_ArrVal_1032 Int) (v_ArrVal_1035 Int) (t_funThread2of4ForFork0_~p~0.offset Int) (t_funThread3of4ForFork0_~p~0.base Int) (t_funThread2of4ForFork0_~p~0.base Int)) (let ((.cse1 (store (store |c_#memory_int| t_funThread2of4ForFork0_~p~0.base (let ((.cse11 (select |c_#memory_int| t_funThread2of4ForFork0_~p~0.base))) (store .cse11 t_funThread2of4ForFork0_~p~0.offset (+ (select .cse11 t_funThread2of4ForFork0_~p~0.offset) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1028))) (let ((.cse2 (select .cse1 t_funThread3of4ForFork0_~p~0.base))) (let ((.cse10 (store .cse2 t_funThread3of4ForFork0_~p~0.offset v_ArrVal_1030))) (let ((.cse7 (select (store .cse1 t_funThread3of4ForFork0_~p~0.base .cse10) t_funThread2of4ForFork0_~p~0.base))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1028)) (.cse4 (store .cse7 t_funThread2of4ForFork0_~p~0.offset v_ArrVal_1032))) (let ((.cse9 (store (store .cse3 t_funThread3of4ForFork0_~p~0.base .cse10) t_funThread2of4ForFork0_~p~0.base .cse4))) (let ((.cse8 (select .cse9 c_t_funThread4of4ForFork0_~p~0.base))) (let ((.cse5 (store .cse8 c_t_funThread4of4ForFork0_~p~0.offset v_ArrVal_1033))) (let ((.cse6 (store .cse9 c_t_funThread4of4ForFork0_~p~0.base .cse5))) (let ((.cse0 (select .cse6 t_funThread3of4ForFork0_~p~0.base))) (or (< (+ v_ArrVal_1035 1) (select .cse0 t_funThread3of4ForFork0_~p~0.offset)) (< (select (select .cse1 |c_~#global~0.base|) |c_~#global~0.offset|) 0) (< v_ArrVal_1030 (+ (select .cse2 t_funThread3of4ForFork0_~p~0.offset) 1)) (< 0 (select (select (store (store (store .cse3 t_funThread2of4ForFork0_~p~0.base .cse4) c_t_funThread4of4ForFork0_~p~0.base .cse5) t_funThread3of4ForFork0_~p~0.base (store .cse0 t_funThread3of4ForFork0_~p~0.offset v_ArrVal_1035)) |c_~#global~0.base|) |c_~#global~0.offset|)) (< (select (select .cse6 |c_~#global~0.base|) |c_~#global~0.offset|) 1) (< (+ v_ArrVal_1032 1) (select .cse7 t_funThread2of4ForFork0_~p~0.offset)) (< v_ArrVal_1033 (+ (select .cse8 c_t_funThread4of4ForFork0_~p~0.offset) 1)))))))))))))) is different from false [2024-09-24 08:56:14,239 INFO L349 Elim1Store]: treesize reduction 42, result has 55.3 percent of original size [2024-09-24 08:56:14,242 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 3685285 treesize of output 2240234 [2024-09-24 08:56:15,320 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2024-09-24 08:56:15,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43229 treesize of output 41371 [2024-09-24 08:56:17,098 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2024-09-24 08:56:17,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59432 treesize of output 57938 [2024-09-24 08:56:25,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 08:56:25,118 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 3545 treesize of output 3519 [2024-09-24 09:01:33,255 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-09-24 09:01:33,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2024-09-24 09:01:33,257 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-09-24 09:01:33,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-09-24 09:01:33,457 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 09:01:33,458 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.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) 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:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:410) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:327) 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) ... 76 more [2024-09-24 09:01:33,461 INFO L158 Benchmark]: Toolchain (without parser) took 346204.34ms. Allocated memory was 130.0MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 99.4MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-09-24 09:01:33,461 INFO L158 Benchmark]: Witness Parser took 0.21ms. Allocated memory is still 130.0MB. Free memory was 81.2MB in the beginning and 81.1MB in the end (delta: 126.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-24 09:01:33,461 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 130.0MB. Free memory was 79.2MB in the beginning and 79.0MB in the end (delta: 125.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-24 09:01:33,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.84ms. Allocated memory was 130.0MB in the beginning and 203.4MB in the end (delta: 73.4MB). Free memory was 99.2MB in the beginning and 150.7MB in the end (delta: -51.5MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2024-09-24 09:01:33,462 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.24ms. Allocated memory is still 203.4MB. Free memory was 150.7MB in the beginning and 148.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 09:01:33,462 INFO L158 Benchmark]: Boogie Preprocessor took 20.53ms. Allocated memory is still 203.4MB. Free memory was 148.7MB in the beginning and 146.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 09:01:33,462 INFO L158 Benchmark]: RCFGBuilder took 493.27ms. Allocated memory is still 203.4MB. Free memory was 146.6MB in the beginning and 166.5MB in the end (delta: -19.9MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. [2024-09-24 09:01:33,462 INFO L158 Benchmark]: TraceAbstraction took 345228.22ms. Allocated memory was 203.4MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 165.4MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-09-24 09:01:33,464 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.21ms. Allocated memory is still 130.0MB. Free memory was 81.2MB in the beginning and 81.1MB in the end (delta: 126.0kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.08ms. Allocated memory is still 130.0MB. Free memory was 79.2MB in the beginning and 79.0MB in the end (delta: 125.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 420.84ms. Allocated memory was 130.0MB in the beginning and 203.4MB in the end (delta: 73.4MB). Free memory was 99.2MB in the beginning and 150.7MB in the end (delta: -51.5MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.24ms. Allocated memory is still 203.4MB. Free memory was 150.7MB in the beginning and 148.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.53ms. Allocated memory is still 203.4MB. Free memory was 148.7MB in the beginning and 146.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 493.27ms. Allocated memory is still 203.4MB. Free memory was 146.6MB in the beginning and 166.5MB in the end (delta: -19.9MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. * TraceAbstraction took 345228.22ms. Allocated memory was 203.4MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 165.4MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3408, independent: 3028, independent conditional: 896, independent unconditional: 2132, dependent: 380, dependent conditional: 322, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3113, independent: 3028, independent conditional: 896, independent unconditional: 2132, dependent: 85, dependent conditional: 27, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3113, independent: 3028, independent conditional: 896, independent unconditional: 2132, dependent: 85, dependent conditional: 27, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3192, independent: 3028, independent conditional: 896, independent unconditional: 2132, dependent: 164, dependent conditional: 106, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3192, independent: 3028, independent conditional: 14, independent unconditional: 3014, dependent: 164, dependent conditional: 17, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3192, independent: 3028, independent conditional: 14, independent unconditional: 3014, dependent: 164, dependent conditional: 17, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1641, independent: 1568, independent conditional: 13, independent unconditional: 1555, dependent: 73, dependent conditional: 13, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1641, independent: 1521, independent conditional: 0, independent unconditional: 1521, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 120, independent: 47, independent conditional: 13, independent unconditional: 34, dependent: 73, dependent conditional: 13, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 120, independent: 47, independent conditional: 13, independent unconditional: 34, dependent: 73, dependent conditional: 13, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 258, independent: 116, independent conditional: 28, independent unconditional: 89, dependent: 142, dependent conditional: 29, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3192, independent: 1460, independent conditional: 1, independent unconditional: 1459, dependent: 91, dependent conditional: 4, dependent unconditional: 87, unknown: 1641, unknown conditional: 26, unknown unconditional: 1615] , Statistics on independence cache: Total cache size (in pairs): 1641, Positive cache size: 1568, Positive conditional cache size: 13, Positive unconditional cache size: 1555, Negative cache size: 73, Negative conditional cache size: 13, Negative unconditional cache size: 60, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 971, Maximal queried relation: 3, Independence queries for same thread: 295, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 406, Number of trivial persistent sets: 362, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2190, independent: 2132, independent conditional: 0, independent unconditional: 2132, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3408, independent: 3028, independent conditional: 896, independent unconditional: 2132, dependent: 380, dependent conditional: 322, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3113, independent: 3028, independent conditional: 896, independent unconditional: 2132, dependent: 85, dependent conditional: 27, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3113, independent: 3028, independent conditional: 896, independent unconditional: 2132, dependent: 85, dependent conditional: 27, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3192, independent: 3028, independent conditional: 896, independent unconditional: 2132, dependent: 164, dependent conditional: 106, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3192, independent: 3028, independent conditional: 14, independent unconditional: 3014, dependent: 164, dependent conditional: 17, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3192, independent: 3028, independent conditional: 14, independent unconditional: 3014, dependent: 164, dependent conditional: 17, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1641, independent: 1568, independent conditional: 13, independent unconditional: 1555, dependent: 73, dependent conditional: 13, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1641, independent: 1521, independent conditional: 0, independent unconditional: 1521, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 120, independent: 47, independent conditional: 13, independent unconditional: 34, dependent: 73, dependent conditional: 13, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 120, independent: 47, independent conditional: 13, independent unconditional: 34, dependent: 73, dependent conditional: 13, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 258, independent: 116, independent conditional: 28, independent unconditional: 89, dependent: 142, dependent conditional: 29, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3192, independent: 1460, independent conditional: 1, independent unconditional: 1459, dependent: 91, dependent conditional: 4, dependent unconditional: 87, unknown: 1641, unknown conditional: 26, unknown unconditional: 1615] , Statistics on independence cache: Total cache size (in pairs): 1641, Positive cache size: 1568, Positive conditional cache size: 13, Positive unconditional cache size: 1555, Negative cache size: 73, Negative conditional cache size: 13, Negative unconditional cache size: 60, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 971, Maximal queried relation: 3, Independence queries for same thread: 295 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 311, independent: 292, independent conditional: 24, independent unconditional: 268, dependent: 19, dependent conditional: 14, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 297, independent: 292, independent conditional: 24, independent unconditional: 268, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 297, independent: 292, independent conditional: 24, independent unconditional: 268, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 297, independent: 292, independent conditional: 24, independent unconditional: 268, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 297, independent: 292, independent conditional: 0, independent unconditional: 292, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 297, independent: 292, independent conditional: 0, independent unconditional: 292, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 263, independent: 258, independent conditional: 0, independent unconditional: 258, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 263, independent: 251, independent conditional: 0, independent unconditional: 251, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 297, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 263, unknown conditional: 0, unknown unconditional: 263] , Statistics on independence cache: Total cache size (in pairs): 263, Positive cache size: 258, Positive conditional cache size: 0, Positive unconditional cache size: 258, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0, Independence queries for same thread: 14, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 14, Number of trivial persistent sets: 13, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 273, independent: 268, independent conditional: 0, independent unconditional: 268, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 311, independent: 292, independent conditional: 24, independent unconditional: 268, dependent: 19, dependent conditional: 14, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 297, independent: 292, independent conditional: 24, independent unconditional: 268, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 297, independent: 292, independent conditional: 24, independent unconditional: 268, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 297, independent: 292, independent conditional: 24, independent unconditional: 268, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 297, independent: 292, independent conditional: 0, independent unconditional: 292, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 297, independent: 292, independent conditional: 0, independent unconditional: 292, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 263, independent: 258, independent conditional: 0, independent unconditional: 258, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 263, independent: 251, independent conditional: 0, independent unconditional: 251, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 297, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 263, unknown conditional: 0, unknown unconditional: 263] , Statistics on independence cache: Total cache size (in pairs): 263, Positive cache size: 258, Positive conditional cache size: 0, Positive unconditional cache size: 258, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0, Independence queries for same thread: 14 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9773, independent: 8861, independent conditional: 3941, independent unconditional: 4920, dependent: 912, dependent conditional: 790, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9059, independent: 8861, independent conditional: 3941, independent unconditional: 4920, dependent: 198, dependent conditional: 76, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9059, independent: 8861, independent conditional: 3941, independent unconditional: 4920, dependent: 198, dependent conditional: 76, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9513, independent: 8861, independent conditional: 3941, independent unconditional: 4920, dependent: 652, dependent conditional: 530, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9513, independent: 8861, independent conditional: 174, independent unconditional: 8687, dependent: 652, dependent conditional: 107, dependent unconditional: 545, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9513, independent: 8861, independent conditional: 174, independent unconditional: 8687, dependent: 652, dependent conditional: 107, dependent unconditional: 545, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4471, independent: 4313, independent conditional: 27, independent unconditional: 4286, dependent: 158, dependent conditional: 31, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4471, independent: 4224, independent conditional: 0, independent unconditional: 4224, dependent: 247, dependent conditional: 0, dependent unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 247, independent: 89, independent conditional: 27, independent unconditional: 62, dependent: 158, dependent conditional: 31, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 247, independent: 89, independent conditional: 27, independent unconditional: 62, dependent: 158, dependent conditional: 31, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 350, independent: 121, independent conditional: 38, independent unconditional: 82, dependent: 229, dependent conditional: 50, dependent unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 9513, independent: 4548, independent conditional: 147, independent unconditional: 4401, dependent: 494, dependent conditional: 76, dependent unconditional: 418, unknown: 4471, unknown conditional: 58, unknown unconditional: 4413] , Statistics on independence cache: Total cache size (in pairs): 4471, Positive cache size: 4313, Positive conditional cache size: 27, Positive unconditional cache size: 4286, Negative cache size: 158, Negative conditional cache size: 31, Negative unconditional cache size: 127, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4190, Maximal queried relation: 5, Independence queries for same thread: 714, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 956, Number of trivial persistent sets: 884, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5042, independent: 4920, independent conditional: 0, independent unconditional: 4920, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9773, independent: 8861, independent conditional: 3941, independent unconditional: 4920, dependent: 912, dependent conditional: 790, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9059, independent: 8861, independent conditional: 3941, independent unconditional: 4920, dependent: 198, dependent conditional: 76, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9059, independent: 8861, independent conditional: 3941, independent unconditional: 4920, dependent: 198, dependent conditional: 76, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9513, independent: 8861, independent conditional: 3941, independent unconditional: 4920, dependent: 652, dependent conditional: 530, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9513, independent: 8861, independent conditional: 174, independent unconditional: 8687, dependent: 652, dependent conditional: 107, dependent unconditional: 545, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9513, independent: 8861, independent conditional: 174, independent unconditional: 8687, dependent: 652, dependent conditional: 107, dependent unconditional: 545, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4471, independent: 4313, independent conditional: 27, independent unconditional: 4286, dependent: 158, dependent conditional: 31, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4471, independent: 4224, independent conditional: 0, independent unconditional: 4224, dependent: 247, dependent conditional: 0, dependent unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 247, independent: 89, independent conditional: 27, independent unconditional: 62, dependent: 158, dependent conditional: 31, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 247, independent: 89, independent conditional: 27, independent unconditional: 62, dependent: 158, dependent conditional: 31, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 350, independent: 121, independent conditional: 38, independent unconditional: 82, dependent: 229, dependent conditional: 50, dependent unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 9513, independent: 4548, independent conditional: 147, independent unconditional: 4401, dependent: 494, dependent conditional: 76, dependent unconditional: 418, unknown: 4471, unknown conditional: 58, unknown unconditional: 4413] , Statistics on independence cache: Total cache size (in pairs): 4471, Positive cache size: 4313, Positive conditional cache size: 27, Positive unconditional cache size: 4286, Negative cache size: 158, Negative conditional cache size: 31, Negative unconditional cache size: 127, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4190, Maximal queried relation: 5, Independence queries for same thread: 714 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1823, independent: 1686, independent conditional: 262, independent unconditional: 1424, dependent: 137, dependent conditional: 108, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1722, independent: 1686, independent conditional: 262, independent unconditional: 1424, dependent: 36, dependent conditional: 7, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1722, independent: 1686, independent conditional: 262, independent unconditional: 1424, dependent: 36, dependent conditional: 7, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1739, independent: 1686, independent conditional: 262, independent unconditional: 1424, dependent: 53, dependent conditional: 24, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1739, independent: 1686, independent conditional: 5, independent unconditional: 1681, dependent: 53, dependent conditional: 3, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1739, independent: 1686, independent conditional: 5, independent unconditional: 1681, dependent: 53, dependent conditional: 3, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1325, independent: 1293, independent conditional: 3, independent unconditional: 1290, dependent: 32, dependent conditional: 2, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1325, independent: 1264, independent conditional: 0, independent unconditional: 1264, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 61, independent: 29, independent conditional: 3, independent unconditional: 26, dependent: 32, dependent conditional: 2, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 29, independent conditional: 3, independent unconditional: 26, dependent: 32, dependent conditional: 2, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 91, independent: 52, independent conditional: 4, independent unconditional: 48, dependent: 39, dependent conditional: 4, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1739, independent: 393, independent conditional: 2, independent unconditional: 391, dependent: 21, dependent conditional: 1, dependent unconditional: 20, unknown: 1325, unknown conditional: 5, unknown unconditional: 1320] , Statistics on independence cache: Total cache size (in pairs): 1325, Positive cache size: 1293, Positive conditional cache size: 3, Positive unconditional cache size: 1290, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 278, Maximal queried relation: 3, Independence queries for same thread: 101, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 47, Number of trivial persistent sets: 42, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1453, independent: 1424, independent conditional: 0, independent unconditional: 1424, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1823, independent: 1686, independent conditional: 262, independent unconditional: 1424, dependent: 137, dependent conditional: 108, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1722, independent: 1686, independent conditional: 262, independent unconditional: 1424, dependent: 36, dependent conditional: 7, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1722, independent: 1686, independent conditional: 262, independent unconditional: 1424, dependent: 36, dependent conditional: 7, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1739, independent: 1686, independent conditional: 262, independent unconditional: 1424, dependent: 53, dependent conditional: 24, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1739, independent: 1686, independent conditional: 5, independent unconditional: 1681, dependent: 53, dependent conditional: 3, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1739, independent: 1686, independent conditional: 5, independent unconditional: 1681, dependent: 53, dependent conditional: 3, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1325, independent: 1293, independent conditional: 3, independent unconditional: 1290, dependent: 32, dependent conditional: 2, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1325, independent: 1264, independent conditional: 0, independent unconditional: 1264, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 61, independent: 29, independent conditional: 3, independent unconditional: 26, dependent: 32, dependent conditional: 2, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 29, independent conditional: 3, independent unconditional: 26, dependent: 32, dependent conditional: 2, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 91, independent: 52, independent conditional: 4, independent unconditional: 48, dependent: 39, dependent conditional: 4, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1739, independent: 393, independent conditional: 2, independent unconditional: 391, dependent: 21, dependent conditional: 1, dependent unconditional: 20, unknown: 1325, unknown conditional: 5, unknown unconditional: 1320] , Statistics on independence cache: Total cache size (in pairs): 1325, Positive cache size: 1293, Positive conditional cache size: 3, Positive unconditional cache size: 1290, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 278, Maximal queried relation: 3, Independence queries for same thread: 101 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4308, independent: 4036, independent conditional: 624, independent unconditional: 3412, dependent: 272, dependent conditional: 206, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4117, independent: 4036, independent conditional: 624, independent unconditional: 3412, dependent: 81, dependent conditional: 15, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4117, independent: 4036, independent conditional: 624, independent unconditional: 3412, dependent: 81, dependent conditional: 15, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4156, independent: 4036, independent conditional: 624, independent unconditional: 3412, dependent: 120, dependent conditional: 54, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4156, independent: 4036, independent conditional: 14, independent unconditional: 4022, dependent: 120, dependent conditional: 5, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4156, independent: 4036, independent conditional: 14, independent unconditional: 4022, dependent: 120, dependent conditional: 5, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3208, independent: 3135, independent conditional: 11, independent unconditional: 3124, dependent: 73, dependent conditional: 4, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3208, independent: 3076, independent conditional: 0, independent unconditional: 3076, dependent: 132, dependent conditional: 0, dependent unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 132, independent: 59, independent conditional: 11, independent unconditional: 48, dependent: 73, dependent conditional: 4, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 132, independent: 59, independent conditional: 11, independent unconditional: 48, dependent: 73, dependent conditional: 4, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 160, independent: 76, independent conditional: 17, independent unconditional: 59, dependent: 84, dependent conditional: 6, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4156, independent: 901, independent conditional: 3, independent unconditional: 898, dependent: 47, dependent conditional: 1, dependent unconditional: 46, unknown: 3208, unknown conditional: 15, unknown unconditional: 3193] , Statistics on independence cache: Total cache size (in pairs): 3208, Positive cache size: 3135, Positive conditional cache size: 11, Positive unconditional cache size: 3124, Negative cache size: 73, Negative conditional cache size: 4, Negative unconditional cache size: 69, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 659, Maximal queried relation: 3, Independence queries for same thread: 191, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 96, Number of trivial persistent sets: 86, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3478, independent: 3412, independent conditional: 0, independent unconditional: 3412, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4308, independent: 4036, independent conditional: 624, independent unconditional: 3412, dependent: 272, dependent conditional: 206, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4117, independent: 4036, independent conditional: 624, independent unconditional: 3412, dependent: 81, dependent conditional: 15, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4117, independent: 4036, independent conditional: 624, independent unconditional: 3412, dependent: 81, dependent conditional: 15, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4156, independent: 4036, independent conditional: 624, independent unconditional: 3412, dependent: 120, dependent conditional: 54, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4156, independent: 4036, independent conditional: 14, independent unconditional: 4022, dependent: 120, dependent conditional: 5, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4156, independent: 4036, independent conditional: 14, independent unconditional: 4022, dependent: 120, dependent conditional: 5, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3208, independent: 3135, independent conditional: 11, independent unconditional: 3124, dependent: 73, dependent conditional: 4, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3208, independent: 3076, independent conditional: 0, independent unconditional: 3076, dependent: 132, dependent conditional: 0, dependent unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 132, independent: 59, independent conditional: 11, independent unconditional: 48, dependent: 73, dependent conditional: 4, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 132, independent: 59, independent conditional: 11, independent unconditional: 48, dependent: 73, dependent conditional: 4, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 160, independent: 76, independent conditional: 17, independent unconditional: 59, dependent: 84, dependent conditional: 6, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4156, independent: 901, independent conditional: 3, independent unconditional: 898, dependent: 47, dependent conditional: 1, dependent unconditional: 46, unknown: 3208, unknown conditional: 15, unknown unconditional: 3193] , Statistics on independence cache: Total cache size (in pairs): 3208, Positive cache size: 3135, Positive conditional cache size: 11, Positive unconditional cache size: 3124, Negative cache size: 73, Negative conditional cache size: 4, Negative unconditional cache size: 69, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 659, Maximal queried relation: 3, Independence queries for same thread: 191 - 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-09-24 09:01:33,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Ended with exit code 0 [2024-09-24 09:01:33,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Forceful destruction successful, exit code 0 [2024-09-24 09:01:33,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Ended with exit code 0 [2024-09-24 09:01:34,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Ended with exit code 0 [2024-09-24 09:01:34,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Ended with exit code 0 [2024-09-24 09:01:34,495 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/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i ./goblint.2024-09-02_08-21-23.files/protection-local/28-race_reach_12-ptr_racefree.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-e94c40d-m [2024-09-24 09:01:36,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-24 09:01:36,499 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-09-24 09:01:36,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-24 09:01:36,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-24 09:01:36,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-24 09:01:36,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-24 09:01:36,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-24 09:01:36,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-24 09:01:36,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-24 09:01:36,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-24 09:01:36,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-24 09:01:36,533 INFO L153 SettingsManager]: * Use SBE=true [2024-09-24 09:01:36,533 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-24 09:01:36,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-24 09:01:36,535 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-24 09:01:36,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-24 09:01:36,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-24 09:01:36,539 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-24 09:01:36,539 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-24 09:01:36,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-24 09:01:36,539 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-24 09:01:36,540 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-24 09:01:36,540 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-24 09:01:36,540 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-24 09:01:36,540 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-24 09:01:36,540 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-24 09:01:36,540 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-24 09:01:36,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-24 09:01:36,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-24 09:01:36,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-24 09:01:36,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-24 09:01:36,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-24 09:01:36,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-24 09:01:36,542 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-24 09:01:36,549 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-24 09:01:36,549 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-24 09:01:36,549 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-24 09:01:36,549 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-24 09:01:36,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-24 09:01:36,550 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-24 09:01:36,550 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-24 09:01:36,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-24 09:01:36,551 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.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-09-24 09:01:36,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-24 09:01:36,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-24 09:01:36,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-24 09:01:36,860 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-24 09:01:36,863 INFO L274 PluginConnector]: CDTParser initialized [2024-09-24 09:01:36,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i [2024-09-24 09:01:38,200 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-24 09:01:38,372 INFO L384 CDTParser]: Found 1 translation units. [2024-09-24 09:01:38,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i [2024-09-24 09:01:38,392 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3b713d128/b9e79a6dac5340f5b62eefe3af189bf9/FLAGdffa5a374 [2024-09-24 09:01:38,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3b713d128/b9e79a6dac5340f5b62eefe3af189bf9 [2024-09-24 09:01:38,760 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-24 09:01:38,760 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-24 09:01:38,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-09-02_08-21-23.files/protection-local/28-race_reach_12-ptr_racefree.yml/witness.yml [2024-09-24 09:01:38,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-24 09:01:38,803 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-24 09:01:38,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-24 09:01:38,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-24 09:01:38,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-24 09:01:38,811 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 09:01:38" (1/2) ... [2024-09-24 09:01:38,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57101866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:01:38, skipping insertion in model container [2024-09-24 09:01:38,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 09:01:38" (1/2) ... [2024-09-24 09:01:38,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1b25235d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:01:38, skipping insertion in model container [2024-09-24 09:01:38,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 24.09 09:01:38" (2/2) ... [2024-09-24 09:01:38,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57101866 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 09:01:38, skipping insertion in model container [2024-09-24 09:01:38,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 24.09 09:01:38" (2/2) ... [2024-09-24 09:01:38,834 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-24 09:01:38,836 INFO L1541 ArrayList]: Location invariant before [L703-L703] 0 <= global [2024-09-24 09:01:38,836 INFO L1541 ArrayList]: Location invariant before [L710-L710] 0 <= global [2024-09-24 09:01:38,836 INFO L1541 ArrayList]: Location invariant before [L703-L703] 1 <= global [2024-09-24 09:01:38,837 INFO L1541 ArrayList]: Location invariant before [L710-L710] 0 <= global [2024-09-24 09:01:38,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-24 09:01:39,131 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i[30176,30189] [2024-09-24 09:01:39,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 09:01:39,163 INFO L200 MainTranslator]: Completed pre-run [2024-09-24 09:01:39,209 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i[30176,30189] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-09-24 09:01:39,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 09:01:39,279 INFO L204 MainTranslator]: Completed translation [2024-09-24 09:01:39,280 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 09:01:39 WrapperNode [2024-09-24 09:01:39,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-24 09:01:39,280 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-24 09:01:39,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-24 09:01:39,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-24 09:01:39,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 09:01:39" (1/1) ... [2024-09-24 09:01:39,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 09:01:39" (1/1) ... [2024-09-24 09:01:39,329 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97 [2024-09-24 09:01:39,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-24 09:01:39,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-24 09:01:39,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-24 09:01:39,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-24 09:01:39,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 09:01:39" (1/1) ... [2024-09-24 09:01:39,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 09:01:39" (1/1) ... [2024-09-24 09:01:39,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 09:01:39" (1/1) ... [2024-09-24 09:01:39,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 09:01:39" (1/1) ... [2024-09-24 09:01:39,357 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 09:01:39" (1/1) ... [2024-09-24 09:01:39,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 09:01:39" (1/1) ... [2024-09-24 09:01:39,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 09:01:39" (1/1) ... [2024-09-24 09:01:39,363 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 09:01:39" (1/1) ... [2024-09-24 09:01:39,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-24 09:01:39,370 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-24 09:01:39,370 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-24 09:01:39,370 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-24 09:01:39,371 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 09:01:39" (1/1) ... [2024-09-24 09:01:39,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-24 09:01:39,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 09:01:39,396 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-09-24 09:01:39,398 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-09-24 09:01:39,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-09-24 09:01:39,430 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-09-24 09:01:39,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-24 09:01:39,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-24 09:01:39,431 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-09-24 09:01:39,431 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-09-24 09:01:39,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-24 09:01:39,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-09-24 09:01:39,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-09-24 09:01:39,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-09-24 09:01:39,431 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-09-24 09:01:39,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-24 09:01:39,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-24 09:01:39,432 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-24 09:01:39,549 INFO L242 CfgBuilder]: Building ICFG [2024-09-24 09:01:39,551 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-24 09:01:39,746 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-24 09:01:39,747 INFO L291 CfgBuilder]: Performing block encoding [2024-09-24 09:01:39,997 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-24 09:01:39,998 INFO L318 CfgBuilder]: Removed 10 assume(true) statements. [2024-09-24 09:01:39,999 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 09:01:39 BoogieIcfgContainer [2024-09-24 09:01:39,999 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-24 09:01:40,000 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-24 09:01:40,000 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-24 09:01:40,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-24 09:01:40,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 09:01:38" (1/4) ... [2024-09-24 09:01:40,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be842d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 09:01:40, skipping insertion in model container [2024-09-24 09:01:40,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 24.09 09:01:38" (2/4) ... [2024-09-24 09:01:40,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be842d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 24.09 09:01:40, skipping insertion in model container [2024-09-24 09:01:40,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 09:01:39" (3/4) ... [2024-09-24 09:01:40,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be842d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 24.09 09:01:40, skipping insertion in model container [2024-09-24 09:01:40,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 09:01:39" (4/4) ... [2024-09-24 09:01:40,009 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_12-ptr_racefree.i [2024-09-24 09:01:40,022 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-24 09:01:40,023 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-09-24 09:01:40,023 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-24 09:01:40,054 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-09-24 09:01:40,088 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 09:01:40,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 09:01:40,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 09:01:40,090 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-09-24 09:01:40,091 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-09-24 09:01:40,118 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 09:01:40,127 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-09-24 09:01:40,132 INFO L336 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;@1aacc012, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 09:01:40,132 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-24 09:01:40,254 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:01:40,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:01:40,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1409461478, now seen corresponding path program 1 times [2024-09-24 09:01:40,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:01:40,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523794104] [2024-09-24 09:01:40,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:01:40,269 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-09-24 09:01:40,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:01:40,291 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-09-24 09:01:40,292 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-09-24 09:01:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:01:40,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-24 09:01:40,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:01:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-24 09:01:40,396 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:01:40,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:01:40,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1523794104] [2024-09-24 09:01:40,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1523794104] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:01:40,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:01:40,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 09:01:40,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453721940] [2024-09-24 09:01:40,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:01:40,402 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-24 09:01:40,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:01:40,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-24 09:01:40,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 09:01:40,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:40,424 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:01:40,425 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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-09-24 09:01:40,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:40,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:40,463 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 (3)] Ended with exit code 0 [2024-09-24 09:01:40,652 WARN L456 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-09-24 09:01:40,653 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:01:40,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:01:40,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1340007802, now seen corresponding path program 1 times [2024-09-24 09:01:40,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:01:40,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769174521] [2024-09-24 09:01:40,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:01:40,658 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-09-24 09:01:40,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:01:40,659 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-09-24 09:01:40,660 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-09-24 09:01:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:01:40,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-24 09:01:40,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:01:40,806 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-24 09:01:40,807 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-09-24 09:01:40,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:01:40,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:01:40,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 09:01:40,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 09:01:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 09:01:41,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:01:41,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769174521] [2024-09-24 09:01:41,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769174521] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 09:01:41,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 09:01:41,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2024-09-24 09:01:41,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420300931] [2024-09-24 09:01:41,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 09:01:41,024 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 09:01:41,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:01:41,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 09:01:41,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=14, Unknown=3, NotChecked=0, Total=30 [2024-09-24 09:01:41,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:41,025 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:01:41,026 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-09-24 09:01:41,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:41,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:41,057 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_22 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv0 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_22) |c_~#global~0.base|) |c_~#global~0.offset|))) (bvsle (_ bv0 32) (select (select |c_#memory_int| |c_~#global~0.base|) |c_~#global~0.offset|))) is different from false [2024-09-24 09:01:41,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:41,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:01:41,079 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 (4)] Ended with exit code 0 [2024-09-24 09:01:41,278 WARN L456 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-09-24 09:01:41,279 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:01:41,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:01:41,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1900376336, now seen corresponding path program 1 times [2024-09-24 09:01:41,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:01:41,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563497935] [2024-09-24 09:01:41,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:01:41,280 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-09-24 09:01:41,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:01:41,284 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-09-24 09:01:41,285 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-09-24 09:01:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:01:41,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-24 09:01:41,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:01:41,394 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-24 09:01:41,395 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-09-24 09:01:41,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:01:41,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:01:41,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-09-24 09:01:41,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:01:41,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 09:01:41,801 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_40 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv1 32) (bvadd (_ bv1 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_40) |c_~#global~0.base|) |c_~#global~0.offset|)))) is different from false [2024-09-24 09:01:41,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-09-24 09:01:41,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:01:41,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563497935] [2024-09-24 09:01:41,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563497935] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 09:01:41,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 09:01:41,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-09-24 09:01:41,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871606748] [2024-09-24 09:01:41,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 09:01:41,811 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-24 09:01:41,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:01:41,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-24 09:01:41,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=45, Unknown=7, NotChecked=14, Total=90 [2024-09-24 09:01:41,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:41,814 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:01:41,814 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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-09-24 09:01:41,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:41,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:01:41,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:42,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:42,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 09:01:42,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 09:01:42,987 INFO L785 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 2 remaining) [2024-09-24 09:01:42,987 INFO L785 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 2 remaining) [2024-09-24 09:01:42,992 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 (5)] Ended with exit code 0 [2024-09-24 09:01:43,188 WARN L456 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-09-24 09:01:43,193 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-09-24 09:01:43,194 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE,SAFE (1/2) [2024-09-24 09:01:43,196 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 09:01:43,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 09:01:43,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 09:01:43,198 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-24 09:01:43,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-09-24 09:01:43,202 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 09:01:43,202 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-24 09:01:43,203 INFO L336 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;@1aacc012, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 09:01:43,203 INFO L337 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-09-24 09:01:43,239 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 09:01:43,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:01:43,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1982956789, now seen corresponding path program 1 times [2024-09-24 09:01:43,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:01:43,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281468389] [2024-09-24 09:01:43,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:01:43,240 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-09-24 09:01:43,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:01:43,243 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-09-24 09:01:43,244 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-09-24 09:01:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:01:43,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-24 09:01:43,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:01:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:01:43,302 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:01:43,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:01:43,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281468389] [2024-09-24 09:01:43,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281468389] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:01:43,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:01:43,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 09:01:43,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625709930] [2024-09-24 09:01:43,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:01:43,303 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-24 09:01:43,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:01:43,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-24 09:01:43,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 09:01:43,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:43,304 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:01:43,304 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-09-24 09:01:43,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:43,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:43,331 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 (7)] Ended with exit code 0 [2024-09-24 09:01:43,527 WARN L456 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-09-24 09:01:43,528 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 09:01:43,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:01:43,528 INFO L85 PathProgramCache]: Analyzing trace with hash 256811667, now seen corresponding path program 1 times [2024-09-24 09:01:43,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:01:43,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310093534] [2024-09-24 09:01:43,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:01:43,529 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-09-24 09:01:43,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:01:43,531 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-09-24 09:01:43,533 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-09-24 09:01:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 09:01:43,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-24 09:01:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 09:01:43,643 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-09-24 09:01:43,646 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-24 09:01:43,647 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-09-24 09:01:43,647 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-09-24 09:01:43,647 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-09-24 09:01:43,647 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-09-24 09:01:43,653 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 (8)] Forceful destruction successful, exit code 0 [2024-09-24 09:01:43,847 WARN L456 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-09-24 09:01:43,849 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1] [2024-09-24 09:01:43,850 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2024-09-24 09:01:43,850 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-24 09:01:43,850 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-09-24 09:01:43,869 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-09-24 09:01:43,871 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 09:01:43,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 09:01:43,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 09:01:43,873 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-24 09:01:43,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2024-09-24 09:01:43,877 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 09:01:43,877 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-09-24 09:01:43,879 INFO L336 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;@1aacc012, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 09:01:43,880 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-24 09:01:44,209 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:01:44,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:01:44,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1412216993, now seen corresponding path program 1 times [2024-09-24 09:01:44,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:01:44,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639561779] [2024-09-24 09:01:44,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:01:44,211 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-09-24 09:01:44,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:01:44,214 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-09-24 09:01:44,215 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-09-24 09:01:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:01:44,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-24 09:01:44,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:01:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-24 09:01:44,287 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:01:44,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:01:44,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639561779] [2024-09-24 09:01:44,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639561779] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:01:44,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:01:44,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 09:01:44,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622245584] [2024-09-24 09:01:44,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:01:44,288 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-24 09:01:44,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:01:44,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-24 09:01:44,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 09:01:44,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:44,292 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:01:44,292 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 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-09-24 09:01:44,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:44,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:44,335 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 (10)] Forceful destruction successful, exit code 0 [2024-09-24 09:01:44,529 WARN L456 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-09-24 09:01:44,530 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:01:44,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:01:44,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1337217498, now seen corresponding path program 1 times [2024-09-24 09:01:44,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:01:44,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515697814] [2024-09-24 09:01:44,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:01:44,531 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-09-24 09:01:44,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:01:44,533 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-09-24 09:01:44,533 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-09-24 09:01:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:01:44,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-24 09:01:44,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:01:44,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-09-24 09:01:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:01:44,607 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:01:44,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:01:44,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515697814] [2024-09-24 09:01:44,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515697814] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:01:44,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:01:44,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 09:01:44,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068496656] [2024-09-24 09:01:44,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:01:44,608 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 09:01:44,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:01:44,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 09:01:44,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 09:01:44,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:44,608 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:01:44,608 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-09-24 09:01:44,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:44,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:44,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:44,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:01:44,641 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 (11)] Forceful destruction successful, exit code 0 [2024-09-24 09:01:44,838 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-09-24 09:01:44,838 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:01:44,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:01:44,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1590475643, now seen corresponding path program 1 times [2024-09-24 09:01:44,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:01:44,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961251937] [2024-09-24 09:01:44,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:01:44,839 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-09-24 09:01:44,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:01:44,841 INFO L229 MonitoredProcess]: Starting monitored process 12 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-09-24 09:01:44,842 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 (12)] Waiting until timeout for monitored process [2024-09-24 09:01:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:01:44,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-24 09:01:44,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:01:44,923 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-24 09:01:44,923 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-09-24 09:01:44,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:01:44,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:01:45,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 09:01:45,013 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 09:01:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 09:01:45,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:01:45,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961251937] [2024-09-24 09:01:45,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961251937] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 09:01:45,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 09:01:45,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2024-09-24 09:01:45,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873015376] [2024-09-24 09:01:45,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 09:01:45,057 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 09:01:45,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:01:45,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 09:01:45,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=14, Unknown=3, NotChecked=0, Total=30 [2024-09-24 09:01:45,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:45,058 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:01:45,058 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 09:01:45,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:45,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:01:45,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:45,128 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_101 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv0 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_101) |c_~#global~0.base|) |c_~#global~0.offset|))) (bvsle (_ bv0 32) (select (select |c_#memory_int| |c_~#global~0.base|) |c_~#global~0.offset|))) is different from false [2024-09-24 09:01:45,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:45,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:01:45,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:01:45,201 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 (12)] Ended with exit code 0 [2024-09-24 09:01:45,398 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-09-24 09:01:45,398 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:01:45,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:01:45,398 INFO L85 PathProgramCache]: Analyzing trace with hash 595519048, now seen corresponding path program 1 times [2024-09-24 09:01:45,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:01:45,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735958719] [2024-09-24 09:01:45,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:01:45,399 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-09-24 09:01:45,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:01:45,400 INFO L229 MonitoredProcess]: Starting monitored process 13 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-09-24 09:01:45,401 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 (13)] Waiting until timeout for monitored process [2024-09-24 09:01:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:01:45,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-24 09:01:45,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:01:45,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-09-24 09:01:45,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-09-24 09:01:45,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-09-24 09:01:45,607 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 09:01:45,607 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:01:45,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:01:45,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735958719] [2024-09-24 09:01:45,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735958719] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:01:45,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:01:45,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 09:01:45,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979662918] [2024-09-24 09:01:45,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:01:45,608 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 09:01:45,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:01:45,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 09:01:45,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-24 09:01:45,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:45,609 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:01:45,609 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-09-24 09:01:45,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:45,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:01:45,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:01:45,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:45,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:45,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:01:45,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:01:45,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:01:45,659 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 (13)] Ended with exit code 0 [2024-09-24 09:01:45,855 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-09-24 09:01:45,855 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:01:45,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:01:45,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2059729271, now seen corresponding path program 1 times [2024-09-24 09:01:45,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:01:45,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779740685] [2024-09-24 09:01:45,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:01:45,856 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-09-24 09:01:45,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:01:45,858 INFO L229 MonitoredProcess]: Starting monitored process 14 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-09-24 09:01:45,859 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 (14)] Waiting until timeout for monitored process [2024-09-24 09:01:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:01:45,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-24 09:01:45,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:01:45,935 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-24 09:01:45,935 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-09-24 09:01:45,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:01:46,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:01:46,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-09-24 09:01:46,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:01:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 09:01:46,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 09:01:46,468 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_147 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#global~0.base| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_145) |c_~#global~0.base|))) (store .cse0 |c_~#global~0.offset| (bvadd (_ bv1 32) (select .cse0 |c_~#global~0.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_147) |c_~#global~0.base|) |c_~#global~0.offset|))) is different from false [2024-09-24 09:01:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 4 not checked. [2024-09-24 09:01:46,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:01:46,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779740685] [2024-09-24 09:01:46,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779740685] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 09:01:46,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 09:01:46,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2024-09-24 09:01:46,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792982065] [2024-09-24 09:01:46,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 09:01:46,479 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-24 09:01:46,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:01:46,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-24 09:01:46,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=45, Unknown=20, NotChecked=16, Total=110 [2024-09-24 09:01:46,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:46,480 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:01:46,480 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 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-09-24 09:01:46,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:46,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:01:46,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:01:46,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:01:46,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:48,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 09:01:50,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:50,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:01:50,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:01:50,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:01:50,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 09:01:50,692 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 (14)] Forceful destruction successful, exit code 0 [2024-09-24 09:01:50,888 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-09-24 09:01:50,888 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:01:50,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:01:50,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1350947485, now seen corresponding path program 1 times [2024-09-24 09:01:50,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:01:50,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419562114] [2024-09-24 09:01:50,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:01:50,889 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-09-24 09:01:50,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:01:50,892 INFO L229 MonitoredProcess]: Starting monitored process 15 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-09-24 09:01:50,893 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 (15)] Waiting until timeout for monitored process [2024-09-24 09:01:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:01:50,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-24 09:01:50,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:01:51,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-09-24 09:01:51,121 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-24 09:01:51,122 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:01:51,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:01:51,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419562114] [2024-09-24 09:01:51,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419562114] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:01:51,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:01:51,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 09:01:51,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615437105] [2024-09-24 09:01:51,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:01:51,123 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 09:01:51,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:01:51,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 09:01:51,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-24 09:01:51,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:51,123 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:01:51,123 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 09:01:51,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:51,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:01:51,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:01:51,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:01:51,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-24 09:01:51,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:51,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:51,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:01:51,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:01:51,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:01:51,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 09:01:51,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 09:01:51,524 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 (15)] Ended with exit code 0 [2024-09-24 09:01:51,720 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-09-24 09:01:51,721 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:01:51,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:01:51,721 INFO L85 PathProgramCache]: Analyzing trace with hash -395286238, now seen corresponding path program 1 times [2024-09-24 09:01:51,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:01:51,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153356739] [2024-09-24 09:01:51,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:01:51,721 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-09-24 09:01:51,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:01:51,723 INFO L229 MonitoredProcess]: Starting monitored process 16 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-09-24 09:01:51,724 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 (16)] Waiting until timeout for monitored process [2024-09-24 09:01:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:01:51,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-24 09:01:51,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:01:52,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-09-24 09:01:52,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-09-24 09:01:52,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:01:52,138 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:01:52,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:01:52,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153356739] [2024-09-24 09:01:52,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153356739] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:01:52,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:01:52,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-24 09:01:52,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648224090] [2024-09-24 09:01:52,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:01:52,139 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-24 09:01:52,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:01:52,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-24 09:01:52,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-09-24 09:01:52,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:52,140 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:01:52,140 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 09:01:52,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:52,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:01:52,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:01:52,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:01:52,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-24 09:01:52,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 09:01:52,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:53,435 WARN L854 $PredicateComparison]: unable to prove that (and (bvsle (_ bv1 32) (select (select |c_#memory_int| |c_~#global~0.base|) |c_~#global~0.offset|)) (forall ((v_ArrVal_147 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv1 32) (select (select (store (store |c_#memory_int| c_t_funThread1of2ForFork0_~p~0.base (let ((.cse0 (select |c_#memory_int| c_t_funThread1of2ForFork0_~p~0.base))) (store .cse0 c_t_funThread1of2ForFork0_~p~0.offset (bvadd (_ bv1 32) (select .cse0 c_t_funThread1of2ForFork0_~p~0.offset))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_147) |c_~#global~0.base|) |c_~#global~0.offset|)))) is different from false [2024-09-24 09:01:55,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 09:01:55,477 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_147 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv1 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_147) |c_~#global~0.base|) |c_~#global~0.offset|))) (bvsle (_ bv1 32) (select (select |c_#memory_int| |c_~#global~0.base|) |c_~#global~0.offset|)) (forall ((v_ArrVal_147 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv1 32) (select (select (store (store |c_#memory_int| c_t_funThread1of2ForFork0_~p~0.base (let ((.cse0 (select |c_#memory_int| c_t_funThread1of2ForFork0_~p~0.base))) (store .cse0 c_t_funThread1of2ForFork0_~p~0.offset (bvadd (_ bv1 32) (select .cse0 c_t_funThread1of2ForFork0_~p~0.offset))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_147) |c_~#global~0.base|) |c_~#global~0.offset|)))) is different from false [2024-09-24 09:01:55,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:55,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:01:55,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:01:55,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:01:55,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 09:01:55,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 09:01:55,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:01:55,506 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 (16)] Ended with exit code 0 [2024-09-24 09:01:55,702 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-09-24 09:01:55,702 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:01:55,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:01:55,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1952924707, now seen corresponding path program 2 times [2024-09-24 09:01:55,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:01:55,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456778990] [2024-09-24 09:01:55,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 09:01:55,703 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-09-24 09:01:55,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:01:55,705 INFO L229 MonitoredProcess]: Starting monitored process 17 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-09-24 09:01:55,706 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 (17)] Waiting until timeout for monitored process [2024-09-24 09:01:55,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-24 09:01:55,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 09:01:55,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-24 09:01:55,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:01:55,808 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-24 09:01:55,809 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-09-24 09:01:56,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:01:56,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-09-24 09:01:56,173 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-24 09:01:56,174 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 09:01:56,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 09:01:56,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 152 [2024-09-24 09:01:56,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 09:01:56,368 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 158 treesize of output 154 [2024-09-24 09:01:56,417 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 85 treesize of output 81 [2024-09-24 09:01:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 2 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-24 09:01:56,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:01:56,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456778990] [2024-09-24 09:01:56,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456778990] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 09:01:56,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 09:01:56,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-09-24 09:01:56,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267676449] [2024-09-24 09:01:56,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 09:01:56,530 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-24 09:01:56,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:01:56,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-24 09:01:56,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=70, Unknown=8, NotChecked=0, Total=110 [2024-09-24 09:01:56,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:56,531 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:01:56,531 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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-09-24 09:01:56,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:01:56,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:01:56,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:01:56,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:01:56,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-24 09:01:56,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 09:01:56,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:01:56,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:02,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:02,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:02,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:02:02,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:02:02,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 09:02:02,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 09:02:02,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:02:02,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-24 09:02:02,357 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 (17)] Ended with exit code 0 [2024-09-24 09:02:02,553 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-09-24 09:02:02,554 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:02:02,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:02:02,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1259614548, now seen corresponding path program 2 times [2024-09-24 09:02:02,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:02:02,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218574040] [2024-09-24 09:02:02,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 09:02:02,555 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-09-24 09:02:02,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:02:02,557 INFO L229 MonitoredProcess]: Starting monitored process 18 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-09-24 09:02:02,558 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 (18)] Waiting until timeout for monitored process [2024-09-24 09:02:02,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-24 09:02:02,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 09:02:02,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-24 09:02:02,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:02:02,670 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-24 09:02:02,670 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-09-24 09:02:02,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:02:02,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:02:02,989 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-09-24 09:02:03,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-09-24 09:02:03,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:02:03,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-09-24 09:02:03,367 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 09:02:03,367 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 09:02:03,924 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv1 32) (bvadd (_ bv1 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_285) |c_~#global~0.base|) |c_~#global~0.offset|)))) is different from false [2024-09-24 09:02:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2024-09-24 09:02:03,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:02:03,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218574040] [2024-09-24 09:02:03,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218574040] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 09:02:03,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 09:02:03,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2024-09-24 09:02:03,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924122272] [2024-09-24 09:02:03,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 09:02:03,936 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-24 09:02:03,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:02:03,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-24 09:02:03,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=78, Unknown=18, NotChecked=20, Total=156 [2024-09-24 09:02:03,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:03,937 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:02:03,937 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 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-09-24 09:02:03,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:03,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:03,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 09:02:03,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:02:03,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-24 09:02:03,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 09:02:03,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:02:03,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-09-24 09:02:03,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:04,817 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv1 32) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_285))) (store .cse0 c_t_funThread1of2ForFork0_~p~0.base (let ((.cse1 (select .cse0 c_t_funThread1of2ForFork0_~p~0.base))) (store .cse1 c_t_funThread1of2ForFork0_~p~0.offset (bvadd (_ bv1 32) (select .cse1 c_t_funThread1of2ForFork0_~p~0.offset)))))) |c_~#global~0.base|) |c_~#global~0.offset|))) (bvsle (_ bv1 32) (select (select (store |c_#memory_int| c_t_funThread1of2ForFork0_~p~0.base (let ((.cse2 (select |c_#memory_int| c_t_funThread1of2ForFork0_~p~0.base))) (store .cse2 c_t_funThread1of2ForFork0_~p~0.offset (bvadd (_ bv1 32) (select .cse2 c_t_funThread1of2ForFork0_~p~0.offset))))) |c_~#global~0.base|) |c_~#global~0.offset|))) is different from false [2024-09-24 09:02:07,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 09:02:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:02:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 09:02:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 09:02:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:02:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-24 09:02:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-24 09:02:07,094 INFO L785 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 2 remaining) [2024-09-24 09:02:07,095 INFO L785 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 2 remaining) [2024-09-24 09:02:07,100 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 (18)] Ended with exit code 0 [2024-09-24 09:02:07,295 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-09-24 09:02:07,296 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2024-09-24 09:02:07,297 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was SAFE,SAFE (1/3) [2024-09-24 09:02:07,298 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 09:02:07,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 09:02:07,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 09:02:07,299 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-24 09:02:07,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (19)] Waiting until timeout for monitored process [2024-09-24 09:02:07,303 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 09:02:07,303 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-24 09:02:07,304 INFO L336 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;@1aacc012, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 09:02:07,304 INFO L337 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-09-24 09:02:07,357 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 09:02:07,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:02:07,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1490163955, now seen corresponding path program 1 times [2024-09-24 09:02:07,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:02:07,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562799567] [2024-09-24 09:02:07,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:02:07,358 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-09-24 09:02:07,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:02:07,360 INFO L229 MonitoredProcess]: Starting monitored process 20 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-09-24 09:02:07,361 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 (20)] Waiting until timeout for monitored process [2024-09-24 09:02:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:02:07,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-24 09:02:07,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:02:07,419 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-24 09:02:07,419 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:02:07,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:02:07,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [562799567] [2024-09-24 09:02:07,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [562799567] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:02:07,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:02:07,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 09:02:07,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248807470] [2024-09-24 09:02:07,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:02:07,420 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-24 09:02:07,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:02:07,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-24 09:02:07,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 09:02:07,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:07,420 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:02:07,420 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 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-09-24 09:02:07,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:07,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:07,499 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 (20)] Forceful destruction successful, exit code 0 [2024-09-24 09:02:07,695 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-09-24 09:02:07,696 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 09:02:07,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:02:07,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1224307985, now seen corresponding path program 1 times [2024-09-24 09:02:07,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:02:07,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1728761671] [2024-09-24 09:02:07,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:02:07,697 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-09-24 09:02:07,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:02:07,699 INFO L229 MonitoredProcess]: Starting monitored process 21 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-09-24 09:02:07,700 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 (21)] Waiting until timeout for monitored process [2024-09-24 09:02:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:02:07,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-24 09:02:07,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:02:07,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-09-24 09:02:07,783 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:02:07,783 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:02:07,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:02:07,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1728761671] [2024-09-24 09:02:07,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1728761671] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:02:07,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:02:07,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 09:02:07,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025997812] [2024-09-24 09:02:07,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:02:07,784 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 09:02:07,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:02:07,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 09:02:07,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 09:02:07,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:07,784 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:02:07,784 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-09-24 09:02:07,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:07,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:07,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:07,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:07,836 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 (21)] Forceful destruction successful, exit code 0 [2024-09-24 09:02:08,029 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-09-24 09:02:08,029 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 09:02:08,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:02:08,030 INFO L85 PathProgramCache]: Analyzing trace with hash 561278876, now seen corresponding path program 1 times [2024-09-24 09:02:08,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:02:08,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516686265] [2024-09-24 09:02:08,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:02:08,030 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-09-24 09:02:08,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:02:08,031 INFO L229 MonitoredProcess]: Starting monitored process 22 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-09-24 09:02:08,032 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 (22)] Waiting until timeout for monitored process [2024-09-24 09:02:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:02:08,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-24 09:02:08,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:02:08,107 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-24 09:02:08,108 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-09-24 09:02:08,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:02:08,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:02:08,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 09:02:08,213 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 09:02:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 09:02:08,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:02:08,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516686265] [2024-09-24 09:02:08,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516686265] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 09:02:08,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 09:02:08,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-09-24 09:02:08,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947499472] [2024-09-24 09:02:08,262 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 09:02:08,263 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 09:02:08,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:02:08,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 09:02:08,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=14, Unknown=3, NotChecked=0, Total=30 [2024-09-24 09:02:08,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:08,263 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:02:08,263 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 09:02:08,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:08,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:08,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:08,326 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv0 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_332) |c_~#global~0.base|) |c_~#global~0.offset|))) (bvsle (_ bv0 32) (select (select |c_#memory_int| |c_~#global~0.base|) |c_~#global~0.offset|))) is different from false [2024-09-24 09:02:08,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:08,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:08,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:02:08,394 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 (22)] Ended with exit code 0 [2024-09-24 09:02:08,589 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-09-24 09:02:08,590 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 09:02:08,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:02:08,590 INFO L85 PathProgramCache]: Analyzing trace with hash 628024322, now seen corresponding path program 1 times [2024-09-24 09:02:08,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:02:08,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996304924] [2024-09-24 09:02:08,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:02:08,591 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-09-24 09:02:08,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:02:08,593 INFO L229 MonitoredProcess]: Starting monitored process 23 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-09-24 09:02:08,594 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 (23)] Waiting until timeout for monitored process [2024-09-24 09:02:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:02:08,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-24 09:02:08,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:02:08,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-09-24 09:02:08,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 18 treesize of output 13 [2024-09-24 09:02:08,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-09-24 09:02:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 09:02:08,819 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:02:08,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:02:08,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996304924] [2024-09-24 09:02:08,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996304924] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:02:08,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:02:08,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 09:02:08,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014123827] [2024-09-24 09:02:08,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:02:08,819 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 09:02:08,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:02:08,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 09:02:08,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-24 09:02:08,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:08,820 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:02:08,820 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-09-24 09:02:08,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:08,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:08,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:02:08,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:02:08,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:02:08,867 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 (23)] Forceful destruction successful, exit code 0 [2024-09-24 09:02:09,063 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-09-24 09:02:09,064 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 09:02:09,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:02:09,064 INFO L85 PathProgramCache]: Analyzing trace with hash -236219551, now seen corresponding path program 1 times [2024-09-24 09:02:09,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:02:09,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110801808] [2024-09-24 09:02:09,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:02:09,065 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-09-24 09:02:09,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:02:09,067 INFO L229 MonitoredProcess]: Starting monitored process 24 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-09-24 09:02:09,068 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 (24)] Waiting until timeout for monitored process [2024-09-24 09:02:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 09:02:09,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-24 09:02:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 09:02:09,176 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-09-24 09:02:09,176 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-24 09:02:09,176 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-09-24 09:02:09,176 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-09-24 09:02:09,176 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-09-24 09:02:09,176 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-09-24 09:02:09,182 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 (24)] Ended with exit code 0 [2024-09-24 09:02:09,377 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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-09-24 09:02:09,378 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-09-24 09:02:09,378 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/3) [2024-09-24 09:02:09,378 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-24 09:02:09,378 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-09-24 09:02:09,392 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-09-24 09:02:09,394 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 09:02:09,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 09:02:09,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 09:02:09,395 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-24 09:02:09,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (25)] Waiting until timeout for monitored process [2024-09-24 09:02:09,398 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 09:02:09,398 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-24 09:02:09,398 INFO L336 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;@1aacc012, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 09:02:09,398 INFO L337 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-09-24 09:02:09,480 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 09:02:09,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:02:09,480 INFO L85 PathProgramCache]: Analyzing trace with hash 108318818, now seen corresponding path program 1 times [2024-09-24 09:02:09,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:02:09,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587513685] [2024-09-24 09:02:09,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:02:09,481 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-09-24 09:02:09,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:02:09,484 INFO L229 MonitoredProcess]: Starting monitored process 26 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-09-24 09:02:09,486 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 (26)] Waiting until timeout for monitored process [2024-09-24 09:02:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:02:09,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-24 09:02:09,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:02:09,558 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-24 09:02:09,558 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:02:09,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:02:09,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587513685] [2024-09-24 09:02:09,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587513685] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:02:09,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:02:09,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 09:02:09,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563706948] [2024-09-24 09:02:09,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:02:09,559 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-24 09:02:09,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:02:09,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-24 09:02:09,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 09:02:09,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:09,560 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:02:09,560 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 09:02:09,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:09,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:09,671 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 (26)] Forceful destruction successful, exit code 0 [2024-09-24 09:02:09,868 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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-09-24 09:02:09,868 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 09:02:09,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:02:09,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1039067680, now seen corresponding path program 1 times [2024-09-24 09:02:09,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:02:09,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204384375] [2024-09-24 09:02:09,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:02:09,869 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-09-24 09:02:09,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:02:09,870 INFO L229 MonitoredProcess]: Starting monitored process 27 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-09-24 09:02:09,871 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 (27)] Waiting until timeout for monitored process [2024-09-24 09:02:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:02:09,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-24 09:02:09,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:02:09,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-09-24 09:02:09,957 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-24 09:02:09,957 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:02:09,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:02:09,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204384375] [2024-09-24 09:02:09,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204384375] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:02:09,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:02:09,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 09:02:09,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587794163] [2024-09-24 09:02:09,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:02:09,957 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 09:02:09,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:02:09,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 09:02:09,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 09:02:09,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:09,958 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:02:09,958 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-09-24 09:02:09,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:09,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:09,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:09,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:10,003 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 (27)] Ended with exit code 0 [2024-09-24 09:02:10,199 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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-09-24 09:02:10,200 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 09:02:10,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:02:10,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1464234913, now seen corresponding path program 1 times [2024-09-24 09:02:10,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:02:10,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746299614] [2024-09-24 09:02:10,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:02:10,200 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-09-24 09:02:10,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:02:10,203 INFO L229 MonitoredProcess]: Starting monitored process 28 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-09-24 09:02:10,204 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 (28)] Waiting until timeout for monitored process [2024-09-24 09:02:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:02:10,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-24 09:02:10,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:02:10,305 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-24 09:02:10,306 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-09-24 09:02:10,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:02:10,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:02:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-24 09:02:10,386 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 09:02:10,404 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv0 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_430) |c_~#global~0.base|) |c_~#global~0.offset|))) is different from false [2024-09-24 09:02:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2024-09-24 09:02:10,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:02:10,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746299614] [2024-09-24 09:02:10,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746299614] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 09:02:10,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 09:02:10,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-09-24 09:02:10,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5077304] [2024-09-24 09:02:10,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 09:02:10,421 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 09:02:10,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:02:10,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 09:02:10,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=11, Unknown=1, NotChecked=6, Total=30 [2024-09-24 09:02:10,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:10,421 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:02:10,421 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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-09-24 09:02:10,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:10,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:10,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:10,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:10,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:10,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:02:10,617 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 (28)] Forceful destruction successful, exit code 0 [2024-09-24 09:02:10,814 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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-09-24 09:02:10,814 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 09:02:10,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:02:10,815 INFO L85 PathProgramCache]: Analyzing trace with hash -141537020, now seen corresponding path program 1 times [2024-09-24 09:02:10,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:02:10,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049211127] [2024-09-24 09:02:10,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:02:10,815 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-09-24 09:02:10,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:02:10,816 INFO L229 MonitoredProcess]: Starting monitored process 29 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-09-24 09:02:10,818 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 (29)] Waiting until timeout for monitored process [2024-09-24 09:02:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:02:10,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-24 09:02:10,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:02:10,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-09-24 09:02:10,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-09-24 09:02:11,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-09-24 09:02:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-24 09:02:11,034 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:02:11,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:02:11,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049211127] [2024-09-24 09:02:11,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049211127] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:02:11,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:02:11,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 09:02:11,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480302646] [2024-09-24 09:02:11,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:02:11,035 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 09:02:11,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:02:11,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 09:02:11,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-24 09:02:11,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:11,036 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:02:11,036 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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-09-24 09:02:11,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:11,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:11,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:02:11,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:11,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:02:11,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:02:11,142 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 (29)] Ended with exit code 0 [2024-09-24 09:02:11,338 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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-09-24 09:02:11,338 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 09:02:11,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:02:11,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1530298880, now seen corresponding path program 1 times [2024-09-24 09:02:11,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:02:11,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561788967] [2024-09-24 09:02:11,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:02:11,339 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-09-24 09:02:11,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:02:11,340 INFO L229 MonitoredProcess]: Starting monitored process 30 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-09-24 09:02:11,341 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 (30)] Waiting until timeout for monitored process [2024-09-24 09:02:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:02:11,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-24 09:02:11,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:02:11,439 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-24 09:02:11,439 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-09-24 09:02:11,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:02:11,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:02:11,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-09-24 09:02:11,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:02:11,724 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 09:02:11,724 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 09:02:13,841 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_481 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv1 32) (select (select (store (store |c_#memory_int| c_t_funThread1of3ForFork0_~p~0.base (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_478) c_t_funThread1of3ForFork0_~p~0.base))) (store .cse0 c_t_funThread1of3ForFork0_~p~0.offset (bvadd (_ bv1 32) (select .cse0 c_t_funThread1of3ForFork0_~p~0.offset))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_481) |c_~#global~0.base|) |c_~#global~0.offset|))) is different from false [2024-09-24 09:02:13,882 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_481 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#global~0.base| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_478) |c_~#global~0.base|))) (store .cse0 |c_~#global~0.offset| (bvadd (select .cse0 |c_~#global~0.offset|) (_ bv1 32))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_481) |c_~#global~0.base|) |c_~#global~0.offset|))) is different from false [2024-09-24 09:02:13,905 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-09-24 09:02:13,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:02:13,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561788967] [2024-09-24 09:02:13,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561788967] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 09:02:13,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 09:02:13,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2024-09-24 09:02:13,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42497331] [2024-09-24 09:02:13,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 09:02:13,906 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-24 09:02:13,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:02:13,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-24 09:02:13,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=40, Unknown=14, NotChecked=30, Total=110 [2024-09-24 09:02:13,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:13,906 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:02:13,906 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 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-09-24 09:02:13,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:13,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:13,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:02:13,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:02:13,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:14,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:14,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:14,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:02:14,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:02:14,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 09:02:14,398 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 (30)] Forceful destruction successful, exit code 0 [2024-09-24 09:02:14,595 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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-09-24 09:02:14,595 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-24 09:02:14,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:02:14,595 INFO L85 PathProgramCache]: Analyzing trace with hash 754949187, now seen corresponding path program 1 times [2024-09-24 09:02:14,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:02:14,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782593035] [2024-09-24 09:02:14,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:02:14,596 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-09-24 09:02:14,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:02:14,597 INFO L229 MonitoredProcess]: Starting monitored process 31 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-09-24 09:02:14,598 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 (31)] Waiting until timeout for monitored process [2024-09-24 09:02:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 09:02:14,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-24 09:02:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 09:02:14,750 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-09-24 09:02:14,751 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-24 09:02:14,751 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-09-24 09:02:14,751 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-09-24 09:02:14,751 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-09-24 09:02:14,751 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-09-24 09:02:14,756 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 (31)] Forceful destruction successful, exit code 0 [2024-09-24 09:02:14,951 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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-09-24 09:02:14,953 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-09-24 09:02:14,953 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/4) [2024-09-24 09:02:14,953 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-24 09:02:14,953 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-09-24 09:02:14,973 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-09-24 09:02:14,974 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 09:02:14,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 09:02:14,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 09:02:14,975 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-24 09:02:14,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (32)] Waiting until timeout for monitored process [2024-09-24 09:02:14,978 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 09:02:14,979 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread4of4ForFork0 ======== [2024-09-24 09:02:14,979 INFO L336 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;@1aacc012, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 09:02:14,979 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-24 09:02:15,105 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:02:15,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:02:15,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1793589666, now seen corresponding path program 1 times [2024-09-24 09:02:15,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:02:15,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641466484] [2024-09-24 09:02:15,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:02:15,105 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-09-24 09:02:15,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:02:15,108 INFO L229 MonitoredProcess]: Starting monitored process 33 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-09-24 09:02:15,110 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 (33)] Waiting until timeout for monitored process [2024-09-24 09:02:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:02:15,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-24 09:02:15,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:02:15,198 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-24 09:02:15,198 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:02:15,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:02:15,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641466484] [2024-09-24 09:02:15,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641466484] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:02:15,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:02:15,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 09:02:15,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178691072] [2024-09-24 09:02:15,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:02:15,199 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-24 09:02:15,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:02:15,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-24 09:02:15,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 09:02:15,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:15,200 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:02:15,200 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-09-24 09:02:15,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:15,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:15,371 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 (33)] Forceful destruction successful, exit code 0 [2024-09-24 09:02:15,568 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /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-09-24 09:02:15,568 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:02:15,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:02:15,568 INFO L85 PathProgramCache]: Analyzing trace with hash 2082636515, now seen corresponding path program 1 times [2024-09-24 09:02:15,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:02:15,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581131183] [2024-09-24 09:02:15,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:02:15,569 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-09-24 09:02:15,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:02:15,570 INFO L229 MonitoredProcess]: Starting monitored process 34 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-09-24 09:02:15,570 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 (34)] Waiting until timeout for monitored process [2024-09-24 09:02:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:02:15,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-24 09:02:15,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:02:15,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-09-24 09:02:15,674 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-24 09:02:15,674 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:02:15,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:02:15,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581131183] [2024-09-24 09:02:15,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581131183] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:02:15,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:02:15,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 09:02:15,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970867226] [2024-09-24 09:02:15,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:02:15,675 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 09:02:15,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:02:15,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 09:02:15,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 09:02:15,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:15,676 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:02:15,676 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-09-24 09:02:15,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:15,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:16,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:16,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:16,010 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 (34)] Forceful destruction successful, exit code 0 [2024-09-24 09:02:16,206 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /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-09-24 09:02:16,207 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:02:16,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:02:16,207 INFO L85 PathProgramCache]: Analyzing trace with hash -744020649, now seen corresponding path program 1 times [2024-09-24 09:02:16,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:02:16,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248621910] [2024-09-24 09:02:16,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:02:16,207 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-09-24 09:02:16,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:02:16,209 INFO L229 MonitoredProcess]: Starting monitored process 35 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-09-24 09:02:16,209 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 (35)] Waiting until timeout for monitored process [2024-09-24 09:02:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:02:16,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-24 09:02:16,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:02:16,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-09-24 09:02:16,346 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-24 09:02:16,346 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:02:16,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:02:16,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248621910] [2024-09-24 09:02:16,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248621910] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:02:16,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:02:16,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 09:02:16,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921542320] [2024-09-24 09:02:16,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:02:16,347 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 09:02:16,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:02:16,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 09:02:16,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 09:02:16,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:16,347 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:02:16,348 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-09-24 09:02:16,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:16,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:16,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:16,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:16,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:16,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:16,641 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 (35)] Ended with exit code 0 [2024-09-24 09:02:16,837 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /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-09-24 09:02:16,837 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:02:16,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:02:16,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1244164124, now seen corresponding path program 1 times [2024-09-24 09:02:16,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:02:16,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679585237] [2024-09-24 09:02:16,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:02:16,838 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-09-24 09:02:16,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:02:16,839 INFO L229 MonitoredProcess]: Starting monitored process 36 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-09-24 09:02:16,840 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 (36)] Waiting until timeout for monitored process [2024-09-24 09:02:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:02:16,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-24 09:02:16,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:02:17,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-09-24 09:02:17,398 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-09-24 09:02:17,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-09-24 09:02:17,503 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-24 09:02:17,503 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:02:17,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:02:17,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679585237] [2024-09-24 09:02:17,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679585237] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:02:17,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:02:17,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-24 09:02:17,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476852194] [2024-09-24 09:02:17,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:02:17,504 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-24 09:02:17,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:02:17,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-24 09:02:17,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-09-24 09:02:17,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:17,504 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:02:17,505 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 09:02:17,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:17,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:17,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:17,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:17,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:17,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:17,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:17,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 09:02:17,883 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 (36)] Forceful destruction successful, exit code 0 [2024-09-24 09:02:18,079 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /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-09-24 09:02:18,080 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:02:18,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:02:18,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1703418428, now seen corresponding path program 1 times [2024-09-24 09:02:18,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:02:18,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358681486] [2024-09-24 09:02:18,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:02:18,081 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-09-24 09:02:18,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:02:18,083 INFO L229 MonitoredProcess]: Starting monitored process 37 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-09-24 09:02:18,084 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 (37)] Waiting until timeout for monitored process [2024-09-24 09:02:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:02:18,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-24 09:02:18,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:02:18,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-09-24 09:02:18,934 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-09-24 09:02:19,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-09-24 09:02:19,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-09-24 09:02:19,158 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-24 09:02:19,158 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:02:19,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:02:19,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358681486] [2024-09-24 09:02:19,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358681486] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:02:19,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:02:19,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-24 09:02:19,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130001938] [2024-09-24 09:02:19,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:02:19,159 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-24 09:02:19,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:02:19,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-24 09:02:19,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-09-24 09:02:19,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:19,159 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:02:19,159 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 10.11111111111111) internal successors, (91), 10 states have internal predecessors, (91), 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-09-24 09:02:19,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:19,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:19,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:19,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 09:02:19,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:19,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:19,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:19,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:19,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:02:19,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 09:02:19,943 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 (37)] Forceful destruction successful, exit code 0 [2024-09-24 09:02:20,139 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /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-09-24 09:02:20,140 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:02:20,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:02:20,140 INFO L85 PathProgramCache]: Analyzing trace with hash 340456644, now seen corresponding path program 2 times [2024-09-24 09:02:20,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:02:20,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854732285] [2024-09-24 09:02:20,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 09:02:20,140 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-09-24 09:02:20,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:02:20,142 INFO L229 MonitoredProcess]: Starting monitored process 38 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-09-24 09:02:20,142 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 (38)] Waiting until timeout for monitored process [2024-09-24 09:02:20,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-24 09:02:20,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 09:02:20,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-24 09:02:20,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:02:20,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-09-24 09:02:20,998 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-09-24 09:02:21,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-09-24 09:02:21,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-09-24 09:02:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-24 09:02:21,283 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:02:21,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:02:21,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854732285] [2024-09-24 09:02:21,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854732285] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:02:21,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:02:21,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-24 09:02:21,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773678642] [2024-09-24 09:02:21,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:02:21,284 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-24 09:02:21,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:02:21,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-24 09:02:21,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-09-24 09:02:21,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:21,285 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:02:21,285 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.1) internal successors, (91), 11 states have internal predecessors, (91), 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-09-24 09:02:21,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:21,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:21,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:21,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:02:21,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-24 09:02:21,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:22,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:22,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:22,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:22,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:02:22,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 09:02:22,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-24 09:02:22,220 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 (38)] Forceful destruction successful, exit code 0 [2024-09-24 09:02:22,415 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /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-09-24 09:02:22,415 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:02:22,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:02:22,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1483870016, now seen corresponding path program 1 times [2024-09-24 09:02:22,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:02:22,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810699214] [2024-09-24 09:02:22,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:02:22,416 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-09-24 09:02:22,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:02:22,417 INFO L229 MonitoredProcess]: Starting monitored process 39 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-09-24 09:02:22,417 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 (39)] Waiting until timeout for monitored process [2024-09-24 09:02:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:02:22,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-24 09:02:22,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:02:22,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-09-24 09:02:22,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-09-24 09:02:22,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-09-24 09:02:22,658 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-24 09:02:22,658 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 09:02:22,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:02:22,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810699214] [2024-09-24 09:02:22,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810699214] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 09:02:22,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 09:02:22,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 09:02:22,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212020976] [2024-09-24 09:02:22,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 09:02:22,658 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 09:02:22,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:02:22,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 09:02:22,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-24 09:02:22,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:22,659 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:02:22,659 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 09:02:22,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:22,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:22,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:22,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:02:22,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-24 09:02:22,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-24 09:02:22,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:24,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:24,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:24,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:24,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:02:24,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 09:02:24,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-24 09:02:24,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:02:24,436 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 (39)] Ended with exit code 0 [2024-09-24 09:02:24,632 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /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-09-24 09:02:24,632 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:02:24,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:02:24,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1105418971, now seen corresponding path program 1 times [2024-09-24 09:02:24,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:02:24,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283329930] [2024-09-24 09:02:24,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:02:24,633 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-09-24 09:02:24,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:02:24,634 INFO L229 MonitoredProcess]: Starting monitored process 40 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-09-24 09:02:24,635 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 (40)] Waiting until timeout for monitored process [2024-09-24 09:02:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:02:24,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-24 09:02:24,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:02:24,767 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-24 09:02:24,767 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-09-24 09:02:25,099 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 8 treesize of output 1 [2024-09-24 09:02:25,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:02:25,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-09-24 09:02:25,259 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-24 09:02:25,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 09:02:25,474 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 134 treesize of output 126 [2024-09-24 09:02:25,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 09:02:25,486 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 146 treesize of output 144 [2024-09-24 09:02:25,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 09:02:25,502 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 138 treesize of output 136 [2024-09-24 09:02:25,710 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 4 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-24 09:02:25,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:02:25,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283329930] [2024-09-24 09:02:25,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283329930] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 09:02:25,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 09:02:25,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-09-24 09:02:25,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523411298] [2024-09-24 09:02:25,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 09:02:25,711 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-24 09:02:25,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:02:25,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-24 09:02:25,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=85, Unknown=8, NotChecked=0, Total=132 [2024-09-24 09:02:25,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:25,712 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:02:25,712 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 10.909090909090908) internal successors, (120), 11 states have internal predecessors, (120), 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-09-24 09:02:25,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:25,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:25,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:25,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:02:25,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-24 09:02:25,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-24 09:02:25,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:02:25,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:27,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:02:27,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:27,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:02:27,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:02:27,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 09:02:27,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-24 09:02:27,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:02:27,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-24 09:02:27,944 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 (40)] Forceful destruction successful, exit code 0 [2024-09-24 09:02:28,140 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /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-09-24 09:02:28,140 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:02:28,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:02:28,141 INFO L85 PathProgramCache]: Analyzing trace with hash 151979082, now seen corresponding path program 3 times [2024-09-24 09:02:28,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:02:28,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063171236] [2024-09-24 09:02:28,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-24 09:02:28,141 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-09-24 09:02:28,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:02:28,142 INFO L229 MonitoredProcess]: Starting monitored process 41 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-09-24 09:02:28,144 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 (41)] Waiting until timeout for monitored process [2024-09-24 09:02:28,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-24 09:02:28,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 09:02:28,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-24 09:02:28,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:02:28,369 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-24 09:02:28,370 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-09-24 09:02:28,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-09-24 09:02:28,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-09-24 09:02:29,133 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2024-09-24 09:02:29,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2024-09-24 09:02:29,415 INFO L349 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2024-09-24 09:02:29,415 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 2 case distinctions, treesize of input 42 treesize of output 53 [2024-09-24 09:02:29,704 INFO L349 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2024-09-24 09:02:29,705 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 2 case distinctions, treesize of input 27 treesize of output 42 [2024-09-24 09:02:30,117 INFO L349 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2024-09-24 09:02:30,118 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 2 case distinctions, treesize of input 42 treesize of output 53 [2024-09-24 09:02:30,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-09-24 09:02:30,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-09-24 09:02:30,358 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-24 09:02:30,358 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 09:02:30,556 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1032 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1032))) (or (bvsle (_ bv1 32) (select (select (store .cse0 c_t_funThread4of4ForFork0_~p~0.base (let ((.cse1 (select .cse0 c_t_funThread4of4ForFork0_~p~0.base))) (store .cse1 c_t_funThread4of4ForFork0_~p~0.offset (bvadd (_ bv1 32) (select .cse1 c_t_funThread4of4ForFork0_~p~0.offset))))) |c_~#global~0.base|) |c_~#global~0.offset|)) (not (bvsle (_ bv0 32) (select (select .cse0 |c_~#global~0.base|) |c_~#global~0.offset|)))))) is different from false [2024-09-24 09:02:30,581 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1032 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| c_t_funThread3of4ForFork0_~p~0.base (let ((.cse2 (select |c_#memory_int| c_t_funThread3of4ForFork0_~p~0.base))) (store .cse2 c_t_funThread3of4ForFork0_~p~0.offset (bvadd (select .cse2 c_t_funThread3of4ForFork0_~p~0.offset) (_ bv4294967295 32))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1032))) (or (not (bvsle (_ bv0 32) (select (select .cse0 |c_~#global~0.base|) |c_~#global~0.offset|))) (bvsle (_ bv1 32) (select (select (store .cse0 c_t_funThread4of4ForFork0_~p~0.base (let ((.cse1 (select .cse0 c_t_funThread4of4ForFork0_~p~0.base))) (store .cse1 c_t_funThread4of4ForFork0_~p~0.offset (bvadd (_ bv1 32) (select .cse1 c_t_funThread4of4ForFork0_~p~0.offset))))) |c_~#global~0.base|) |c_~#global~0.offset|))))) is different from false [2024-09-24 09:02:32,848 WARN L854 $PredicateComparison]: unable to prove that (forall ((t_funThread3of4ForFork0_~p~0.base (_ BitVec 32)) (t_funThread3of4ForFork0_~p~0.offset (_ BitVec 32))) (let ((.cse0 (select |c_#memory_int| t_funThread3of4ForFork0_~p~0.base))) (let ((.cse1 (select .cse0 t_funThread3of4ForFork0_~p~0.offset))) (or (not (bvsle (_ bv1 32) (select (select (store |c_#memory_int| t_funThread3of4ForFork0_~p~0.base (store .cse0 t_funThread3of4ForFork0_~p~0.offset (bvadd (_ bv1 32) .cse1))) |c_~#global~0.base|) |c_~#global~0.offset|))) (forall ((v_ArrVal_1032 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_int| t_funThread3of4ForFork0_~p~0.base (store .cse0 t_funThread3of4ForFork0_~p~0.offset .cse1)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1032))) (or (bvsle (_ bv1 32) (select (select (store .cse2 c_t_funThread4of4ForFork0_~p~0.base (let ((.cse3 (select .cse2 c_t_funThread4of4ForFork0_~p~0.base))) (store .cse3 c_t_funThread4of4ForFork0_~p~0.offset (bvadd (_ bv1 32) (select .cse3 c_t_funThread4of4ForFork0_~p~0.offset))))) |c_~#global~0.base|) |c_~#global~0.offset|)) (not (bvsle (_ bv0 32) (select (select .cse2 |c_~#global~0.base|) |c_~#global~0.offset|)))))))))) is different from false [2024-09-24 09:02:35,330 WARN L854 $PredicateComparison]: unable to prove that (forall ((t_funThread3of4ForFork0_~p~0.base (_ BitVec 32)) (v_ArrVal_1032 (Array (_ BitVec 32) (_ BitVec 32))) (t_funThread3of4ForFork0_~p~0.offset (_ BitVec 32))) (let ((.cse2 (store |c_#memory_int| c_t_funThread2of4ForFork0_~p~0.base (let ((.cse5 (select |c_#memory_int| c_t_funThread2of4ForFork0_~p~0.base))) (store .cse5 c_t_funThread2of4ForFork0_~p~0.offset (bvadd (select .cse5 c_t_funThread2of4ForFork0_~p~0.offset) (_ bv4294967295 32))))))) (let ((.cse3 (select .cse2 t_funThread3of4ForFork0_~p~0.base))) (let ((.cse4 (select .cse3 t_funThread3of4ForFork0_~p~0.offset))) (let ((.cse0 (store (store .cse2 t_funThread3of4ForFork0_~p~0.base (store .cse3 t_funThread3of4ForFork0_~p~0.offset .cse4)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1032))) (or (bvsle (_ bv1 32) (select (select (store .cse0 c_t_funThread4of4ForFork0_~p~0.base (let ((.cse1 (select .cse0 c_t_funThread4of4ForFork0_~p~0.base))) (store .cse1 c_t_funThread4of4ForFork0_~p~0.offset (bvadd (_ bv1 32) (select .cse1 c_t_funThread4of4ForFork0_~p~0.offset))))) |c_~#global~0.base|) |c_~#global~0.offset|)) (not (bvsle (_ bv1 32) (select (select (store .cse2 t_funThread3of4ForFork0_~p~0.base (store .cse3 t_funThread3of4ForFork0_~p~0.offset (bvadd (_ bv1 32) .cse4))) |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv0 32) (select (select .cse0 |c_~#global~0.base|) |c_~#global~0.offset|))))))))) is different from false [2024-09-24 09:02:38,605 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1026 (_ BitVec 32)) (t_funThread3of4ForFork0_~p~0.base (_ BitVec 32)) (t_funThread2of4ForFork0_~p~0.base (_ BitVec 32)) (v_ArrVal_1032 (Array (_ BitVec 32) (_ BitVec 32))) (t_funThread3of4ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread2of4ForFork0_~p~0.offset (_ BitVec 32))) (let ((.cse5 (select |c_#memory_int| t_funThread2of4ForFork0_~p~0.base))) (let ((.cse2 (store |c_#memory_int| t_funThread2of4ForFork0_~p~0.base (store .cse5 t_funThread2of4ForFork0_~p~0.offset (bvadd v_ArrVal_1026 (_ bv4294967295 32)))))) (let ((.cse3 (select .cse2 t_funThread3of4ForFork0_~p~0.base))) (let ((.cse4 (select .cse3 t_funThread3of4ForFork0_~p~0.offset))) (let ((.cse0 (store (store .cse2 t_funThread3of4ForFork0_~p~0.base (store .cse3 t_funThread3of4ForFork0_~p~0.offset .cse4)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1032))) (or (bvsle (_ bv1 32) (select (select (store .cse0 c_t_funThread4of4ForFork0_~p~0.base (let ((.cse1 (select .cse0 c_t_funThread4of4ForFork0_~p~0.base))) (store .cse1 c_t_funThread4of4ForFork0_~p~0.offset (bvadd (_ bv1 32) (select .cse1 c_t_funThread4of4ForFork0_~p~0.offset))))) |c_~#global~0.base|) |c_~#global~0.offset|)) (not (bvsle (_ bv0 32) (select (select .cse0 |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv1 32) (select (select (store .cse2 t_funThread3of4ForFork0_~p~0.base (store .cse3 t_funThread3of4ForFork0_~p~0.offset (bvadd (_ bv1 32) .cse4))) |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv1 32) (select (select (store |c_#memory_int| t_funThread2of4ForFork0_~p~0.base (store .cse5 t_funThread2of4ForFork0_~p~0.offset v_ArrVal_1026)) |c_~#global~0.base|) |c_~#global~0.offset|)))))))))) is different from false [2024-09-24 09:03:04,808 INFO L349 Elim1Store]: treesize reduction 17, result has 70.2 percent of original size [2024-09-24 09:03:04,809 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 543 treesize of output 284 [2024-09-24 09:03:05,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 09:03:05,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 8379 treesize of output 7895 [2024-09-24 09:03:05,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 09:03:05,560 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 4814 treesize of output 4552 [2024-09-24 09:03:05,724 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 1598 treesize of output 1582 [2024-09-24 09:03:11,567 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 339 treesize of output 311 [2024-09-24 09:03:12,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 09:03:12,177 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 361 treesize of output 339 [2024-09-24 09:03:13,059 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 339 treesize of output 311 [2024-09-24 09:03:28,998 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 58 treesize of output 50 [2024-09-24 09:03:29,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 09:03:29,566 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 88 treesize of output 102 [2024-09-24 09:03:30,775 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-24 09:03:30,785 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-09-24 09:03:30,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 09:03:30,950 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 32 treesize of output 36 [2024-09-24 09:03:33,193 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 12 refuted. 1 times theorem prover too weak. 5 trivial. 4 not checked. [2024-09-24 09:03:33,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:03:33,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063171236] [2024-09-24 09:03:33,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1063171236] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 09:03:33,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 09:03:33,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 27 [2024-09-24 09:03:33,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220760091] [2024-09-24 09:03:33,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 09:03:33,194 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-24 09:03:33,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:03:33,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-24 09:03:33,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=424, Unknown=39, NotChecked=240, Total=812 [2024-09-24 09:03:33,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:03:33,195 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:03:33,195 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 6.357142857142857) internal successors, (178), 28 states have internal predecessors, (178), 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-09-24 09:03:33,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:03:33,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:03:33,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:03:33,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:03:33,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-24 09:03:33,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-24 09:03:33,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:03:33,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-09-24 09:03:33,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:03:37,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 09:04:28,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-24 09:04:33,096 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 (not (bvsle (_ bv0 32) (select (select |c_#memory_int| |c_~#global~0.base|) |c_~#global~0.offset|))))) (and (forall ((v_ArrVal_1026 (_ BitVec 32)) (t_funThread3of4ForFork0_~p~0.base (_ BitVec 32)) (t_funThread2of4ForFork0_~p~0.base (_ BitVec 32)) (v_ArrVal_1032 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1025 (Array (_ BitVec 32) (_ BitVec 32))) (t_funThread3of4ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread2of4ForFork0_~p~0.offset (_ BitVec 32))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1025))) (let ((.cse1 (select .cse0 t_funThread2of4ForFork0_~p~0.base))) (let ((.cse6 (store .cse1 t_funThread2of4ForFork0_~p~0.offset (bvadd v_ArrVal_1026 (_ bv4294967295 32))))) (let ((.cse3 (store .cse0 t_funThread2of4ForFork0_~p~0.base .cse6))) (let ((.cse4 (select .cse3 t_funThread3of4ForFork0_~p~0.base))) (let ((.cse5 (select .cse4 t_funThread3of4ForFork0_~p~0.offset))) (let ((.cse2 (select (select (store (store (store |c_#memory_int| t_funThread2of4ForFork0_~p~0.base .cse6) t_funThread3of4ForFork0_~p~0.base (store .cse4 t_funThread3of4ForFork0_~p~0.offset .cse5)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1032) |c_~#global~0.base|) |c_~#global~0.offset|))) (or (not (bvsle (_ bv1 32) (select (select (store .cse0 t_funThread2of4ForFork0_~p~0.base (store .cse1 t_funThread2of4ForFork0_~p~0.offset v_ArrVal_1026)) |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv0 32) .cse2)) (not (bvsle (_ bv1 32) (select (select (store .cse3 t_funThread3of4ForFork0_~p~0.base (store .cse4 t_funThread3of4ForFork0_~p~0.offset (bvadd .cse5 (_ bv1 32)))) |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv0 32) (select (select .cse0 |c_~#global~0.base|) |c_~#global~0.offset|))) (bvsle (_ bv1 32) (bvadd (_ bv1 32) .cse2))))))))))) (or .cse7 (bvsle (_ bv1 32) (select (select (store |c_#memory_int| c_t_funThread4of4ForFork0_~p~0.base (let ((.cse8 (select |c_#memory_int| c_t_funThread4of4ForFork0_~p~0.base))) (store .cse8 c_t_funThread4of4ForFork0_~p~0.offset (bvadd (select .cse8 c_t_funThread4of4ForFork0_~p~0.offset) (_ bv1 32))))) |c_~#global~0.base|) |c_~#global~0.offset|))) (or .cse7 (forall ((v_ArrVal_1026 (_ BitVec 32)) (t_funThread3of4ForFork0_~p~0.base (_ BitVec 32)) (t_funThread2of4ForFork0_~p~0.base (_ BitVec 32)) (v_ArrVal_1032 (Array (_ BitVec 32) (_ BitVec 32))) (t_funThread3of4ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread2of4ForFork0_~p~0.offset (_ BitVec 32))) (let ((.cse14 (select |c_#memory_int| t_funThread2of4ForFork0_~p~0.base))) (let ((.cse11 (store |c_#memory_int| t_funThread2of4ForFork0_~p~0.base (store .cse14 t_funThread2of4ForFork0_~p~0.offset (bvadd v_ArrVal_1026 (_ bv4294967295 32)))))) (let ((.cse12 (select .cse11 t_funThread3of4ForFork0_~p~0.base))) (let ((.cse13 (select .cse12 t_funThread3of4ForFork0_~p~0.offset))) (let ((.cse9 (store (store .cse11 t_funThread3of4ForFork0_~p~0.base (store .cse12 t_funThread3of4ForFork0_~p~0.offset .cse13)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1032))) (or (bvsle (_ bv1 32) (select (select (store .cse9 c_t_funThread4of4ForFork0_~p~0.base (let ((.cse10 (select .cse9 c_t_funThread4of4ForFork0_~p~0.base))) (store .cse10 c_t_funThread4of4ForFork0_~p~0.offset (bvadd (_ bv1 32) (select .cse10 c_t_funThread4of4ForFork0_~p~0.offset))))) |c_~#global~0.base|) |c_~#global~0.offset|)) (not (bvsle (_ bv0 32) (select (select .cse9 |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv1 32) (select (select (store .cse11 t_funThread3of4ForFork0_~p~0.base (store .cse12 t_funThread3of4ForFork0_~p~0.offset (bvadd (_ bv1 32) .cse13))) |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv1 32) (select (select (store |c_#memory_int| t_funThread2of4ForFork0_~p~0.base (store .cse14 t_funThread2of4ForFork0_~p~0.offset v_ArrVal_1026)) |c_~#global~0.base|) |c_~#global~0.offset|))))))))))) (or .cse7 (forall ((v_ArrVal_1026 (_ BitVec 32)) (t_funThread3of4ForFork0_~p~0.base (_ BitVec 32)) (t_funThread2of4ForFork0_~p~0.base (_ BitVec 32)) (v_ArrVal_1032 (Array (_ BitVec 32) (_ BitVec 32))) (t_funThread3of4ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread2of4ForFork0_~p~0.offset (_ BitVec 32))) (let ((.cse19 (select |c_#memory_int| t_funThread2of4ForFork0_~p~0.base))) (let ((.cse16 (store |c_#memory_int| t_funThread2of4ForFork0_~p~0.base (store .cse19 t_funThread2of4ForFork0_~p~0.offset (bvadd v_ArrVal_1026 (_ bv4294967295 32)))))) (let ((.cse17 (select .cse16 t_funThread3of4ForFork0_~p~0.base))) (let ((.cse18 (select .cse17 t_funThread3of4ForFork0_~p~0.offset))) (let ((.cse15 (select (select (store (store .cse16 t_funThread3of4ForFork0_~p~0.base (store .cse17 t_funThread3of4ForFork0_~p~0.offset .cse18)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1032) |c_~#global~0.base|) |c_~#global~0.offset|))) (or (bvsle (_ bv1 32) (bvadd (_ bv1 32) .cse15)) (not (bvsle (_ bv0 32) .cse15)) (not (bvsle (_ bv1 32) (select (select (store .cse16 t_funThread3of4ForFork0_~p~0.base (store .cse17 t_funThread3of4ForFork0_~p~0.offset (bvadd (_ bv1 32) .cse18))) |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv1 32) (select (select (store |c_#memory_int| t_funThread2of4ForFork0_~p~0.base (store .cse19 t_funThread2of4ForFork0_~p~0.offset v_ArrVal_1026)) |c_~#global~0.base|) |c_~#global~0.offset|))))))))))) (= (_ bv0 32) |c_~#global~0.offset|) (forall ((v_ArrVal_1026 (_ BitVec 32)) (t_funThread3of4ForFork0_~p~0.base (_ BitVec 32)) (t_funThread2of4ForFork0_~p~0.base (_ BitVec 32)) (v_ArrVal_1032 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1025 (Array (_ BitVec 32) (_ BitVec 32))) (t_funThread3of4ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread2of4ForFork0_~p~0.offset (_ BitVec 32))) (let ((.cse26 (store |c_#memory_int| c_t_funThread1of4ForFork0_~p~0.base (let ((.cse28 (select |c_#memory_int| c_t_funThread1of4ForFork0_~p~0.base))) (store .cse28 c_t_funThread1of4ForFork0_~p~0.offset (bvadd (select .cse28 c_t_funThread1of4ForFork0_~p~0.offset) (_ bv4294967295 32))))))) (let ((.cse20 (store .cse26 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1025))) (let ((.cse25 (select .cse20 t_funThread2of4ForFork0_~p~0.base))) (let ((.cse27 (store .cse25 t_funThread2of4ForFork0_~p~0.offset (bvadd v_ArrVal_1026 (_ bv4294967295 32))))) (let ((.cse22 (store .cse20 t_funThread2of4ForFork0_~p~0.base .cse27))) (let ((.cse23 (select .cse22 t_funThread3of4ForFork0_~p~0.base))) (let ((.cse24 (select .cse23 t_funThread3of4ForFork0_~p~0.offset))) (let ((.cse21 (select (select (store (store (store .cse26 t_funThread2of4ForFork0_~p~0.base .cse27) t_funThread3of4ForFork0_~p~0.base (store .cse23 t_funThread3of4ForFork0_~p~0.offset .cse24)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1032) |c_~#global~0.base|) |c_~#global~0.offset|))) (or (not (bvsle (_ bv0 32) (select (select .cse20 |c_~#global~0.base|) |c_~#global~0.offset|))) (bvsle (_ bv1 32) (bvadd (_ bv1 32) .cse21)) (not (bvsle (_ bv0 32) .cse21)) (not (bvsle (_ bv1 32) (select (select (store .cse22 t_funThread3of4ForFork0_~p~0.base (store .cse23 t_funThread3of4ForFork0_~p~0.offset (bvadd (_ bv1 32) .cse24))) |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv1 32) (select (select (store .cse20 t_funThread2of4ForFork0_~p~0.base (store .cse25 t_funThread2of4ForFork0_~p~0.offset v_ArrVal_1026)) |c_~#global~0.base|) |c_~#global~0.offset|))))))))))))) (= (_ bv4 32) |c_~#global~0.base|) (= (_ bv4 32) c_t_funThread1of4ForFork0_~p~0.base) (= (_ bv0 32) c_t_funThread1of4ForFork0_~p~0.offset) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| (_ bv4 32))))) is different from true [2024-09-24 09:04:35,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 09:04:40,202 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_int| |c_~#global~0.base|) |c_~#global~0.offset|))) (let ((.cse7 (not (bvsle (_ bv1 32) .cse14)))) (and (forall ((v_ArrVal_1026 (_ BitVec 32)) (t_funThread3of4ForFork0_~p~0.base (_ BitVec 32)) (t_funThread2of4ForFork0_~p~0.base (_ BitVec 32)) (v_ArrVal_1032 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1025 (Array (_ BitVec 32) (_ BitVec 32))) (t_funThread3of4ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread2of4ForFork0_~p~0.offset (_ BitVec 32))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1025))) (let ((.cse1 (select .cse0 t_funThread2of4ForFork0_~p~0.base))) (let ((.cse6 (store .cse1 t_funThread2of4ForFork0_~p~0.offset (bvadd v_ArrVal_1026 (_ bv4294967295 32))))) (let ((.cse3 (store .cse0 t_funThread2of4ForFork0_~p~0.base .cse6))) (let ((.cse4 (select .cse3 t_funThread3of4ForFork0_~p~0.base))) (let ((.cse5 (select .cse4 t_funThread3of4ForFork0_~p~0.offset))) (let ((.cse2 (select (select (store (store (store |c_#memory_int| t_funThread2of4ForFork0_~p~0.base .cse6) t_funThread3of4ForFork0_~p~0.base (store .cse4 t_funThread3of4ForFork0_~p~0.offset .cse5)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1032) |c_~#global~0.base|) |c_~#global~0.offset|))) (or (not (bvsle (_ bv1 32) (select (select (store .cse0 t_funThread2of4ForFork0_~p~0.base (store .cse1 t_funThread2of4ForFork0_~p~0.offset v_ArrVal_1026)) |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv0 32) .cse2)) (not (bvsle (_ bv1 32) (select (select (store .cse3 t_funThread3of4ForFork0_~p~0.base (store .cse4 t_funThread3of4ForFork0_~p~0.offset (bvadd .cse5 (_ bv1 32)))) |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv0 32) (select (select .cse0 |c_~#global~0.base|) |c_~#global~0.offset|))) (bvsle (_ bv1 32) (bvadd (_ bv1 32) .cse2))))))))))) (or .cse7 (forall ((t_funThread3of4ForFork0_~p~0.base (_ BitVec 32)) (v_ArrVal_1032 (Array (_ BitVec 32) (_ BitVec 32))) (t_funThread3of4ForFork0_~p~0.offset (_ BitVec 32))) (let ((.cse10 (store |c_#memory_int| c_t_funThread2of4ForFork0_~p~0.base (let ((.cse13 (select |c_#memory_int| c_t_funThread2of4ForFork0_~p~0.base))) (store .cse13 c_t_funThread2of4ForFork0_~p~0.offset (bvadd (select .cse13 c_t_funThread2of4ForFork0_~p~0.offset) (_ bv4294967295 32))))))) (let ((.cse11 (select .cse10 t_funThread3of4ForFork0_~p~0.base))) (let ((.cse12 (select .cse11 t_funThread3of4ForFork0_~p~0.offset))) (let ((.cse8 (store (store .cse10 t_funThread3of4ForFork0_~p~0.base (store .cse11 t_funThread3of4ForFork0_~p~0.offset .cse12)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1032))) (or (bvsle (_ bv1 32) (select (select (store .cse8 c_t_funThread4of4ForFork0_~p~0.base (let ((.cse9 (select .cse8 c_t_funThread4of4ForFork0_~p~0.base))) (store .cse9 c_t_funThread4of4ForFork0_~p~0.offset (bvadd (_ bv1 32) (select .cse9 c_t_funThread4of4ForFork0_~p~0.offset))))) |c_~#global~0.base|) |c_~#global~0.offset|)) (not (bvsle (_ bv1 32) (select (select (store .cse10 t_funThread3of4ForFork0_~p~0.base (store .cse11 t_funThread3of4ForFork0_~p~0.offset (bvadd (_ bv1 32) .cse12))) |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv0 32) (select (select .cse8 |c_~#global~0.base|) |c_~#global~0.offset|)))))))))) (or (not (bvsle (_ bv0 32) .cse14)) (forall ((v_ArrVal_1026 (_ BitVec 32)) (t_funThread3of4ForFork0_~p~0.base (_ BitVec 32)) (t_funThread2of4ForFork0_~p~0.base (_ BitVec 32)) (v_ArrVal_1032 (Array (_ BitVec 32) (_ BitVec 32))) (t_funThread3of4ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread2of4ForFork0_~p~0.offset (_ BitVec 32))) (let ((.cse19 (select |c_#memory_int| t_funThread2of4ForFork0_~p~0.base))) (let ((.cse16 (store |c_#memory_int| t_funThread2of4ForFork0_~p~0.base (store .cse19 t_funThread2of4ForFork0_~p~0.offset (bvadd v_ArrVal_1026 (_ bv4294967295 32)))))) (let ((.cse17 (select .cse16 t_funThread3of4ForFork0_~p~0.base))) (let ((.cse18 (select .cse17 t_funThread3of4ForFork0_~p~0.offset))) (let ((.cse15 (select (select (store (store .cse16 t_funThread3of4ForFork0_~p~0.base (store .cse17 t_funThread3of4ForFork0_~p~0.offset .cse18)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1032) |c_~#global~0.base|) |c_~#global~0.offset|))) (or (bvsle (_ bv1 32) (bvadd (_ bv1 32) .cse15)) (not (bvsle (_ bv0 32) .cse15)) (not (bvsle (_ bv1 32) (select (select (store .cse16 t_funThread3of4ForFork0_~p~0.base (store .cse17 t_funThread3of4ForFork0_~p~0.offset (bvadd (_ bv1 32) .cse18))) |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv1 32) (select (select (store |c_#memory_int| t_funThread2of4ForFork0_~p~0.base (store .cse19 t_funThread2of4ForFork0_~p~0.offset v_ArrVal_1026)) |c_~#global~0.base|) |c_~#global~0.offset|))))))))))) (= (_ bv0 32) |c_~#global~0.offset|) (or .cse7 (forall ((v_ArrVal_1032 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store (store |c_#memory_int| c_t_funThread3of4ForFork0_~p~0.base (let ((.cse22 (select |c_#memory_int| c_t_funThread3of4ForFork0_~p~0.base))) (store .cse22 c_t_funThread3of4ForFork0_~p~0.offset (bvadd (select .cse22 c_t_funThread3of4ForFork0_~p~0.offset) (_ bv4294967295 32))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1032))) (or (not (bvsle (_ bv0 32) (select (select .cse20 |c_~#global~0.base|) |c_~#global~0.offset|))) (bvsle (_ bv1 32) (select (select (store .cse20 c_t_funThread4of4ForFork0_~p~0.base (let ((.cse21 (select .cse20 c_t_funThread4of4ForFork0_~p~0.base))) (store .cse21 c_t_funThread4of4ForFork0_~p~0.offset (bvadd (_ bv1 32) (select .cse21 c_t_funThread4of4ForFork0_~p~0.offset))))) |c_~#global~0.base|) |c_~#global~0.offset|)))))) (forall ((v_ArrVal_1026 (_ BitVec 32)) (t_funThread3of4ForFork0_~p~0.base (_ BitVec 32)) (t_funThread2of4ForFork0_~p~0.base (_ BitVec 32)) (v_ArrVal_1032 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1025 (Array (_ BitVec 32) (_ BitVec 32))) (t_funThread3of4ForFork0_~p~0.offset (_ BitVec 32)) (t_funThread2of4ForFork0_~p~0.offset (_ BitVec 32))) (let ((.cse29 (store |c_#memory_int| c_t_funThread1of4ForFork0_~p~0.base (let ((.cse31 (select |c_#memory_int| c_t_funThread1of4ForFork0_~p~0.base))) (store .cse31 c_t_funThread1of4ForFork0_~p~0.offset (bvadd (select .cse31 c_t_funThread1of4ForFork0_~p~0.offset) (_ bv4294967295 32))))))) (let ((.cse23 (store .cse29 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1025))) (let ((.cse28 (select .cse23 t_funThread2of4ForFork0_~p~0.base))) (let ((.cse30 (store .cse28 t_funThread2of4ForFork0_~p~0.offset (bvadd v_ArrVal_1026 (_ bv4294967295 32))))) (let ((.cse25 (store .cse23 t_funThread2of4ForFork0_~p~0.base .cse30))) (let ((.cse26 (select .cse25 t_funThread3of4ForFork0_~p~0.base))) (let ((.cse27 (select .cse26 t_funThread3of4ForFork0_~p~0.offset))) (let ((.cse24 (select (select (store (store (store .cse29 t_funThread2of4ForFork0_~p~0.base .cse30) t_funThread3of4ForFork0_~p~0.base (store .cse26 t_funThread3of4ForFork0_~p~0.offset .cse27)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1032) |c_~#global~0.base|) |c_~#global~0.offset|))) (or (not (bvsle (_ bv0 32) (select (select .cse23 |c_~#global~0.base|) |c_~#global~0.offset|))) (bvsle (_ bv1 32) (bvadd (_ bv1 32) .cse24)) (not (bvsle (_ bv0 32) .cse24)) (not (bvsle (_ bv1 32) (select (select (store .cse25 t_funThread3of4ForFork0_~p~0.base (store .cse26 t_funThread3of4ForFork0_~p~0.offset (bvadd (_ bv1 32) .cse27))) |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv1 32) (select (select (store .cse23 t_funThread2of4ForFork0_~p~0.base (store .cse28 t_funThread2of4ForFork0_~p~0.offset v_ArrVal_1026)) |c_~#global~0.base|) |c_~#global~0.offset|))))))))))))) (= (_ bv4 32) |c_~#global~0.base|) (= (_ bv4 32) c_t_funThread1of4ForFork0_~p~0.base) (= (_ bv0 32) c_t_funThread1of4ForFork0_~p~0.offset) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| (_ bv4 32)))))) is different from true [2024-09-24 09:04:47,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 09:04:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:04:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:04:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:04:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:04:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 09:04:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-24 09:04:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:04:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-24 09:04:48,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-24 09:04:48,543 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 (41)] Forceful destruction successful, exit code 0 [2024-09-24 09:04:48,738 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /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-09-24 09:04:48,739 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:04:48,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:04:48,739 INFO L85 PathProgramCache]: Analyzing trace with hash -637170614, now seen corresponding path program 4 times [2024-09-24 09:04:48,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:04:48,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566966165] [2024-09-24 09:04:48,739 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-24 09:04:48,739 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-09-24 09:04:48,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:04:48,741 INFO L229 MonitoredProcess]: Starting monitored process 42 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-09-24 09:04:48,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 (42)] Waiting until timeout for monitored process [2024-09-24 09:04:48,897 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-24 09:04:48,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 09:04:48,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-09-24 09:04:48,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:04:49,047 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-24 09:04:49,047 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-09-24 09:04:49,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:04:50,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:04:51,693 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-09-24 09:04:52,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:04:54,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-09-24 09:04:57,183 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-09-24 09:04:58,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-09-24 09:05:00,677 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-09-24 09:05:01,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:05:03,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-09-24 09:05:03,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 09:05:05,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-09-24 09:05:05,809 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 09:05:05,810 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 09:05:08,040 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1118))) (or (not (bvsle (_ bv0 32) (select (select .cse0 |c_~#global~0.base|) |c_~#global~0.offset|))) (bvsle (_ bv1 32) (select (select (store .cse0 c_t_funThread4of4ForFork0_~p~0.base (let ((.cse1 (select .cse0 c_t_funThread4of4ForFork0_~p~0.base))) (store .cse1 c_t_funThread4of4ForFork0_~p~0.offset (bvadd (_ bv1 32) (select .cse1 c_t_funThread4of4ForFork0_~p~0.offset))))) |c_~#global~0.base|) |c_~#global~0.offset|))))) is different from false [2024-09-24 09:05:10,780 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1116))) (let ((.cse0 (select (select (store (store |c_#memory_int| c_t_funThread3of4ForFork0_~p~0.base (let ((.cse2 (select .cse1 c_t_funThread3of4ForFork0_~p~0.base))) (store .cse2 c_t_funThread3of4ForFork0_~p~0.offset (bvadd (select .cse2 c_t_funThread3of4ForFork0_~p~0.offset) (_ bv4294967295 32))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1118) |c_~#global~0.base|) |c_~#global~0.offset|))) (or (bvsle (_ bv1 32) (bvadd .cse0 (_ bv1 32))) (not (bvsle (_ bv1 32) (select (select .cse1 |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv0 32) .cse0)))))) is different from false [2024-09-24 09:05:13,529 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| c_t_funThread3of4ForFork0_~p~0.base (let ((.cse3 (select |c_#memory_int| c_t_funThread3of4ForFork0_~p~0.base))) (store .cse3 c_t_funThread3of4ForFork0_~p~0.offset (bvadd (_ bv1 32) (select .cse3 c_t_funThread3of4ForFork0_~p~0.offset))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1116))) (let ((.cse0 (select (select (store (store |c_#memory_int| c_t_funThread3of4ForFork0_~p~0.base (let ((.cse2 (select .cse1 c_t_funThread3of4ForFork0_~p~0.base))) (store .cse2 c_t_funThread3of4ForFork0_~p~0.offset (bvadd (select .cse2 c_t_funThread3of4ForFork0_~p~0.offset) (_ bv4294967295 32))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1118) |c_~#global~0.base|) |c_~#global~0.offset|))) (or (not (bvsle (_ bv0 32) .cse0)) (bvsle (_ bv1 32) (bvadd (_ bv1 32) .cse0)) (not (bvsle (_ bv1 32) (select (select .cse1 |c_~#global~0.base|) |c_~#global~0.offset|))))))) is different from false [2024-09-24 09:05:19,783 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_t_funThread2of4ForFork0_~p~0.base (let ((.cse5 (select |c_#memory_int| c_t_funThread2of4ForFork0_~p~0.base))) (store .cse5 c_t_funThread2of4ForFork0_~p~0.offset (bvadd (select .cse5 c_t_funThread2of4ForFork0_~p~0.offset) (_ bv4294967295 32))))))) (let ((.cse1 (store (store .cse2 c_t_funThread3of4ForFork0_~p~0.base (let ((.cse4 (select .cse2 c_t_funThread3of4ForFork0_~p~0.base))) (store .cse4 c_t_funThread3of4ForFork0_~p~0.offset (bvadd (_ bv1 32) (select .cse4 c_t_funThread3of4ForFork0_~p~0.offset))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1116))) (let ((.cse0 (select (select (store (store .cse2 c_t_funThread3of4ForFork0_~p~0.base (let ((.cse3 (select .cse1 c_t_funThread3of4ForFork0_~p~0.base))) (store .cse3 c_t_funThread3of4ForFork0_~p~0.offset (bvadd (select .cse3 c_t_funThread3of4ForFork0_~p~0.offset) (_ bv4294967295 32))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1118) |c_~#global~0.base|) |c_~#global~0.offset|))) (or (bvsle (_ bv1 32) (bvadd .cse0 (_ bv1 32))) (not (bvsle (_ bv0 32) .cse0)) (not (bvsle (_ bv1 32) (select (select .cse1 |c_~#global~0.base|) |c_~#global~0.offset|)))))))) is different from false [2024-09-24 09:05:25,164 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_int| c_t_funThread2of4ForFork0_~p~0.base (let ((.cse5 (select |c_#memory_int| c_t_funThread2of4ForFork0_~p~0.base))) (store .cse5 c_t_funThread2of4ForFork0_~p~0.offset (select .cse5 c_t_funThread2of4ForFork0_~p~0.offset)))))) (let ((.cse1 (store (store .cse2 c_t_funThread3of4ForFork0_~p~0.base (let ((.cse4 (select .cse2 c_t_funThread3of4ForFork0_~p~0.base))) (store .cse4 c_t_funThread3of4ForFork0_~p~0.offset (bvadd (select .cse4 c_t_funThread3of4ForFork0_~p~0.offset) (_ bv1 32))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1116))) (let ((.cse0 (select (select (store (store .cse2 c_t_funThread3of4ForFork0_~p~0.base (let ((.cse3 (select .cse1 c_t_funThread3of4ForFork0_~p~0.base))) (store .cse3 c_t_funThread3of4ForFork0_~p~0.offset (bvadd (select .cse3 c_t_funThread3of4ForFork0_~p~0.offset) (_ bv4294967295 32))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1118) |c_~#global~0.base|) |c_~#global~0.offset|))) (or (bvsle (_ bv1 32) (bvadd (_ bv1 32) .cse0)) (not (bvsle (_ bv0 32) .cse0)) (not (bvsle (_ bv1 32) (select (select .cse1 |c_~#global~0.base|) |c_~#global~0.offset|)))))))) is different from false [2024-09-24 09:05:36,819 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse5 (store |c_#memory_int| c_t_funThread1of4ForFork0_~p~0.base (let ((.cse7 (select |c_#memory_int| c_t_funThread1of4ForFork0_~p~0.base))) (store .cse7 c_t_funThread1of4ForFork0_~p~0.offset (bvadd (select .cse7 c_t_funThread1of4ForFork0_~p~0.offset) (_ bv4294967295 32))))))) (store .cse5 c_t_funThread2of4ForFork0_~p~0.base (let ((.cse6 (select .cse5 c_t_funThread2of4ForFork0_~p~0.base))) (store .cse6 c_t_funThread2of4ForFork0_~p~0.offset (select .cse6 c_t_funThread2of4ForFork0_~p~0.offset))))))) (let ((.cse1 (store (store .cse2 c_t_funThread3of4ForFork0_~p~0.base (let ((.cse4 (select .cse2 c_t_funThread3of4ForFork0_~p~0.base))) (store .cse4 c_t_funThread3of4ForFork0_~p~0.offset (bvadd (select .cse4 c_t_funThread3of4ForFork0_~p~0.offset) (_ bv1 32))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1116))) (let ((.cse0 (select (select (store (store .cse2 c_t_funThread3of4ForFork0_~p~0.base (let ((.cse3 (select .cse1 c_t_funThread3of4ForFork0_~p~0.base))) (store .cse3 c_t_funThread3of4ForFork0_~p~0.offset (bvadd (_ bv4294967295 32) (select .cse3 c_t_funThread3of4ForFork0_~p~0.offset))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1118) |c_~#global~0.base|) |c_~#global~0.offset|))) (or (bvsle (_ bv1 32) (bvadd (_ bv1 32) .cse0)) (not (bvsle (_ bv1 32) (select (select .cse1 |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv0 32) .cse0))))))) is different from false [2024-09-24 09:06:26,638 WARN L854 $PredicateComparison]: unable to prove that (forall ((t_funThread2of4ForFork0_~p~0.base (_ BitVec 32)) (v_ArrVal_1116 (Array (_ BitVec 32) (_ BitVec 32))) (t_funThread2of4ForFork0_~p~0.offset (_ BitVec 32)) (v_ArrVal_1118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| |c_~#global~0.base| (let ((.cse7 (select |c_#memory_int| |c_~#global~0.base|))) (store .cse7 |c_~#global~0.offset| (bvadd (select .cse7 |c_~#global~0.offset|) (_ bv4294967295 32))))))) (let ((.cse5 (let ((.cse6 (select .cse4 t_funThread2of4ForFork0_~p~0.base))) (store .cse6 t_funThread2of4ForFork0_~p~0.offset (select .cse6 t_funThread2of4ForFork0_~p~0.offset))))) (let ((.cse0 (store |c_#memory_int| t_funThread2of4ForFork0_~p~0.base .cse5))) (let ((.cse1 (select (store (store .cse0 |c_~#global~0.base| (let ((.cse3 (select (store .cse4 t_funThread2of4ForFork0_~p~0.base .cse5) |c_~#global~0.base|))) (store .cse3 |c_~#global~0.offset| (bvadd (_ bv1 32) (select .cse3 |c_~#global~0.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1116) |c_~#global~0.base|))) (let ((.cse2 (select .cse1 |c_~#global~0.offset|))) (or (not (bvsle (_ bv0 32) (select (select (store (store .cse0 |c_~#global~0.base| (store v_ArrVal_1116 |c_~#global~0.offset| (bvadd (select v_ArrVal_1116 |c_~#global~0.offset|) (_ bv4294967295 32)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1118) |c_~#global~0.base|) |c_~#global~0.offset|))) (bvsle (_ bv1 32) (bvadd (select (select (store (store .cse0 |c_~#global~0.base| (store .cse1 |c_~#global~0.offset| (bvadd .cse2 (_ bv4294967295 32)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1118) |c_~#global~0.base|) |c_~#global~0.offset|) (_ bv1 32))) (not (bvsle (_ bv1 32) .cse2))))))))) is different from false [2024-09-24 09:06:30,421 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 14 not checked. [2024-09-24 09:06:30,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:06:30,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566966165] [2024-09-24 09:06:30,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1566966165] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 09:06:30,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 09:06:30,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 27 [2024-09-24 09:06:30,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42159290] [2024-09-24 09:06:30,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 09:06:30,422 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-24 09:06:30,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:06:30,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-24 09:06:30,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=331, Unknown=27, NotChecked=322, Total=812 [2024-09-24 09:06:30,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:06:30,423 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:06:30,423 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 6.5) internal successors, (182), 28 states have internal predecessors, (182), 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-09-24 09:06:30,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:06:30,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:06:30,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:06:30,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:06:30,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-24 09:06:30,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-24 09:06:30,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:06:30,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-09-24 09:06:30,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-09-24 09:06:30,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:07:06,559 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (bvsle (_ bv1 32) (select (select |c_#memory_int| |c_~#global~0.base|) |c_~#global~0.offset|)))) (.cse3 (store |c_#memory_int| c_t_funThread3of4ForFork0_~p~0.base (let ((.cse6 (select |c_#memory_int| c_t_funThread3of4ForFork0_~p~0.base))) (store .cse6 c_t_funThread3of4ForFork0_~p~0.offset (bvadd (select .cse6 c_t_funThread3of4ForFork0_~p~0.offset) (_ bv4294967295 32))))))) (and (or .cse0 (forall ((v_ArrVal_1118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1118))) (or (not (bvsle (_ bv0 32) (select (select .cse1 |c_~#global~0.base|) |c_~#global~0.offset|))) (bvsle (_ bv1 32) (select (select (store .cse1 c_t_funThread4of4ForFork0_~p~0.base (let ((.cse2 (select .cse1 c_t_funThread4of4ForFork0_~p~0.base))) (store .cse2 c_t_funThread4of4ForFork0_~p~0.offset (bvadd (_ bv1 32) (select .cse2 c_t_funThread4of4ForFork0_~p~0.offset))))) |c_~#global~0.base|) |c_~#global~0.offset|)))))) (or .cse0 (forall ((v_ArrVal_1118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1118) |c_~#global~0.base|) |c_~#global~0.offset|))) (or (not (bvsle (_ bv0 32) .cse4)) (bvsle (_ bv1 32) (bvadd .cse4 (_ bv1 32))))))) (bvsle (_ bv1 32) (select (select (store |c_#memory_int| c_t_funThread4of4ForFork0_~p~0.base (let ((.cse5 (select |c_#memory_int| c_t_funThread4of4ForFork0_~p~0.base))) (store .cse5 c_t_funThread4of4ForFork0_~p~0.offset (bvadd (select .cse5 c_t_funThread4of4ForFork0_~p~0.offset) (_ bv1 32))))) |c_~#global~0.base|) |c_~#global~0.offset|)))) is different from false [2024-09-24 09:07:24,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 09:07:26,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 09:07:28,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 09:08:03,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 09:09:01,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 09:09:02,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 09:09:02,749 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((t_funThread2of4ForFork0_~p~0.base (_ BitVec 32)) (v_ArrVal_1116 (Array (_ BitVec 32) (_ BitVec 32))) (t_funThread2of4ForFork0_~p~0.offset (_ BitVec 32)) (v_ArrVal_1118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| |c_~#global~0.base| (let ((.cse7 (select |c_#memory_int| |c_~#global~0.base|))) (store .cse7 |c_~#global~0.offset| (bvadd (select .cse7 |c_~#global~0.offset|) (_ bv4294967295 32))))))) (let ((.cse5 (let ((.cse6 (select .cse4 t_funThread2of4ForFork0_~p~0.base))) (store .cse6 t_funThread2of4ForFork0_~p~0.offset (select .cse6 t_funThread2of4ForFork0_~p~0.offset))))) (let ((.cse0 (store |c_#memory_int| t_funThread2of4ForFork0_~p~0.base .cse5))) (let ((.cse1 (select (store (store .cse0 |c_~#global~0.base| (let ((.cse3 (select (store .cse4 t_funThread2of4ForFork0_~p~0.base .cse5) |c_~#global~0.base|))) (store .cse3 |c_~#global~0.offset| (bvadd (_ bv1 32) (select .cse3 |c_~#global~0.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1116) |c_~#global~0.base|))) (let ((.cse2 (select .cse1 |c_~#global~0.offset|))) (or (not (bvsle (_ bv0 32) (select (select (store (store .cse0 |c_~#global~0.base| (store v_ArrVal_1116 |c_~#global~0.offset| (bvadd (select v_ArrVal_1116 |c_~#global~0.offset|) (_ bv4294967295 32)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1118) |c_~#global~0.base|) |c_~#global~0.offset|))) (bvsle (_ bv1 32) (bvadd (select (select (store (store .cse0 |c_~#global~0.base| (store .cse1 |c_~#global~0.offset| (bvadd .cse2 (_ bv4294967295 32)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1118) |c_~#global~0.base|) |c_~#global~0.offset|) (_ bv1 32))) (not (bvsle (_ bv1 32) .cse2))))))))) (forall ((v_ArrVal_1116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (let ((.cse12 (store |c_#memory_int| c_t_funThread1of4ForFork0_~p~0.base (let ((.cse14 (select |c_#memory_int| c_t_funThread1of4ForFork0_~p~0.base))) (store .cse14 c_t_funThread1of4ForFork0_~p~0.offset (bvadd (select .cse14 c_t_funThread1of4ForFork0_~p~0.offset) (_ bv4294967295 32))))))) (store .cse12 c_t_funThread2of4ForFork0_~p~0.base (let ((.cse13 (select .cse12 c_t_funThread2of4ForFork0_~p~0.base))) (store .cse13 c_t_funThread2of4ForFork0_~p~0.offset (select .cse13 c_t_funThread2of4ForFork0_~p~0.offset))))))) (let ((.cse9 (select (store (store .cse8 |c_~#global~0.base| (let ((.cse11 (select .cse8 |c_~#global~0.base|))) (store .cse11 |c_~#global~0.offset| (bvadd (_ bv1 32) (select .cse11 |c_~#global~0.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1116) |c_~#global~0.base|))) (let ((.cse10 (select .cse9 |c_~#global~0.offset|))) (or (bvsle (_ bv1 32) (bvadd (_ bv1 32) (select (select (store (store .cse8 |c_~#global~0.base| (store .cse9 |c_~#global~0.offset| (bvadd .cse10 (_ bv4294967295 32)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1118) |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv0 32) (select (select (store (store .cse8 |c_~#global~0.base| (store v_ArrVal_1116 |c_~#global~0.offset| (bvadd (select v_ArrVal_1116 |c_~#global~0.offset|) (_ bv4294967295 32)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1118) |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv1 32) .cse10)))))))) is different from false [2024-09-24 09:09:06,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 09:09:08,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 09:09:10,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 09:09:11,727 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((t_funThread2of4ForFork0_~p~0.base (_ BitVec 32)) (v_ArrVal_1116 (Array (_ BitVec 32) (_ BitVec 32))) (t_funThread2of4ForFork0_~p~0.offset (_ BitVec 32)) (v_ArrVal_1118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_int| |c_~#global~0.base| (let ((.cse7 (select |c_#memory_int| |c_~#global~0.base|))) (store .cse7 |c_~#global~0.offset| (bvadd (select .cse7 |c_~#global~0.offset|) (_ bv4294967295 32))))))) (let ((.cse5 (let ((.cse6 (select .cse4 t_funThread2of4ForFork0_~p~0.base))) (store .cse6 t_funThread2of4ForFork0_~p~0.offset (select .cse6 t_funThread2of4ForFork0_~p~0.offset))))) (let ((.cse0 (store |c_#memory_int| t_funThread2of4ForFork0_~p~0.base .cse5))) (let ((.cse1 (select (store (store .cse0 |c_~#global~0.base| (let ((.cse3 (select (store .cse4 t_funThread2of4ForFork0_~p~0.base .cse5) |c_~#global~0.base|))) (store .cse3 |c_~#global~0.offset| (bvadd (_ bv1 32) (select .cse3 |c_~#global~0.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1116) |c_~#global~0.base|))) (let ((.cse2 (select .cse1 |c_~#global~0.offset|))) (or (not (bvsle (_ bv0 32) (select (select (store (store .cse0 |c_~#global~0.base| (store v_ArrVal_1116 |c_~#global~0.offset| (bvadd (select v_ArrVal_1116 |c_~#global~0.offset|) (_ bv4294967295 32)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1118) |c_~#global~0.base|) |c_~#global~0.offset|))) (bvsle (_ bv1 32) (bvadd (select (select (store (store .cse0 |c_~#global~0.base| (store .cse1 |c_~#global~0.offset| (bvadd .cse2 (_ bv4294967295 32)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1118) |c_~#global~0.base|) |c_~#global~0.offset|) (_ bv1 32))) (not (bvsle (_ bv1 32) .cse2))))))))) (bvsle (_ bv1 32) (select (select (store |c_#memory_int| c_t_funThread4of4ForFork0_~p~0.base (let ((.cse8 (select |c_#memory_int| c_t_funThread4of4ForFork0_~p~0.base))) (store .cse8 c_t_funThread4of4ForFork0_~p~0.offset (bvadd (select .cse8 c_t_funThread4of4ForFork0_~p~0.offset) (_ bv1 32))))) |c_~#global~0.base|) |c_~#global~0.offset|)) (forall ((v_ArrVal_1116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (let ((.cse13 (store |c_#memory_int| c_t_funThread1of4ForFork0_~p~0.base (let ((.cse15 (select |c_#memory_int| c_t_funThread1of4ForFork0_~p~0.base))) (store .cse15 c_t_funThread1of4ForFork0_~p~0.offset (bvadd (select .cse15 c_t_funThread1of4ForFork0_~p~0.offset) (_ bv4294967295 32))))))) (store .cse13 c_t_funThread2of4ForFork0_~p~0.base (let ((.cse14 (select .cse13 c_t_funThread2of4ForFork0_~p~0.base))) (store .cse14 c_t_funThread2of4ForFork0_~p~0.offset (select .cse14 c_t_funThread2of4ForFork0_~p~0.offset))))))) (let ((.cse10 (select (store (store .cse9 |c_~#global~0.base| (let ((.cse12 (select .cse9 |c_~#global~0.base|))) (store .cse12 |c_~#global~0.offset| (bvadd (_ bv1 32) (select .cse12 |c_~#global~0.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1116) |c_~#global~0.base|))) (let ((.cse11 (select .cse10 |c_~#global~0.offset|))) (or (bvsle (_ bv1 32) (bvadd (_ bv1 32) (select (select (store (store .cse9 |c_~#global~0.base| (store .cse10 |c_~#global~0.offset| (bvadd .cse11 (_ bv4294967295 32)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1118) |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv0 32) (select (select (store (store .cse9 |c_~#global~0.base| (store v_ArrVal_1116 |c_~#global~0.offset| (bvadd (select v_ArrVal_1116 |c_~#global~0.offset|) (_ bv4294967295 32)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1118) |c_~#global~0.base|) |c_~#global~0.offset|))) (not (bvsle (_ bv1 32) .cse11)))))))) is different from false [2024-09-24 09:09:15,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:09:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:09:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:09:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:09:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-24 09:09:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-24 09:09:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:09:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-24 09:09:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-24 09:09:15,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-24 09:09:15,344 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 (42)] Forceful destruction successful, exit code 0 [2024-09-24 09:09:15,539 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /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-09-24 09:09:15,540 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT, t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 09:09:15,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 09:09:15,540 INFO L85 PathProgramCache]: Analyzing trace with hash 818433465, now seen corresponding path program 1 times [2024-09-24 09:09:15,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 09:09:15,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099678794] [2024-09-24 09:09:15,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 09:09:15,541 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-09-24 09:09:15,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 09:09:15,542 INFO L229 MonitoredProcess]: Starting monitored process 43 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-09-24 09:09:15,543 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 (43)] Waiting until timeout for monitored process [2024-09-24 09:09:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 09:09:15,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-24 09:09:15,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 09:09:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 09:09:21,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 09:09:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 09:09:27,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 09:09:27,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099678794] [2024-09-24 09:09:27,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099678794] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 09:09:27,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 09:09:27,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-09-24 09:09:27,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877601363] [2024-09-24 09:09:27,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 09:09:27,018 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-24 09:09:27,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 09:09:27,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-24 09:09:27,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-09-24 09:09:27,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:09:27,018 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 09:09:27,018 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 09:09:27,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 09:09:27,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:09:27,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 09:09:27,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 09:09:27,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-24 09:09:27,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-24 09:09:27,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 09:09:27,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-24 09:09:27,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-24 09:09:27,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-09-24 09:09:27,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Killed by 15