./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_75-tricky_address2_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b03bd7cf 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/GemCutterReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_75-tricky_address2_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c0354ee6107efc04d15102ecf9eef73430e38e14b70f16419cd07cd733fd0df --- Real Ultimate output --- This is Ultimate 0.2.5-dev-b03bd7c-m [2024-10-28 18:11:04,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-28 18:11:04,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-28 18:11:04,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-28 18:11:04,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-28 18:11:04,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-28 18:11:04,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-28 18:11:04,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-28 18:11:04,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-28 18:11:04,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-28 18:11:04,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-28 18:11:04,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-28 18:11:04,714 INFO L153 SettingsManager]: * Use SBE=true [2024-10-28 18:11:04,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-28 18:11:04,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-28 18:11:04,716 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-28 18:11:04,716 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-28 18:11:04,716 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-28 18:11:04,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-28 18:11:04,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-28 18:11:04,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-28 18:11:04,718 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-28 18:11:04,718 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-28 18:11:04,718 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-28 18:11:04,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-28 18:11:04,718 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-28 18:11:04,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-28 18:11:04,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-28 18:11:04,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-28 18:11:04,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-28 18:11:04,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-28 18:11:04,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-28 18:11:04,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-28 18:11:04,720 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-28 18:11:04,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-28 18:11:04,720 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-28 18:11:04,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-28 18:11:04,721 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-28 18:11:04,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-28 18:11:04,723 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-28 18:11:04,723 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-28 18:11:04,724 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3c0354ee6107efc04d15102ecf9eef73430e38e14b70f16419cd07cd733fd0df [2024-10-28 18:11:05,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-28 18:11:05,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-28 18:11:05,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-28 18:11:05,031 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-28 18:11:05,032 INFO L274 PluginConnector]: CDTParser initialized [2024-10-28 18:11:05,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2024-10-28 18:11:06,498 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-28 18:11:06,785 INFO L384 CDTParser]: Found 1 translation units. [2024-10-28 18:11:06,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2024-10-28 18:11:06,814 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/963b08788/98578209a4c7485eae95cc5c412f61cb/FLAG4b43b691f [2024-10-28 18:11:06,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/963b08788/98578209a4c7485eae95cc5c412f61cb [2024-10-28 18:11:06,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-28 18:11:06,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-28 18:11:06,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-28 18:11:06,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-28 18:11:06,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-28 18:11:06,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 06:11:06" (1/1) ... [2024-10-28 18:11:06,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68062c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:11:06, skipping insertion in model container [2024-10-28 18:11:06,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 06:11:06" (1/1) ... [2024-10-28 18:11:06,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-28 18:11:07,379 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_75-tricky_address2_racefree.i[41323,41336] [2024-10-28 18:11:07,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-28 18:11:07,471 INFO L200 MainTranslator]: Completed pre-run [2024-10-28 18:11:07,510 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_75-tricky_address2_racefree.i[41323,41336] [2024-10-28 18:11:07,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-28 18:11:07,584 INFO L204 MainTranslator]: Completed translation [2024-10-28 18:11:07,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:11:07 WrapperNode [2024-10-28 18:11:07,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-28 18:11:07,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-28 18:11:07,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-28 18:11:07,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-28 18:11:07,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:11:07" (1/1) ... [2024-10-28 18:11:07,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:11:07" (1/1) ... [2024-10-28 18:11:07,668 INFO L138 Inliner]: procedures = 271, calls = 109, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 272 [2024-10-28 18:11:07,668 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-28 18:11:07,669 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-28 18:11:07,669 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-28 18:11:07,669 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-28 18:11:07,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:11:07" (1/1) ... [2024-10-28 18:11:07,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:11:07" (1/1) ... [2024-10-28 18:11:07,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:11:07" (1/1) ... [2024-10-28 18:11:07,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:11:07" (1/1) ... [2024-10-28 18:11:07,703 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:11:07" (1/1) ... [2024-10-28 18:11:07,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:11:07" (1/1) ... [2024-10-28 18:11:07,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:11:07" (1/1) ... [2024-10-28 18:11:07,717 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:11:07" (1/1) ... [2024-10-28 18:11:07,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-28 18:11:07,725 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-28 18:11:07,725 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-28 18:11:07,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-28 18:11:07,730 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:11:07" (1/1) ... [2024-10-28 18:11:07,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-28 18:11:07,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:11:07,765 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-28 18:11:07,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-28 18:11:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-28 18:11:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-28 18:11:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-28 18:11:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-28 18:11:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-28 18:11:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-28 18:11:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-28 18:11:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-28 18:11:07,812 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-28 18:11:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-28 18:11:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-28 18:11:07,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-28 18:11:07,814 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-28 18:11:07,944 INFO L238 CfgBuilder]: Building ICFG [2024-10-28 18:11:07,950 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-28 18:11:08,316 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-28 18:11:08,316 INFO L287 CfgBuilder]: Performing block encoding [2024-10-28 18:11:08,808 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-28 18:11:08,809 INFO L316 CfgBuilder]: Removed 23 assume(true) statements. [2024-10-28 18:11:08,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 06:11:08 BoogieIcfgContainer [2024-10-28 18:11:08,810 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-28 18:11:08,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-28 18:11:08,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-28 18:11:08,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-28 18:11:08,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 06:11:06" (1/3) ... [2024-10-28 18:11:08,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e36e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 06:11:08, skipping insertion in model container [2024-10-28 18:11:08,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:11:07" (2/3) ... [2024-10-28 18:11:08,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e36e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 06:11:08, skipping insertion in model container [2024-10-28 18:11:08,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 06:11:08" (3/3) ... [2024-10-28 18:11:08,819 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_75-tricky_address2_racefree.i [2024-10-28 18:11:08,838 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-28 18:11:08,839 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-28 18:11:08,839 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-28 18:11:08,885 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-28 18:11:08,938 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:11:08,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-28 18:11:08,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:11:08,942 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-28 18:11:08,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-28 18:11:08,973 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 18:11:08,985 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-28 18:11:08,993 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@41625220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:11:08,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-28 18:11:09,719 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:11:09,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:09,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1974830970, now seen corresponding path program 1 times [2024-10-28 18:11:09,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:09,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120172607] [2024-10-28 18:11:09,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:09,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:10,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-28 18:11:10,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:10,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120172607] [2024-10-28 18:11:10,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120172607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:11:10,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:11:10,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-28 18:11:10,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22803943] [2024-10-28 18:11:10,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:11:10,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:11:10,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:10,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:11:10,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:11:10,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:10,112 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:10,113 INFO L472 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-10-28 18:11:10,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:12,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:12,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-28 18:11:12,724 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:11:12,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:12,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2129310501, now seen corresponding path program 1 times [2024-10-28 18:11:12,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:12,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813462471] [2024-10-28 18:11:12,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:12,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:11:12,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:12,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813462471] [2024-10-28 18:11:12,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813462471] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:11:12,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115707668] [2024-10-28 18:11:12,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:12,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:11:12,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:11:12,881 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:11:12,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-28 18:11:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:12,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-28 18:11:12,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:11:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:11:13,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:11:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:11:13,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115707668] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:11:13,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:11:13,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-28 18:11:13,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169612487] [2024-10-28 18:11:13,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:11:13,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-28 18:11:13,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:13,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-28 18:11:13,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-28 18:11:13,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:13,029 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:13,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:11:13,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:13,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:13,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:13,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:13,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-28 18:11:13,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-28 18:11:13,387 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:11:13,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:13,388 INFO L85 PathProgramCache]: Analyzing trace with hash -149208161, now seen corresponding path program 2 times [2024-10-28 18:11:13,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:13,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576478711] [2024-10-28 18:11:13,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:13,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:11:13,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:13,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576478711] [2024-10-28 18:11:13,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576478711] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:11:13,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861082348] [2024-10-28 18:11:13,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 18:11:13,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:11:13,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:11:13,588 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:11:13,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-28 18:11:13,689 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 18:11:13,689 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:11:13,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-28 18:11:13,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:11:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:11:13,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:11:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:11:13,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861082348] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:11:13,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:11:13,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-28 18:11:13,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257350957] [2024-10-28 18:11:13,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:11:13,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 18:11:13,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:13,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 18:11:13,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-28 18:11:13,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:13,769 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:13,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 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-10-28 18:11:13,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:13,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:13,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:13,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:13,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:13,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:11:13,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-28 18:11:14,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:11:14,123 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:11:14,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:14,123 INFO L85 PathProgramCache]: Analyzing trace with hash -573245985, now seen corresponding path program 3 times [2024-10-28 18:11:14,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:14,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737370429] [2024-10-28 18:11:14,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:14,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:16,154 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:11:16,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:16,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737370429] [2024-10-28 18:11:16,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737370429] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:11:16,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456661795] [2024-10-28 18:11:16,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-28 18:11:16,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:11:16,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:11:16,157 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:11:16,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-28 18:11:16,278 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-28 18:11:16,278 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:11:16,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-28 18:11:16,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:11:16,818 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:11:16,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-28 18:11:16,908 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 79 treesize of output 56 [2024-10-28 18:11:17,322 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 79 treesize of output 56 [2024-10-28 18:11:17,518 INFO L349 Elim1Store]: treesize reduction 78, result has 3.7 percent of original size [2024-10-28 18:11:17,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 50 [2024-10-28 18:11:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:11:17,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:11:17,667 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_15| Int) (v_ArrVal_132 (Array Int Int))) (or (< 9 |v_t_funThread1of1ForFork0_~i~0#1_15|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_132) |c_~#a~0.base|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_15| 0))) is different from false [2024-10-28 18:11:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2024-10-28 18:11:17,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456661795] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:11:17,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:11:17,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-10-28 18:11:17,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359510484] [2024-10-28 18:11:17,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:11:17,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-28 18:11:17,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:17,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-28 18:11:17,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=140, Unknown=3, NotChecked=24, Total=210 [2024-10-28 18:11:17,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:17,933 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:17,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:11:17,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:17,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:17,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:11:17,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:19,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:19,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:19,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:11:19,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-28 18:11:19,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-28 18:11:19,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:11:19,275 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:11:19,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:19,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1225207394, now seen corresponding path program 1 times [2024-10-28 18:11:19,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:19,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324617865] [2024-10-28 18:11:19,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:19,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:19,380 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:11:19,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:19,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324617865] [2024-10-28 18:11:19,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324617865] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:11:19,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272148393] [2024-10-28 18:11:19,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:19,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:11:19,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:11:19,384 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:11:19,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-28 18:11:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:19,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-28 18:11:19,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:11:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:11:19,513 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:11:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:11:19,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272148393] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:11:19,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:11:19,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-28 18:11:19,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2265824] [2024-10-28 18:11:19,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:11:19,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-28 18:11:19,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:19,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-28 18:11:19,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-28 18:11:19,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:19,536 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:19,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 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-10-28 18:11:19,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:19,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:19,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:11:19,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-28 18:11:19,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:19,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:19,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:19,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:11:19,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-28 18:11:19,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 18:11:19,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-28 18:11:19,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-28 18:11:20,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:11:20,054 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2024-10-28 18:11:20,056 INFO L317 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2024-10-28 18:11:20,060 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:11:20,060 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 18:11:20,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-28 18:11:20,061 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@41625220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:11:20,061 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-28 18:11:20,064 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:11:20,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:20,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1690550556, now seen corresponding path program 1 times [2024-10-28 18:11:20,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:20,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971736338] [2024-10-28 18:11:20,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:20,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:11:20,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:20,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971736338] [2024-10-28 18:11:20,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971736338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:11:20,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:11:20,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-28 18:11:20,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165442685] [2024-10-28 18:11:20,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:11:20,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:11:20,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:20,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:11:20,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:11:20,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:20,100 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:20,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.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-10-28 18:11:20,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:20,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:20,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-28 18:11:20,123 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:11:20,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:20,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2131028665, now seen corresponding path program 1 times [2024-10-28 18:11:20,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:20,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654466601] [2024-10-28 18:11:20,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:20,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:11:20,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:20,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654466601] [2024-10-28 18:11:20,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654466601] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:11:20,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983342246] [2024-10-28 18:11:20,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:20,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:11:20,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:11:20,168 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:11:20,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-28 18:11:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:20,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-28 18:11:20,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:11:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:11:20,269 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:11:20,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:11:20,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983342246] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:11:20,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:11:20,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-28 18:11:20,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228373360] [2024-10-28 18:11:20,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:11:20,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-28 18:11:20,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:20,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-28 18:11:20,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-28 18:11:20,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:20,283 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:20,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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-10-28 18:11:20,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:20,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:20,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:20,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:20,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-28 18:11:20,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:11:20,522 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:11:20,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:20,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1246443469, now seen corresponding path program 2 times [2024-10-28 18:11:20,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:20,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841798362] [2024-10-28 18:11:20,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:20,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:11:20,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:20,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841798362] [2024-10-28 18:11:20,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841798362] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:11:20,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959235536] [2024-10-28 18:11:20,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 18:11:20,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:11:20,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:11:20,605 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:11:20,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-28 18:11:20,706 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 18:11:20,706 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:11:20,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-28 18:11:20,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:11:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:11:20,722 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:11:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 18:11:20,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959235536] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:11:20,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:11:20,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-28 18:11:20,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989774070] [2024-10-28 18:11:20,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:11:20,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 18:11:20,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:20,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 18:11:20,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-28 18:11:20,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:20,771 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:20,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:11:20,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:20,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:20,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:20,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:20,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:20,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:11:20,831 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-10-28 18:11:21,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-28 18:11:21,014 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:11:21,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:21,015 INFO L85 PathProgramCache]: Analyzing trace with hash -543057293, now seen corresponding path program 3 times [2024-10-28 18:11:21,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:21,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720456688] [2024-10-28 18:11:21,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:21,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 18:11:21,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-28 18:11:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 18:11:21,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-28 18:11:21,103 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-28 18:11:21,104 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-28 18:11:21,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-28 18:11:21,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-28 18:11:21,107 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-28 18:11:21,107 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2024-10-28 18:11:21,108 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-28 18:11:21,108 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-28 18:11:21,163 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-28 18:11:21,167 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:11:21,172 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 18:11:21,174 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-10-28 18:11:21,174 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@41625220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:11:21,174 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-28 18:11:23,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:11:23,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:23,248 INFO L85 PathProgramCache]: Analyzing trace with hash -117734180, now seen corresponding path program 1 times [2024-10-28 18:11:23,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:23,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172764411] [2024-10-28 18:11:23,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:23,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:23,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-28 18:11:23,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:23,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172764411] [2024-10-28 18:11:23,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172764411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:11:23,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:11:23,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-28 18:11:23,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952171104] [2024-10-28 18:11:23,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:11:23,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:11:23,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:23,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:11:23,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:11:23,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:23,290 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:23,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 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-10-28 18:11:23,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:31,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:31,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-28 18:11:31,251 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:11:31,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:31,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1065484084, now seen corresponding path program 1 times [2024-10-28 18:11:31,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:31,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445525411] [2024-10-28 18:11:31,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:31,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:31,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 18:11:31,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:31,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445525411] [2024-10-28 18:11:31,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445525411] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:11:31,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908332363] [2024-10-28 18:11:31,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:31,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:11:31,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:11:31,313 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-10-28 18:11:31,314 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-10-28 18:11:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:31,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-28 18:11:31,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:11:31,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 18:11:31,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:11:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 18:11:31,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908332363] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:11:31,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:11:31,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-28 18:11:31,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860038728] [2024-10-28 18:11:31,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:11:31,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-28 18:11:31,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:31,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-28 18:11:31,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-28 18:11:31,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:31,461 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:31,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:11:31,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:31,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:32,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:32,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:32,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-28 18:11:32,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:11:32,713 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:11:32,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:32,713 INFO L85 PathProgramCache]: Analyzing trace with hash -707119066, now seen corresponding path program 2 times [2024-10-28 18:11:32,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:32,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776462576] [2024-10-28 18:11:32,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:32,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:32,792 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 18:11:32,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:32,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776462576] [2024-10-28 18:11:32,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776462576] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:11:32,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022135250] [2024-10-28 18:11:32,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 18:11:32,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:11:32,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:11:32,795 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-10-28 18:11:32,797 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-10-28 18:11:32,911 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 18:11:32,912 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:11:32,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-28 18:11:32,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:11:32,927 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 18:11:32,928 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:11:32,965 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 18:11:32,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022135250] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:11:32,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:11:32,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-28 18:11:32,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710582608] [2024-10-28 18:11:32,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:11:32,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 18:11:32,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:32,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 18:11:32,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-28 18:11:32,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:32,967 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:32,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 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-10-28 18:11:32,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:32,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:32,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:34,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:34,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:34,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:11:34,042 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-10-28 18:11:34,229 WARN L453 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-10-28 18:11:34,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:11:34,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:34,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1834433894, now seen corresponding path program 3 times [2024-10-28 18:11:34,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:34,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497322853] [2024-10-28 18:11:34,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:34,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:35,996 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:11:35,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:35,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497322853] [2024-10-28 18:11:35,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497322853] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:11:35,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447994869] [2024-10-28 18:11:35,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-28 18:11:35,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:11:35,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:11:36,000 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:11:36,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-28 18:11:36,163 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-28 18:11:36,163 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:11:36,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-28 18:11:36,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:11:36,585 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:11:36,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-28 18:11:36,682 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 79 treesize of output 56 [2024-10-28 18:11:37,152 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 79 treesize of output 56 [2024-10-28 18:11:37,587 INFO L349 Elim1Store]: treesize reduction 78, result has 3.7 percent of original size [2024-10-28 18:11:37,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 50 [2024-10-28 18:11:37,600 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-28 18:11:37,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:11:37,643 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_440 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_440) |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2024-10-28 18:11:37,667 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_15| Int) (v_ArrVal_440 (Array Int Int))) (or (< |v_t_funThread1of2ForFork0_~i~0#1_15| 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_440) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_15|))) is different from false [2024-10-28 18:11:37,862 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 3 not checked. [2024-10-28 18:11:37,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447994869] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:11:37,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:11:37,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 17 [2024-10-28 18:11:37,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859495760] [2024-10-28 18:11:37,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:11:37,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-28 18:11:37,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:37,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-28 18:11:37,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=188, Unknown=2, NotChecked=58, Total=306 [2024-10-28 18:11:37,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:37,865 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:37,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 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-10-28 18:11:37,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:37,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:37,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:11:37,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:40,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:40,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:40,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:11:40,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 18:11:40,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-28 18:11:41,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-28 18:11:41,155 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:11:41,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:41,156 INFO L85 PathProgramCache]: Analyzing trace with hash -247776335, now seen corresponding path program 1 times [2024-10-28 18:11:41,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:41,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269588320] [2024-10-28 18:11:41,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:41,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-28 18:11:41,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:41,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269588320] [2024-10-28 18:11:41,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269588320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:11:41,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:11:41,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-28 18:11:41,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718684478] [2024-10-28 18:11:41,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:11:41,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:11:41,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:41,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:11:41,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:11:41,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:41,301 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:41,301 INFO L472 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-10-28 18:11:41,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:41,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:41,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:11:41,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 18:11:41,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:42,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:42,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:42,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:11:42,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 18:11:42,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:42,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-28 18:11:42,911 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:11:42,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:11:42,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1366610943, now seen corresponding path program 1 times [2024-10-28 18:11:42,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:11:42,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742116914] [2024-10-28 18:11:42,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:42,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:11:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:49,559 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:11:49,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:11:49,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742116914] [2024-10-28 18:11:49,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742116914] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:11:49,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071575758] [2024-10-28 18:11:49,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:11:49,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:11:49,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:11:49,562 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:11:49,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-28 18:11:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:11:49,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-10-28 18:11:49,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:11:50,487 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:11:50,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-28 18:11:50,557 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 79 treesize of output 56 [2024-10-28 18:11:50,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-28 18:11:51,071 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 79 treesize of output 56 [2024-10-28 18:11:51,405 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:11:51,405 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 23 treesize of output 11 [2024-10-28 18:11:51,657 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 79 treesize of output 56 [2024-10-28 18:11:52,061 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-28 18:11:52,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 92 treesize of output 232 [2024-10-28 18:11:54,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:11:54,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 553 treesize of output 361 [2024-10-28 18:11:55,175 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-28 18:11:55,175 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:11:55,580 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 25 treesize of output 16 [2024-10-28 18:11:55,596 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (and (or (forall ((v_ArrVal_562 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_17| Int)) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_562) |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_17| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) .cse2) 0)) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (forall ((v_ArrVal_562 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_17| Int)) (let ((.cse3 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_17| 28)))) (or (= .cse3 |c_t_funThread1of2ForFork0_~p~0#1.offset|) (= (select (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_562) |c_~#a~0.base|))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1))) .cse2) 0)))))) is different from false [2024-10-28 18:11:55,614 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_17| Int) (v_ArrVal_562 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_17| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_562) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_17| 28) |c_~#a~0.offset|)) 0) (< |v_t_funThread1of2ForFork0_~i~0#1_17| 0) (= |v_t_funThread2of2ForFork0_~i~0#1_17| |v_t_funThread1of2ForFork0_~i~0#1_17|) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_17|))) is different from false [2024-10-28 18:11:55,626 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_17| Int) (v_ArrVal_562 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_562) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_17| 28) |c_~#a~0.offset|)) 0) (< |v_t_funThread1of2ForFork0_~i~0#1_17| 0) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_17|))) is different from false [2024-10-28 18:11:55,788 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 4 not checked. [2024-10-28 18:11:55,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071575758] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:11:55,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:11:55,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20, 11] total 37 [2024-10-28 18:11:55,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165624991] [2024-10-28 18:11:55,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:11:55,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-28 18:11:55,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:11:55,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-28 18:11:55,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1038, Unknown=8, NotChecked=204, Total=1406 [2024-10-28 18:11:55,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:11:55,791 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:11:55,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.4210526315789473) internal successors, (92), 37 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:11:55,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:55,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:11:55,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:11:55,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 18:11:55,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:11:55,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:12:07,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:12:07,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:12:07,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:12:07,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 18:12:07,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:12:07,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-28 18:12:07,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-28 18:12:07,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:12:07,760 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:12:07,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:12:07,761 INFO L85 PathProgramCache]: Analyzing trace with hash 422182801, now seen corresponding path program 1 times [2024-10-28 18:12:07,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:12:07,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041418066] [2024-10-28 18:12:07,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:12:07,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:12:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:12:07,841 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:12:07,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:12:07,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041418066] [2024-10-28 18:12:07,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041418066] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:12:07,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313080812] [2024-10-28 18:12:07,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:12:07,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:12:07,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:12:07,844 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-10-28 18:12:07,848 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-10-28 18:12:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:12:07,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-28 18:12:07,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:12:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:12:08,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:12:08,056 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:12:08,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313080812] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:12:08,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:12:08,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-28 18:12:08,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522082971] [2024-10-28 18:12:08,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:12:08,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-28 18:12:08,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:12:08,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-28 18:12:08,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-28 18:12:08,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:12:08,058 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:12:08,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 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-10-28 18:12:08,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:12:08,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:12:08,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:12:08,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 18:12:08,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:12:08,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-10-28 18:12:08,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:12:10,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:12:10,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:12:10,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:12:10,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:12:10,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:12:10,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-28 18:12:10,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-28 18:12:10,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-28 18:12:10,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-28 18:12:10,888 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:12:10,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:12:10,889 INFO L85 PathProgramCache]: Analyzing trace with hash 993901123, now seen corresponding path program 1 times [2024-10-28 18:12:10,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:12:10,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096525] [2024-10-28 18:12:10,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:12:10,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:12:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:12:17,387 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:12:17,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:12:17,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096525] [2024-10-28 18:12:17,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096525] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:12:17,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362924087] [2024-10-28 18:12:17,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:12:17,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:12:17,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:12:17,389 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-10-28 18:12:17,391 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-10-28 18:12:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:12:17,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-10-28 18:12:17,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:12:18,415 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:12:18,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-28 18:12:18,488 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 79 treesize of output 56 [2024-10-28 18:12:18,681 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 79 treesize of output 56 [2024-10-28 18:12:18,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-28 18:12:19,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 79 treesize of output 56 [2024-10-28 18:12:19,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:12:19,379 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 20 treesize of output 15 [2024-10-28 18:12:19,652 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-28 18:12:19,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 92 treesize of output 232 [2024-10-28 18:12:19,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:12:19,996 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 20 treesize of output 15 [2024-10-28 18:12:20,344 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:12:20,345 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 23 treesize of output 11 [2024-10-28 18:12:21,386 INFO L349 Elim1Store]: treesize reduction 180, result has 38.1 percent of original size [2024-10-28 18:12:21,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 250 treesize of output 261 [2024-10-28 18:12:24,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:12:24,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 474 treesize of output 326 [2024-10-28 18:12:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 5 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-28 18:12:25,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:12:26,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:12:26,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-10-28 18:12:26,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:12:26,280 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 39 treesize of output 38 [2024-10-28 18:12:26,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-10-28 18:12:26,585 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((|v_t_funThread1of2ForFork0_~i~0#1_21| Int) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_772 Int) (|v_t_funThread2of2ForFork0_~i~0#1_21| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_21| 0) (= 0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_21| 28)) v_ArrVal_772) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_21| 28) |c_~#a~0.offset|))) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_21|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_21| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_21| 0) (forall ((v_ArrVal_767 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_21| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_21| 28) |c_~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_21| |v_t_funThread1of2ForFork0_~i~0#1_21|))) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_21|)))) is different from false [2024-10-28 18:12:27,585 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 5 refuted. 2 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:12:27,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362924087] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:12:27,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:12:27,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 12] total 43 [2024-10-28 18:12:27,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800464678] [2024-10-28 18:12:27,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:12:27,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-28 18:12:27,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:12:27,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-28 18:12:27,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1579, Unknown=53, NotChecked=82, Total=1892 [2024-10-28 18:12:27,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:12:27,592 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:12:27,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.8636363636363638) internal successors, (126), 43 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:12:27,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:12:27,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:12:27,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:12:27,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:12:27,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:12:27,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-10-28 18:12:27,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-28 18:12:27,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:12:33,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:12:33,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:12:33,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:12:33,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:12:33,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:12:33,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-28 18:12:33,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-28 18:12:33,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-28 18:12:33,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-28 18:12:33,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-28 18:12:33,914 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:12:33,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:12:33,914 INFO L85 PathProgramCache]: Analyzing trace with hash -803001141, now seen corresponding path program 2 times [2024-10-28 18:12:33,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:12:33,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160231689] [2024-10-28 18:12:33,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:12:33,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:12:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:12:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-28 18:12:36,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:12:36,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160231689] [2024-10-28 18:12:36,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160231689] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:12:36,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153898947] [2024-10-28 18:12:36,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 18:12:36,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:12:36,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:12:36,817 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:12:36,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-28 18:12:37,019 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 18:12:37,019 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:12:37,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-10-28 18:12:37,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:12:37,733 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:12:37,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-28 18:12:37,802 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 79 treesize of output 56 [2024-10-28 18:12:37,984 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 79 treesize of output 56 [2024-10-28 18:12:38,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-28 18:12:38,475 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 20 treesize of output 15 [2024-10-28 18:12:38,718 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-28 18:12:38,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 92 treesize of output 232 [2024-10-28 18:12:39,029 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 20 treesize of output 15 [2024-10-28 18:12:39,494 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 20 treesize of output 15 [2024-10-28 18:12:39,758 INFO L349 Elim1Store]: treesize reduction 180, result has 38.1 percent of original size [2024-10-28 18:12:39,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 250 treesize of output 261 [2024-10-28 18:12:40,682 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 504 treesize of output 391 [2024-10-28 18:12:41,764 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 504 treesize of output 479 [2024-10-28 18:12:42,495 INFO L349 Elim1Store]: treesize reduction 8, result has 95.3 percent of original size [2024-10-28 18:12:42,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 45 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 507 treesize of output 611 [2024-10-28 18:13:55,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:13:55,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 894 treesize of output 514 [2024-10-28 18:13:56,286 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 3 proven. 58 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-28 18:13:56,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:13:56,460 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_879 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_879) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) 0))) (forall ((v_ArrVal_878 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0))) is different from false [2024-10-28 18:13:56,466 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_879 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_879) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) 0))) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_877 Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0))) is different from false [2024-10-28 18:13:56,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:13:56,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-10-28 18:13:56,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:13:56,530 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 39 treesize of output 38 [2024-10-28 18:13:56,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-10-28 18:13:56,720 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (let ((.cse0 (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_870 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_23| Int) (v_ArrVal_877 Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_870) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_23| 28)) v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_~#a~0.base|) .cse2) 0)))) (and (or .cse0 (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_870 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_23| Int) (v_ArrVal_877 Int)) (let ((.cse1 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_23| 28)))) (or (= .cse1 |c_t_funThread1of2ForFork0_~p~0#1.offset|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_870) |c_~#a~0.base|) .cse1 v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_~#a~0.base|) .cse2) 0)))) (or .cse0 (not (= |c_~#__global_lock~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)))))) is different from false [2024-10-28 18:13:56,772 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of2ForFork0_~i~0#1_23| Int)) (or (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_870 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_23| Int) (v_ArrVal_877 Int)) (or (= |v_t_funThread2of2ForFork0_~i~0#1_23| |v_t_funThread1of2ForFork0_~i~0#1_23|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_870) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_23| 28)) v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_23| 28))) 0))) (< |v_t_funThread1of2ForFork0_~i~0#1_23| 0) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_23|))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_878 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_23| Int) (v_ArrVal_870 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_23| Int) (v_ArrVal_877 Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_23| 0) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_870) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_23| 28)) v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_23| 28))) 0) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_23|))))) is different from false [2024-10-28 18:13:57,300 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 6 not checked. [2024-10-28 18:13:57,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153898947] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:13:57,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:13:57,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 21, 12] total 37 [2024-10-28 18:13:57,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689263360] [2024-10-28 18:13:57,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:13:57,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-28 18:13:57,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:13:57,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-28 18:13:57,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=933, Unknown=41, NotChecked=268, Total=1406 [2024-10-28 18:13:57,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:13:57,303 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:13:57,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.289473684210526) internal successors, (125), 37 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-10-28 18:13:57,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:13:57,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:13:57,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:13:57,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:13:57,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:13:57,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-10-28 18:13:57,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-28 18:13:57,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-28 18:13:57,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:14:08,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:14:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:14:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:14:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:14:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:14:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-28 18:14:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-28 18:14:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-28 18:14:08,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-28 18:14:08,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-28 18:14:08,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-28 18:14:09,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-28 18:14:09,065 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2024-10-28 18:14:09,066 INFO L317 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was SAFE (1/3) [2024-10-28 18:14:09,070 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:14:09,074 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 18:14:09,074 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-28 18:14:09,075 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@41625220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:14:09,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-28 18:14:09,081 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:14:09,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:14:09,082 INFO L85 PathProgramCache]: Analyzing trace with hash -219783028, now seen corresponding path program 1 times [2024-10-28 18:14:09,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:14:09,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844716564] [2024-10-28 18:14:09,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:14:09,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:14:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:14:09,131 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-28 18:14:09,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:14:09,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844716564] [2024-10-28 18:14:09,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844716564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:14:09,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:14:09,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-28 18:14:09,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028942517] [2024-10-28 18:14:09,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:14:09,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:14:09,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:14:09,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:14:09,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:14:09,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:14:09,133 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:14:09,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) 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-10-28 18:14:09,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:14:09,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:14:09,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-28 18:14:09,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:14:09,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:14:09,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1459804062, now seen corresponding path program 1 times [2024-10-28 18:14:09,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:14:09,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739580909] [2024-10-28 18:14:09,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:14:09,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:14:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:14:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-28 18:14:09,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:14:09,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739580909] [2024-10-28 18:14:09,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739580909] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:14:09,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509941041] [2024-10-28 18:14:09,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:14:09,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:14:09,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:14:09,214 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-10-28 18:14:09,215 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-10-28 18:14:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:14:09,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-28 18:14:09,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:14:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-28 18:14:09,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:14:09,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-28 18:14:09,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509941041] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:14:09,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:14:09,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-28 18:14:09,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143557057] [2024-10-28 18:14:09,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:14:09,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-28 18:14:09,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:14:09,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-28 18:14:09,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-28 18:14:09,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:14:09,372 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:14:09,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:14:09,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:14:09,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:14:09,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:14:09,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:14:09,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-28 18:14:09,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:14:09,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:14:09,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:14:09,631 INFO L85 PathProgramCache]: Analyzing trace with hash -575926864, now seen corresponding path program 2 times [2024-10-28 18:14:09,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:14:09,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805726289] [2024-10-28 18:14:09,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:14:09,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:14:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:14:09,705 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-28 18:14:09,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:14:09,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805726289] [2024-10-28 18:14:09,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805726289] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:14:09,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289420986] [2024-10-28 18:14:09,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 18:14:09,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:14:09,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:14:09,708 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:14:09,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-28 18:14:09,841 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 18:14:09,842 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:14:09,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-28 18:14:09,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:14:09,857 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-28 18:14:09,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:14:09,907 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-28 18:14:09,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289420986] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:14:09,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:14:09,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-28 18:14:09,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306412206] [2024-10-28 18:14:09,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:14:09,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 18:14:09,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:14:09,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 18:14:09,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-28 18:14:09,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:14:09,910 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:14:09,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 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-10-28 18:14:09,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:14:09,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:14:09,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:14:09,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:14:09,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:14:09,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:14:09,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-28 18:14:10,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-28 18:14:10,172 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:14:10,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:14:10,173 INFO L85 PathProgramCache]: Analyzing trace with hash 902803568, now seen corresponding path program 3 times [2024-10-28 18:14:10,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:14:10,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872773607] [2024-10-28 18:14:10,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:14:10,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:14:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 18:14:10,191 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-28 18:14:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 18:14:10,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-28 18:14:10,218 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-28 18:14:10,219 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-28 18:14:10,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-28 18:14:10,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-28 18:14:10,221 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-28 18:14:10,222 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/3) [2024-10-28 18:14:10,222 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-28 18:14:10,222 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-28 18:14:10,260 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-28 18:14:10,265 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:14:10,266 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 18:14:10,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-28 18:14:10,268 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@41625220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:14:10,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-28 18:14:11,079 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:14:11,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:14:11,080 INFO L85 PathProgramCache]: Analyzing trace with hash -960986124, now seen corresponding path program 1 times [2024-10-28 18:14:11,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:14:11,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657921059] [2024-10-28 18:14:11,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:14:11,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:14:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:14:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-28 18:14:11,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:14:11,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657921059] [2024-10-28 18:14:11,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657921059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:14:11,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:14:11,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-28 18:14:11,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982305371] [2024-10-28 18:14:11,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:14:11,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:14:11,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:14:11,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:14:11,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:14:11,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:14:11,118 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:14:11,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 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-10-28 18:14:11,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:14:11,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:14:11,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-28 18:14:11,976 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:14:11,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:14:11,976 INFO L85 PathProgramCache]: Analyzing trace with hash 97974495, now seen corresponding path program 1 times [2024-10-28 18:14:11,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:14:11,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007147426] [2024-10-28 18:14:11,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:14:11,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:14:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:14:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-28 18:14:12,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:14:12,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007147426] [2024-10-28 18:14:12,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007147426] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:14:12,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452268547] [2024-10-28 18:14:12,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:14:12,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:14:12,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:14:12,024 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:14:12,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-28 18:14:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:14:12,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-28 18:14:12,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:14:12,185 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-28 18:14:12,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:14:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-28 18:14:12,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452268547] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:14:12,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:14:12,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-28 18:14:12,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294657886] [2024-10-28 18:14:12,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:14:12,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-28 18:14:12,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:14:12,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-28 18:14:12,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-28 18:14:12,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:14:12,199 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:14:12,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 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-10-28 18:14:12,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:14:12,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:14:12,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:14:12,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:14:12,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-28 18:14:12,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-28 18:14:12,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:14:12,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:14:12,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1874118272, now seen corresponding path program 2 times [2024-10-28 18:14:12,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:14:12,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393975955] [2024-10-28 18:14:12,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:14:12,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:14:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:14:12,526 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-28 18:14:12,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:14:12,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393975955] [2024-10-28 18:14:12,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393975955] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:14:12,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009174613] [2024-10-28 18:14:12,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 18:14:12,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:14:12,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:14:12,529 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:14:12,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-28 18:14:12,671 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 18:14:12,671 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:14:12,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-28 18:14:12,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:14:12,682 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-28 18:14:12,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:14:12,723 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-28 18:14:12,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009174613] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:14:12,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:14:12,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-28 18:14:12,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802026648] [2024-10-28 18:14:12,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:14:12,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 18:14:12,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:14:12,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 18:14:12,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-28 18:14:12,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:14:12,725 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:14:12,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:14:12,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:14:12,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:14:12,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:14:12,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:14:12,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:14:12,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:14:12,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-28 18:14:12,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-28 18:14:12,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:14:12,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:14:12,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1400088032, now seen corresponding path program 3 times [2024-10-28 18:14:12,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:14:12,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017157218] [2024-10-28 18:14:12,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:14:12,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:14:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 18:14:13,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-28 18:14:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 18:14:13,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-28 18:14:13,093 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-28 18:14:13,094 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-28 18:14:13,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-28 18:14:13,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-28 18:14:13,096 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-28 18:14:13,096 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/4) [2024-10-28 18:14:13,096 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-28 18:14:13,096 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-28 18:14:13,133 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-28 18:14:13,136 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:14:13,139 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 18:14:13,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread4of4ForFork0 ======== [2024-10-28 18:14:13,140 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@41625220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:14:13,140 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-28 18:14:14,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:14:14,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:14:14,378 INFO L85 PathProgramCache]: Analyzing trace with hash 626551190, now seen corresponding path program 1 times [2024-10-28 18:14:14,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:14:14,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808727801] [2024-10-28 18:14:14,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:14:14,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:14:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:14:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-28 18:14:14,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:14:14,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808727801] [2024-10-28 18:14:14,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808727801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:14:14,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:14:14,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-28 18:14:14,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776080539] [2024-10-28 18:14:14,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:14:14,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:14:14,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:14:14,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:14:14,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:14:14,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:14:14,419 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:14:14,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 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-10-28 18:14:14,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:14:41,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:14:41,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-28 18:14:41,682 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:14:41,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:14:41,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1809594357, now seen corresponding path program 1 times [2024-10-28 18:14:41,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:14:41,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39227191] [2024-10-28 18:14:41,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:14:41,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:14:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:14:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-28 18:14:41,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:14:41,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39227191] [2024-10-28 18:14:41,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39227191] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:14:41,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109131000] [2024-10-28 18:14:41,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:14:41,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:14:41,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:14:41,746 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:14:41,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-28 18:14:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:14:41,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-28 18:14:41,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:14:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-28 18:14:41,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:14:41,977 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-28 18:14:41,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109131000] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:14:41,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:14:41,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-28 18:14:41,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239230980] [2024-10-28 18:14:41,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:14:41,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-28 18:14:41,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:14:41,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-28 18:14:41,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-28 18:14:41,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:14:41,979 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:14:41,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:14:41,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:14:41,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:14:51,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:14:51,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:14:51,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-10-28 18:14:51,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-28 18:14:51,907 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:14:51,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:14:51,907 INFO L85 PathProgramCache]: Analyzing trace with hash 242927382, now seen corresponding path program 2 times [2024-10-28 18:14:51,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:14:51,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871038365] [2024-10-28 18:14:51,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:14:51,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:14:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:14:52,026 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-28 18:14:52,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:14:52,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871038365] [2024-10-28 18:14:52,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871038365] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:14:52,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615025116] [2024-10-28 18:14:52,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 18:14:52,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:14:52,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:14:52,029 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:14:52,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-28 18:14:52,251 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 18:14:52,251 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:14:52,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-28 18:14:52,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:14:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-28 18:14:52,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:14:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-28 18:14:52,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615025116] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:14:52,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:14:52,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-28 18:14:52,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666085531] [2024-10-28 18:14:52,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:14:52,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 18:14:52,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:14:52,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 18:14:52,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-28 18:14:52,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:14:52,326 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:14:52,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:14:52,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:14:52,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:14:52,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:15:03,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:15:03,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:15:03,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:15:03,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-10-28 18:15:03,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-28 18:15:03,202 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:15:03,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:15:03,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1628555958, now seen corresponding path program 3 times [2024-10-28 18:15:03,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:15:03,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125408895] [2024-10-28 18:15:03,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:15:03,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:15:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:15:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-28 18:15:21,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:15:21,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125408895] [2024-10-28 18:15:21,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125408895] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:15:21,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887617081] [2024-10-28 18:15:21,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-28 18:15:21,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:15:21,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:15:21,460 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 18:15:21,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-28 18:15:22,632 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-28 18:15:22,633 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:15:22,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-10-28 18:15:22,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:15:23,187 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:15:23,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-28 18:15:23,283 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 79 treesize of output 56 [2024-10-28 18:15:23,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-28 18:15:23,798 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 79 treesize of output 56 [2024-10-28 18:15:24,036 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-10-28 18:15:24,036 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 27 treesize of output 26 [2024-10-28 18:15:24,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 56 [2024-10-28 18:15:24,676 INFO L349 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2024-10-28 18:15:24,676 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 49 treesize of output 51 [2024-10-28 18:15:24,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:15:24,934 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 42 treesize of output 33 [2024-10-28 18:15:25,111 INFO L349 Elim1Store]: treesize reduction 180, result has 38.1 percent of original size [2024-10-28 18:15:25,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 141 [2024-10-28 18:15:25,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:15:25,315 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 42 treesize of output 33 [2024-10-28 18:15:25,932 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 119 treesize of output 96 [2024-10-28 18:15:26,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:15:26,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:15:26,384 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2024-10-28 18:15:26,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 25 [2024-10-28 18:15:27,080 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-28 18:15:27,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 132 treesize of output 272 [2024-10-28 18:15:31,784 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-28 18:15:31,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 507 treesize of output 471 [2024-10-28 18:17:24,604 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 5297 treesize of output 4124 [2024-10-28 18:18:02,271 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-28 18:18:02,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 5310 treesize of output 3150 [2024-10-28 18:18:44,444 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-28 18:18:44,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 561 treesize of output 493 [2024-10-28 18:19:39,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:19:39,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 5117 treesize of output 2677 [2024-10-28 18:19:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 11 proven. 42 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-28 18:19:53,285 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:19:53,492 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1606 (Array Int Int))) (= (select (let ((.cse0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_~#a~0.base|)) (.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3))))) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2024-10-28 18:19:53,522 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1606 (Array Int Int))) (= (select (let ((.cse0 (let ((.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_~#a~0.base|))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3)))))) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2024-10-28 18:19:53,552 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1606 (Array Int Int))) (= (select (let ((.cse0 (let ((.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (let ((.cse5 (select |c_#memory_int| |c_~#a~0.base|)) (.cse6 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (store .cse5 .cse6 (+ (- 1) (select .cse5 .cse6)))))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_~#a~0.base|))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3)))))) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2024-10-28 18:19:54,409 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (let ((.cse7 (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_15|) (< |v_t_funThread4of4ForFork0_~i~0#1_15| 0) (= (select (let ((.cse0 (let ((.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1603) |c_~#a~0.base|)) (.cse6 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (store .cse5 .cse6 (+ (- 1) (select .cse5 .cse6)))))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_~#a~0.base|))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3)))))) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ .cse7 |c_~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1602) |c_~#a~0.base|) (+ .cse7 |c_~#a~0.offset| 4)) 0))))) is different from false [2024-10-28 18:20:19,730 INFO L349 Elim1Store]: treesize reduction 104, result has 31.1 percent of original size [2024-10-28 18:20:19,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 98 [2024-10-28 18:20:19,936 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-10-28 18:20:19,937 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 3 case distinctions, treesize of input 85 treesize of output 71 [2024-10-28 18:20:19,982 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 32 treesize of output 25 [2024-10-28 18:20:20,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:20:20,074 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 32 treesize of output 36 [2024-10-28 18:20:20,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2024-10-28 18:20:20,273 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 8 treesize of output 4 [2024-10-28 18:20:20,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:20:20,399 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 33 [2024-10-28 18:20:20,562 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 18:20:20,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:20:20,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 78 [2024-10-28 18:20:22,827 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (.cse0 (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_~#a~0.base|)) (.cse7 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (and (or .cse0 (and (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int)) (or (forall ((v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1600 Int) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse1 (let ((.cse4 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse5 (let ((.cse6 (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1596) |c_~#a~0.base|) .cse7 v_ArrVal_1600)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1603) |c_~#a~0.base|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) (- 1)))))) (store .cse5 .cse4 (+ (select .cse5 .cse4) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_~#a~0.base|))) (store .cse3 .cse4 (+ (- 1) (select .cse3 .cse4)))))) (.cse2 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= |v_t_funThread2of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (< |v_t_funThread4of4ForFork0_~i~0#1_15| 0))) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|))) (or (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1603 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1600 Int) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse8 (let ((.cse11 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (let ((.cse10 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse12 (let ((.cse13 (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1596) |c_~#a~0.base|) .cse7 v_ArrVal_1600)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1603) |c_~#a~0.base|))) (store .cse13 .cse7 (+ (select .cse13 .cse7) (- 1)))))) (store .cse12 .cse11 (+ (select .cse12 .cse11) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_~#a~0.base|))) (store .cse10 .cse11 (+ (- 1) (select .cse10 .cse11)))))) (.cse9 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (store .cse8 .cse9 (+ (select .cse8 .cse9) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|) (< |v_t_funThread4of4ForFork0_~i~0#1_15| 0))) .cse14) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int)) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|) (forall ((v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1600 Int) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (let ((.cse21 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse15 (let ((.cse18 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (let ((.cse17 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse19 (let ((.cse20 (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1596) |c_~#a~0.base|) .cse7 v_ArrVal_1600)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1603) |c_~#a~0.base|))) (store .cse20 .cse7 (+ (select .cse20 .cse7) (- 1)))))) (store .cse19 .cse18 (+ (select .cse19 .cse18) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_~#a~0.base|))) (store .cse17 .cse18 (+ (- 1) (select .cse17 .cse18)))))) (.cse16 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (store .cse15 .cse16 (+ (select .cse15 .cse16) 1))) .cse21) 0) (= |v_t_funThread2of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (< |v_t_funThread4of4ForFork0_~i~0#1_15| 0) (= .cse21 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))))) (or (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1603 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1600 Int) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (let ((.cse22 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_15|) (= .cse22 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= (select (let ((.cse23 (let ((.cse25 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (let ((.cse24 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse26 (let ((.cse27 (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1596) |c_~#a~0.base|) .cse7 v_ArrVal_1600)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1603) |c_~#a~0.base|))) (store .cse27 .cse7 (+ (select .cse27 .cse7) (- 1)))))) (store .cse26 .cse25 (+ (select .cse26 .cse25) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_~#a~0.base|))) (store .cse24 .cse25 (+ (- 1) (select .cse24 .cse25))))))) (store .cse23 .cse22 (+ (select .cse23 .cse22) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|) (< |v_t_funThread4of4ForFork0_~i~0#1_15| 0)))) .cse14) (or (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1603 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1600 Int) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (let ((.cse28 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_15|) (= .cse28 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (= (select (let ((.cse29 (let ((.cse31 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (let ((.cse30 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse32 (let ((.cse33 (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1596) |c_~#a~0.base|) .cse7 v_ArrVal_1600)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1603) |c_~#a~0.base|))) (store .cse33 .cse7 (+ (select .cse33 .cse7) (- 1)))))) (store .cse32 .cse31 (+ (select .cse32 .cse31) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_~#a~0.base|))) (store .cse30 .cse31 (+ (- 1) (select .cse30 .cse31))))))) (store .cse29 .cse28 (+ (select .cse29 .cse28) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|) (= |v_t_funThread2of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (< |v_t_funThread4of4ForFork0_~i~0#1_15| 0)))) .cse0) (forall ((|v_t_funThread3of4ForFork0_~i~0#1_15| Int)) (let ((.cse34 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= .cse34 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int)) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|) (forall ((v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1600 Int) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (let ((.cse40 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse35 (let ((.cse37 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (let ((.cse36 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse38 (let ((.cse39 (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1596) |c_~#a~0.base|) .cse7 v_ArrVal_1600)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1603) |c_~#a~0.base|))) (store .cse39 .cse7 (+ (select .cse39 .cse7) (- 1)))))) (store .cse38 .cse37 (+ (select .cse38 .cse37) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_~#a~0.base|))) (store .cse36 .cse37 (+ (- 1) (select .cse36 .cse37))))))) (store .cse35 .cse34 (+ (select .cse35 .cse34) 1))) .cse40) 0) (= |v_t_funThread2of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (< |v_t_funThread4of4ForFork0_~i~0#1_15| 0) (= .cse40 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))))))) is different from false [2024-10-28 18:20:25,237 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of4ForFork0_~i~0#1_15| Int)) (or (forall ((|v_t_funThread3of4ForFork0_~i~0#1_15| Int)) (or (= |v_t_funThread1of4ForFork0_~i~0#1_15| |v_t_funThread3of4ForFork0_~i~0#1_15|) (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int)) (or (forall ((v_ArrVal_1603 (Array Int Int)) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1600 Int) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int)) (or (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_15|) (= |v_t_funThread1of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse0 (let ((.cse3 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (let ((.cse6 (+ |c_~#a~0.offset| (* |v_t_funThread1of4ForFork0_~i~0#1_15| 28)))) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1596) |c_~#a~0.base|) .cse6 v_ArrVal_1600)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1603) |c_~#a~0.base|))) (store .cse5 .cse6 (+ (- 1) (select .cse5 .cse6))))))) (store .cse4 .cse3 (+ (select .cse4 .cse3) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_~#a~0.base|))) (store .cse2 .cse3 (+ (- 1) (select .cse2 .cse3)))))) (.cse1 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= |v_t_funThread2of4ForFork0_~i~0#1_15| |v_t_funThread4of4ForFork0_~i~0#1_15|) (< |v_t_funThread4of4ForFork0_~i~0#1_15| 0))) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|))))) (< |v_t_funThread1of4ForFork0_~i~0#1_15| 0) (< 9 |v_t_funThread1of4ForFork0_~i~0#1_15|))) (or (forall ((|v_t_funThread2of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1603 (Array Int Int)) (|v_t_funThread3of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1596 (Array Int Int)) (|v_t_funThread1of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1600 Int) (|v_t_funThread4of4ForFork0_~i~0#1_15| Int) (v_ArrVal_1606 (Array Int Int))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_15|) (= (select (let ((.cse7 (let ((.cse10 (+ (* |v_t_funThread2of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (let ((.cse9 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse11 (let ((.cse13 (+ |c_~#a~0.offset| (* |v_t_funThread1of4ForFork0_~i~0#1_15| 28)))) (let ((.cse12 (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1596) |c_~#a~0.base|) .cse13 v_ArrVal_1600)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1603) |c_~#a~0.base|))) (store .cse12 .cse13 (+ (- 1) (select .cse12 .cse13))))))) (store .cse11 .cse10 (+ (select .cse11 .cse10) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_~#a~0.base|))) (store .cse9 .cse10 (+ (- 1) (select .cse9 .cse10)))))) (.cse8 (+ (* |v_t_funThread3of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1))) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_15| 28) |c_~#a~0.offset|)) 0) (= |v_t_funThread3of4ForFork0_~i~0#1_15| |v_t_funThread2of4ForFork0_~i~0#1_15|) (= |v_t_funThread1of4ForFork0_~i~0#1_15| |v_t_funThread3of4ForFork0_~i~0#1_15|) (< |v_t_funThread1of4ForFork0_~i~0#1_15| 0) (< |v_t_funThread4of4ForFork0_~i~0#1_15| 0) (< 9 |v_t_funThread1of4ForFork0_~i~0#1_15|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2024-10-28 18:20:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 41 refuted. 5 times theorem prover too weak. 21 trivial. 14 not checked. [2024-10-28 18:20:44,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887617081] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:20:44,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:20:44,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23, 25] total 59 [2024-10-28 18:20:44,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068522523] [2024-10-28 18:20:44,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:20:44,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-10-28 18:20:44,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:20:44,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-10-28 18:20:44,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=2589, Unknown=41, NotChecked=654, Total=3540 [2024-10-28 18:20:44,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:20:44,008 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:20:44,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 3.783333333333333) internal successors, (227), 59 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:20:44,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:20:44,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:20:44,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:20:44,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:23:46,400 WARN L286 SmtUtils]: Spent 2.32m on a formula simplification. DAG size of input: 685 DAG size of output: 421 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-28 18:24:01,567 WARN L286 SmtUtils]: Spent 11.15s on a formula simplification. DAG size of input: 450 DAG size of output: 205 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15