./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_77-tricky_address4_racing.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_77-tricky_address4_racing.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 dce9d71ca8bbe247a74e6b2653e5cdb882c6b8b5d902edf534df70d90ee806fe --- Real Ultimate output --- This is Ultimate 0.2.5-dev-b03bd7c-m [2024-10-28 18:16:34,519 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-28 18:16:34,586 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-28 18:16:34,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-28 18:16:34,591 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-28 18:16:34,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-28 18:16:34,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-28 18:16:34,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-28 18:16:34,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-28 18:16:34,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-28 18:16:34,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-28 18:16:34,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-28 18:16:34,614 INFO L153 SettingsManager]: * Use SBE=true [2024-10-28 18:16:34,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-28 18:16:34,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-28 18:16:34,615 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-28 18:16:34,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-28 18:16:34,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-28 18:16:34,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-28 18:16:34,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-28 18:16:34,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-28 18:16:34,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-28 18:16:34,618 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-28 18:16:34,618 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-28 18:16:34,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-28 18:16:34,619 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-28 18:16:34,619 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-28 18:16:34,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-28 18:16:34,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-28 18:16:34,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-28 18:16:34,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-28 18:16:34,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-28 18:16:34,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-28 18:16:34,626 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-28 18:16:34,626 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-28 18:16:34,626 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-28 18:16:34,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-28 18:16:34,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-28 18:16:34,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-28 18:16:34,629 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-28 18:16:34,630 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-28 18:16:34,630 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 -> dce9d71ca8bbe247a74e6b2653e5cdb882c6b8b5d902edf534df70d90ee806fe [2024-10-28 18:16:34,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-28 18:16:34,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-28 18:16:34,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-28 18:16:34,905 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-28 18:16:34,906 INFO L274 PluginConnector]: CDTParser initialized [2024-10-28 18:16:34,908 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_77-tricky_address4_racing.i [2024-10-28 18:16:36,366 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-28 18:16:36,649 INFO L384 CDTParser]: Found 1 translation units. [2024-10-28 18:16:36,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_77-tricky_address4_racing.i [2024-10-28 18:16:36,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f5a664307/67043a0370094ba89f19ea82a093dda5/FLAG7bcc080da [2024-10-28 18:16:36,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f5a664307/67043a0370094ba89f19ea82a093dda5 [2024-10-28 18:16:36,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-28 18:16:36,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-28 18:16:36,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-28 18:16:36,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-28 18:16:36,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-28 18:16:36,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 06:16:36" (1/1) ... [2024-10-28 18:16:36,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d592054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:16:36, skipping insertion in model container [2024-10-28 18:16:36,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 06:16:36" (1/1) ... [2024-10-28 18:16:36,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-28 18:16:37,233 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_77-tricky_address4_racing.i[41323,41336] [2024-10-28 18:16:37,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-28 18:16:37,324 INFO L200 MainTranslator]: Completed pre-run [2024-10-28 18:16:37,381 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_77-tricky_address4_racing.i[41323,41336] [2024-10-28 18:16:37,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-28 18:16:37,464 INFO L204 MainTranslator]: Completed translation [2024-10-28 18:16:37,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:16:37 WrapperNode [2024-10-28 18:16:37,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-28 18:16:37,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-28 18:16:37,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-28 18:16:37,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-28 18:16:37,474 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:16:37" (1/1) ... [2024-10-28 18:16:37,499 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:16:37" (1/1) ... [2024-10-28 18:16:37,541 INFO L138 Inliner]: procedures = 271, calls = 109, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 275 [2024-10-28 18:16:37,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-28 18:16:37,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-28 18:16:37,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-28 18:16:37,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-28 18:16:37,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:16:37" (1/1) ... [2024-10-28 18:16:37,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:16:37" (1/1) ... [2024-10-28 18:16:37,561 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:16:37" (1/1) ... [2024-10-28 18:16:37,564 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:16:37" (1/1) ... [2024-10-28 18:16:37,577 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:16:37" (1/1) ... [2024-10-28 18:16:37,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:16:37" (1/1) ... [2024-10-28 18:16:37,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:16:37" (1/1) ... [2024-10-28 18:16:37,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:16:37" (1/1) ... [2024-10-28 18:16:37,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-28 18:16:37,601 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-28 18:16:37,601 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-28 18:16:37,602 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-28 18:16:37,603 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:16:37" (1/1) ... [2024-10-28 18:16:37,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-28 18:16:37,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:16:37,647 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:16:37,662 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:16:37,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-28 18:16:37,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-28 18:16:37,715 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-28 18:16:37,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-28 18:16:37,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-28 18:16:37,716 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-28 18:16:37,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-28 18:16:37,716 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-28 18:16:37,716 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-28 18:16:37,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-28 18:16:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-28 18:16:37,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-28 18:16:37,720 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:16:37,905 INFO L238 CfgBuilder]: Building ICFG [2024-10-28 18:16:37,907 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-28 18:16:38,288 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-28 18:16:38,288 INFO L287 CfgBuilder]: Performing block encoding [2024-10-28 18:16:38,878 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-28 18:16:38,878 INFO L316 CfgBuilder]: Removed 23 assume(true) statements. [2024-10-28 18:16:38,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 06:16:38 BoogieIcfgContainer [2024-10-28 18:16:38,879 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-28 18:16:38,881 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-28 18:16:38,882 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-28 18:16:38,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-28 18:16:38,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 06:16:36" (1/3) ... [2024-10-28 18:16:38,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c51762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 06:16:38, skipping insertion in model container [2024-10-28 18:16:38,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 06:16:37" (2/3) ... [2024-10-28 18:16:38,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c51762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 06:16:38, skipping insertion in model container [2024-10-28 18:16:38,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 06:16:38" (3/3) ... [2024-10-28 18:16:38,890 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_77-tricky_address4_racing.i [2024-10-28 18:16:38,908 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-28 18:16:38,908 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-28 18:16:38,909 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-28 18:16:38,954 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-28 18:16:39,011 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:16:39,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-28 18:16:39,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:16:39,014 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:16:39,016 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:16:39,047 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 18:16:39,059 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-28 18:16:39,066 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;@796e2f0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:16:39,069 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-28 18:16:39,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:16:39,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:16:39,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1597334964, now seen corresponding path program 1 times [2024-10-28 18:16:39,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:16:39,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917257255] [2024-10-28 18:16:39,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:16:39,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:16:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:16:40,193 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:16:40,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:16:40,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917257255] [2024-10-28 18:16:40,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917257255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:16:40,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:16:40,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-28 18:16:40,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086076421] [2024-10-28 18:16:40,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:16:40,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:16:40,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:16:40,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:16:40,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:16:40,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:16:40,230 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:16:40,231 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:16:40,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:16:42,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:16:42,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-28 18:16:42,808 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:16:42,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:16:42,809 INFO L85 PathProgramCache]: Analyzing trace with hash -253430217, now seen corresponding path program 1 times [2024-10-28 18:16:42,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:16:42,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367410109] [2024-10-28 18:16:42,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:16:42,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:16:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:16:42,933 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:16:42,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:16:42,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367410109] [2024-10-28 18:16:42,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367410109] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:16:42,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651052367] [2024-10-28 18:16:42,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:16:42,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:16:42,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:16:42,954 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:16:42,956 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:16:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:16:43,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-28 18:16:43,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:16:43,074 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:16:43,074 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:16:43,090 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:16:43,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651052367] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:16:43,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:16:43,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-28 18:16:43,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157235895] [2024-10-28 18:16:43,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:16:43,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-28 18:16:43,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:16:43,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-28 18:16:43,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-28 18:16:43,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:16:43,097 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:16:43,098 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:16:43,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:16:43,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:16:43,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:16:43,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:16:43,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-28 18:16:43,431 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:16:43,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:16:43,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:16:43,432 INFO L85 PathProgramCache]: Analyzing trace with hash -653837851, now seen corresponding path program 2 times [2024-10-28 18:16:43,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:16:43,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696711274] [2024-10-28 18:16:43,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:16:43,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:16:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:16:43,586 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:16:43,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:16:43,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696711274] [2024-10-28 18:16:43,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696711274] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:16:43,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035440271] [2024-10-28 18:16:43,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 18:16:43,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:16:43,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:16:43,590 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:16:43,591 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:16:43,686 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 18:16:43,687 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:16:43,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-28 18:16:43,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:16:43,703 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:16:43,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:16:43,812 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:16:43,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035440271] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:16:43,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:16:43,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-28 18:16:43,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942189142] [2024-10-28 18:16:43,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:16:43,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 18:16:43,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:16:43,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 18:16:43,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-28 18:16:43,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:16:43,815 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:16:43,815 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:16:43,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:16:43,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:16:43,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:16:43,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:16:43,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:16:43,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:16:43,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-28 18:16:44,154 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:16:44,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:16:44,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:16:44,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2130085723, now seen corresponding path program 3 times [2024-10-28 18:16:44,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:16:44,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500614302] [2024-10-28 18:16:44,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:16:44,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:16:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:16:45,776 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:16:45,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:16:45,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500614302] [2024-10-28 18:16:45,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500614302] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:16:45,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692960371] [2024-10-28 18:16:45,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-28 18:16:45,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:16:45,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:16:45,781 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:16:45,782 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:16:45,893 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-28 18:16:45,894 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:16:45,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-28 18:16:45,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:16:46,337 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:16:46,338 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:16:46,411 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 72 treesize of output 51 [2024-10-28 18:16:46,768 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 72 treesize of output 51 [2024-10-28 18:16:46,942 INFO L349 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2024-10-28 18:16:46,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 9 case distinctions, treesize of input 92 treesize of output 47 [2024-10-28 18:16:46,964 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:16:46,964 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:16:47,023 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_132 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_132) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread1of1ForFork0_~i~0#1| 28))))) is different from false [2024-10-28 18:16:47,043 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_132 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_132) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28)) 0)) is different from false [2024-10-28 18:16:47,327 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2024-10-28 18:16:47,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692960371] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:16:47,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:16:47,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-10-28 18:16:47,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621532732] [2024-10-28 18:16:47,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:16:47,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-28 18:16:47,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:16:47,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-28 18:16:47,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=208, Unknown=12, NotChecked=62, Total=342 [2024-10-28 18:16:47,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:16:47,330 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:16:47,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 18 states have internal predecessors, (48), 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:16:47,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:16:47,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:16:47,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:16:47,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:16:48,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:16:48,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:16:48,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:16:48,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 18:16:48,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-28 18:16:48,789 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:16:48,790 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:16:48,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:16:48,791 INFO L85 PathProgramCache]: Analyzing trace with hash 696865724, now seen corresponding path program 1 times [2024-10-28 18:16:48,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:16:48,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569411950] [2024-10-28 18:16:48,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:16:48,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:16:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:16:48,871 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:16:48,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:16:48,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569411950] [2024-10-28 18:16:48,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569411950] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:16:48,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090502017] [2024-10-28 18:16:48,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:16:48,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:16:48,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:16:48,874 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:16:48,876 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:16:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:16:49,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-28 18:16:49,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:16:49,060 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:16:49,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:16:49,086 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:16:49,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090502017] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:16:49,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:16:49,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-28 18:16:49,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592958138] [2024-10-28 18:16:49,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:16:49,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-28 18:16:49,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:16:49,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-28 18:16:49,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-28 18:16:49,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:16:49,090 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:16:49,090 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:16:49,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:16:49,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:16:49,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:16:49,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 18:16:49,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:16:49,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:16:49,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:16:49,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:16:49,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 18:16:49,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-28 18:16:49,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-28 18:16:49,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-28 18:16:49,646 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:16:49,652 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2024-10-28 18:16:49,654 INFO L317 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2024-10-28 18:16:49,658 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:16:49,659 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 18:16:49,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-28 18:16:49,660 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;@796e2f0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:16:49,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-28 18:16:49,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:16:49,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:16:49,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1576208778, now seen corresponding path program 1 times [2024-10-28 18:16:49,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:16:49,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723948889] [2024-10-28 18:16:49,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:16:49,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:16:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:16:49,704 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:16:49,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:16:49,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723948889] [2024-10-28 18:16:49,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723948889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:16:49,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:16:49,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-28 18:16:49,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476831200] [2024-10-28 18:16:49,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:16:49,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:16:49,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:16:49,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:16:49,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:16:49,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:16:49,707 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:16:49,707 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:16:49,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:16:49,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:16:49,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-28 18:16:49,737 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:16:49,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:16:49,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1434973515, now seen corresponding path program 1 times [2024-10-28 18:16:49,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:16:49,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186917262] [2024-10-28 18:16:49,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:16:49,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:16:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:16:49,796 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:16:49,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:16:49,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186917262] [2024-10-28 18:16:49,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186917262] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:16:49,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580342474] [2024-10-28 18:16:49,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:16:49,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:16:49,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:16:49,804 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:16:49,805 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:16:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:16:49,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-28 18:16:49,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:16:49,901 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:16:49,902 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:16:49,913 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:16:49,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580342474] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:16:49,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:16:49,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-28 18:16:49,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286296577] [2024-10-28 18:16:49,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:16:49,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-28 18:16:49,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:16:49,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-28 18:16:49,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-28 18:16:49,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:16:49,917 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:16:49,917 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:16:49,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:16:49,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:16:49,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:16:49,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:16:49,975 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:16:50,158 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:16:50,158 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:16:50,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:16:50,159 INFO L85 PathProgramCache]: Analyzing trace with hash 2060140537, now seen corresponding path program 2 times [2024-10-28 18:16:50,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:16:50,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361303236] [2024-10-28 18:16:50,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:16:50,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:16:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:16:50,249 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:16:50,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:16:50,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361303236] [2024-10-28 18:16:50,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361303236] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:16:50,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670787129] [2024-10-28 18:16:50,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 18:16:50,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:16:50,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:16:50,253 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:16:50,254 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:16:50,352 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 18:16:50,353 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:16:50,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-28 18:16:50,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:16:50,369 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:16:50,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:16:50,407 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:16:50,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670787129] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:16:50,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:16:50,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-28 18:16:50,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949903043] [2024-10-28 18:16:50,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:16:50,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 18:16:50,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:16:50,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 18:16:50,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-28 18:16:50,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:16:50,409 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:16:50,409 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:16:50,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:16:50,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:16:50,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:16:50,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:16:50,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:16:50,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:16:50,469 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:16:50,656 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:16:50,657 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:16:50,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:16:50,657 INFO L85 PathProgramCache]: Analyzing trace with hash 893050553, now seen corresponding path program 3 times [2024-10-28 18:16:50,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:16:50,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074132819] [2024-10-28 18:16:50,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:16:50,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:16:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 18:16:50,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-28 18:16:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 18:16:50,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-28 18:16:50,741 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-28 18:16:50,741 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-28 18:16:50,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-28 18:16:50,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-28 18:16:50,744 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-28 18:16:50,745 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2024-10-28 18:16:50,746 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-28 18:16:50,746 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-28 18:16:50,773 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-28 18:16:50,776 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:16:50,777 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 18:16:50,777 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-10-28 18:16:50,777 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;@796e2f0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:16:50,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-28 18:16:52,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:16:52,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:16:52,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1369585024, now seen corresponding path program 1 times [2024-10-28 18:16:52,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:16:52,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814932160] [2024-10-28 18:16:52,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:16:52,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:16:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:16:52,899 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:16:52,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:16:52,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814932160] [2024-10-28 18:16:52,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814932160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:16:52,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:16:52,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-28 18:16:52,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454791728] [2024-10-28 18:16:52,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:16:52,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:16:52,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:16:52,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:16:52,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:16:52,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:16:52,901 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:16:52,901 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:16:52,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:17:00,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:00,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-28 18:17:00,779 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:17:00,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:17:00,779 INFO L85 PathProgramCache]: Analyzing trace with hash -711646395, now seen corresponding path program 1 times [2024-10-28 18:17:00,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:17:00,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123519033] [2024-10-28 18:17:00,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:17:00,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:17:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:17:00,830 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:17:00,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:17:00,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123519033] [2024-10-28 18:17:00,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123519033] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:17:00,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167339171] [2024-10-28 18:17:00,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:17:00,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:17:00,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:17:00,833 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:17:00,834 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:17:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:17:00,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-28 18:17:00,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:17:00,964 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:17:00,965 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:17:00,980 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:17:00,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167339171] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:17:00,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:17:00,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-28 18:17:00,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900220657] [2024-10-28 18:17:00,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:17:00,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-28 18:17:00,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:17:00,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-28 18:17:00,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-28 18:17:00,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:17:00,982 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:17:00,982 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:17:00,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:00,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:17:01,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:01,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:17:01,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-28 18:17:01,973 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:17:01,973 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:17:01,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:17:01,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1487557995, now seen corresponding path program 2 times [2024-10-28 18:17:01,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:17:01,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899649672] [2024-10-28 18:17:01,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:17:01,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:17:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:17:02,086 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:17:02,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:17:02,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899649672] [2024-10-28 18:17:02,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899649672] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:17:02,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052648861] [2024-10-28 18:17:02,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 18:17:02,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:17:02,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:17:02,090 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:17:02,091 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:17:02,295 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 18:17:02,295 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:17:02,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-28 18:17:02,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:17:02,314 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:17:02,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:17:02,358 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:17:02,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052648861] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:17:02,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:17:02,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-28 18:17:02,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242620464] [2024-10-28 18:17:02,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:17:02,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 18:17:02,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:17:02,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 18:17:02,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-28 18:17:02,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:17:02,360 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:17:02,360 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:17:02,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:02,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:17:02,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:17:03,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:03,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:17:03,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:17:03,308 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:17:03,495 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:17:03,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:17:03,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:17:03,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1990875349, now seen corresponding path program 3 times [2024-10-28 18:17:03,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:17:03,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610791833] [2024-10-28 18:17:03,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:17:03,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:17:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:17:05,189 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:17:05,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:17:05,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610791833] [2024-10-28 18:17:05,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610791833] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:17:05,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13885093] [2024-10-28 18:17:05,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-28 18:17:05,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:17:05,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:17:05,193 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:17:05,194 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:17:05,332 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-28 18:17:05,332 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:17:05,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-28 18:17:05,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:17:05,717 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:17:05,718 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:17:05,773 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 72 treesize of output 51 [2024-10-28 18:17:06,037 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 72 treesize of output 51 [2024-10-28 18:17:06,244 INFO L349 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2024-10-28 18:17:06,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 9 case distinctions, treesize of input 92 treesize of output 47 [2024-10-28 18:17:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:17:06,258 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:17:06,291 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:17:06,312 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| 28)) 0)) is different from false [2024-10-28 18:17:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2024-10-28 18:17:06,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13885093] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:17:06,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:17:06,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-10-28 18:17:06,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092986747] [2024-10-28 18:17:06,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:17:06,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-28 18:17:06,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:17:06,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-28 18:17:06,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=209, Unknown=11, NotChecked=62, Total=342 [2024-10-28 18:17:06,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:17:06,658 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:17:06,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 18 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:17:06,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:06,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:17:06,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:17:06,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:17:09,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:09,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:17:09,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:17:09,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-28 18:17:09,593 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:17:09,780 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:17:09,781 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:17:09,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:17:09,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1403528533, now seen corresponding path program 1 times [2024-10-28 18:17:09,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:17:09,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44235959] [2024-10-28 18:17:09,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:17:09,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:17:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:17:09,896 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:17:09,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:17:09,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44235959] [2024-10-28 18:17:09,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44235959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:17:09,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:17:09,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-28 18:17:09,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044514137] [2024-10-28 18:17:09,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:17:09,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:17:09,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:17:09,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:17:09,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:17:09,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:17:09,899 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:17:09,899 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:17:09,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:09,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:17:09,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:17:09,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-28 18:17:09,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:17:11,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:11,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:17:11,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:17:11,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-28 18:17:11,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:11,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-28 18:17:11,576 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:17:11,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:17:11,576 INFO L85 PathProgramCache]: Analyzing trace with hash 490101831, now seen corresponding path program 1 times [2024-10-28 18:17:11,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:17:11,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070542697] [2024-10-28 18:17:11,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:17:11,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:17:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:17:17,844 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:17:17,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:17:17,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070542697] [2024-10-28 18:17:17,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070542697] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:17:17,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45171917] [2024-10-28 18:17:17,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:17:17,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:17:17,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:17:17,846 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:17:17,847 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:17:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:17:18,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-10-28 18:17:18,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:17:18,663 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:17:18,663 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:17:18,729 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 72 treesize of output 51 [2024-10-28 18:17:18,926 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:17:19,212 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 72 treesize of output 51 [2024-10-28 18:17:19,384 INFO L349 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2024-10-28 18:17:19,384 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 13 [2024-10-28 18:17:19,622 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 72 treesize of output 51 [2024-10-28 18:17:20,020 INFO L349 Elim1Store]: treesize reduction 126, result has 57.7 percent of original size [2024-10-28 18:17:20,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 85 treesize of output 210 [2024-10-28 18:17:21,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:17:21,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 9 case distinctions, treesize of input 469 treesize of output 313 [2024-10-28 18:17:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 3 proven. 53 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-28 18:17:22,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:17:22,562 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int 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| (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2024-10-28 18:17:22,833 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:17:22,999 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_27| Int) (v_ArrVal_562 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_26| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_27| 0) (= 0 (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_27| 28) |c_~#a~0.offset| 28))) (= |v_t_funThread2of2ForFork0_~i~0#1_26| |v_t_funThread1of2ForFork0_~i~0#1_27|) (< 8 |v_t_funThread1of2ForFork0_~i~0#1_27|))) is different from false [2024-10-28 18:17:23,007 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_27| Int) (v_ArrVal_562 (Array Int Int))) (or (< |v_t_funThread1of2ForFork0_~i~0#1_27| 0) (= 0 (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_27| 28) |c_~#a~0.offset| 28))) (< 8 |v_t_funThread1of2ForFork0_~i~0#1_27|))) is different from false [2024-10-28 18:17:23,510 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:17:23,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45171917] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:17:23,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:17:23,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 13] total 39 [2024-10-28 18:17:23,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641198598] [2024-10-28 18:17:23,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:17:23,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-28 18:17:23,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:17:23,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-28 18:17:23,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1178, Unknown=18, NotChecked=216, Total=1560 [2024-10-28 18:17:23,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:17:23,513 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:17:23,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.2) internal successors, (88), 39 states have internal predecessors, (88), 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:17:23,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:23,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:17:23,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:17:23,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-28 18:17:23,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:23,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:17:31,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:31,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:17:31,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:17:31,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-28 18:17:31,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:31,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-28 18:17:31,753 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:17:31,940 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:17:31,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:17:31,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:17:31,941 INFO L85 PathProgramCache]: Analyzing trace with hash 894186409, now seen corresponding path program 1 times [2024-10-28 18:17:31,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:17:31,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085970497] [2024-10-28 18:17:31,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:17:31,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:17:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:17:32,030 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:17:32,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:17:32,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085970497] [2024-10-28 18:17:32,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085970497] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:17:32,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460874872] [2024-10-28 18:17:32,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:17:32,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:17:32,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:17:32,033 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:17:32,034 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:17:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:17:32,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-28 18:17:32,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:17:32,214 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:17:32,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:17:32,253 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:17:32,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460874872] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:17:32,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:17:32,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-28 18:17:32,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385629558] [2024-10-28 18:17:32,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:17:32,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-28 18:17:32,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:17:32,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-28 18:17:32,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-28 18:17:32,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:17:32,256 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:17:32,256 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:17:32,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:32,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:17:32,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:17:32,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-28 18:17:32,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:32,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-10-28 18:17:32,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:17:34,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:34,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:17:34,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:17:34,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-28 18:17:34,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:34,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-28 18:17:34,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-28 18:17:34,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-28 18:17:34,497 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:17:34,498 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:17:34,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:17:34,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1536729215, now seen corresponding path program 1 times [2024-10-28 18:17:34,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:17:34,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155299248] [2024-10-28 18:17:34,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:17:34,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:17:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:17:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-28 18:17:36,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:17:36,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155299248] [2024-10-28 18:17:36,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155299248] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:17:36,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96904260] [2024-10-28 18:17:36,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:17:36,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:17:36,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:17:36,685 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:17:36,686 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:17:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:17:36,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-10-28 18:17:36,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:17:37,566 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:17:37,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-28 18:17:37,634 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 72 treesize of output 51 [2024-10-28 18:17:37,799 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 72 treesize of output 51 [2024-10-28 18:17:37,983 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:17:38,286 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 72 treesize of output 51 [2024-10-28 18:17:38,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:17:38,579 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:17:38,799 INFO L349 Elim1Store]: treesize reduction 126, result has 57.7 percent of original size [2024-10-28 18:17:38,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 85 treesize of output 210 [2024-10-28 18:17:39,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:17:39,202 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:17:39,557 INFO L349 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2024-10-28 18:17:39,558 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 13 [2024-10-28 18:17:40,755 INFO L349 Elim1Store]: treesize reduction 126, result has 57.7 percent of original size [2024-10-28 18:17:40,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 229 treesize of output 318 [2024-10-28 18:17:41,222 INFO L349 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2024-10-28 18:17:41,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 9 case distinctions, treesize of input 92 treesize of output 47 [2024-10-28 18:17:41,249 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 5 proven. 54 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 18:17:41,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:17:41,570 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_770 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_770) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) 0))) (forall ((v_ArrVal_767 (Array Int Int))) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767) |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (select .cse0 .cse1))) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset| 28)) 0))) is different from false [2024-10-28 18:17:41,589 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_767 (Array Int Int))) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767) |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28))) (store .cse0 .cse1 (select .cse0 .cse1))) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset| 28)) 0)) (forall ((v_ArrVal_770 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_770) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) 0)))) is different from false [2024-10-28 18:17:41,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:17:41,594 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:17:41,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:17:41,599 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:17:41,602 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:17:41,674 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset| 28))) (let ((.cse0 (forall ((v_ArrVal_767 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int)) (= (select (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767) |c_~#a~0.base|)) (.cse6 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28) 28))) (store .cse5 .cse6 (select .cse5 .cse6))) .cse4) 0)))) (and (or .cse0 (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (or (not (= |c_~#__global_lock~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) .cse0) (forall ((v_ArrVal_767 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int)) (let ((.cse3 (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28))) (or (= (select (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767) |c_~#a~0.base|)) (.cse2 (+ |c_~#a~0.offset| .cse3 28))) (store .cse1 .cse2 (select .cse1 .cse2))) .cse4) 0) (= (+ |c_~#a~0.offset| .cse3) |c_t_funThread1of2ForFork0_~p~0#1.offset|))))))) is different from false [2024-10-28 18:17:41,760 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of2ForFork0_~i~0#1_34| Int)) (or (< 8 |v_t_funThread1of2ForFork0_~i~0#1_34|) (< |v_t_funThread1of2ForFork0_~i~0#1_34| 0) (forall ((v_ArrVal_767 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_33| 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_34| 28) |c_~#a~0.offset| 28)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_33| |v_t_funThread1of2ForFork0_~i~0#1_34|))))) (or (forall ((|v_t_funThread1of2ForFork0_~i~0#1_34| Int) (v_ArrVal_767 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int)) (or (< 8 |v_t_funThread1of2ForFork0_~i~0#1_34|) (< |v_t_funThread1of2ForFork0_~i~0#1_34| 0) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767) |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28) 28))) (store .cse0 .cse1 (select .cse0 .cse1))) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_34| 28) |c_~#a~0.offset| 28)) 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2024-10-28 18:17:41,785 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of2ForFork0_~i~0#1_34| Int) (v_ArrVal_767 (Array Int 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_34| 28) |c_~#a~0.offset| 28)) 0) (< 8 |v_t_funThread1of2ForFork0_~i~0#1_34|) (< |v_t_funThread1of2ForFork0_~i~0#1_34| 0))) (or (forall ((|v_t_funThread1of2ForFork0_~i~0#1_34| Int) (v_ArrVal_767 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int)) (or (< 8 |v_t_funThread1of2ForFork0_~i~0#1_34|) (< |v_t_funThread1of2ForFork0_~i~0#1_34| 0) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767) |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28) 28))) (store .cse0 .cse1 (select .cse0 .cse1))) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_34| 28) |c_~#a~0.offset| 28)) 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2024-10-28 18:17:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 7 not checked. [2024-10-28 18:17:42,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96904260] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:17:42,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:17:42,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22, 15] total 43 [2024-10-28 18:17:42,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369404075] [2024-10-28 18:17:42,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:17:42,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-28 18:17:42,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:17:42,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-28 18:17:42,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1305, Unknown=16, NotChecked=390, Total=1892 [2024-10-28 18:17:42,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:17:42,209 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:17:42,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.8181818181818183) internal successors, (124), 43 states have internal predecessors, (124), 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:17:42,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:42,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:17:42,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:17:42,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-28 18:17:42,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:42,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-10-28 18:17:42,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-28 18:17:42,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:17:45,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:45,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:17:45,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:17:45,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-28 18:17:45,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:45,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-28 18:17:45,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-28 18:17:45,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-28 18:17:45,415 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:17:45,598 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:17:45,598 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:17:45,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:17:45,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1662140169, now seen corresponding path program 2 times [2024-10-28 18:17:45,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:17:45,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767975486] [2024-10-28 18:17:45,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:17:45,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:17:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:17:47,336 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-28 18:17:47,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:17:47,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767975486] [2024-10-28 18:17:47,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767975486] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:17:47,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395178908] [2024-10-28 18:17:47,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 18:17:47,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:17:47,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:17:47,339 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:17:47,340 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:17:47,560 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 18:17:47,561 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:17:47,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-10-28 18:17:47,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:17:48,169 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:17:48,169 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:17:48,226 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 72 treesize of output 51 [2024-10-28 18:17:48,390 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 72 treesize of output 51 [2024-10-28 18:17:48,554 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:17:48,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:17:48,921 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:17:49,113 INFO L349 Elim1Store]: treesize reduction 126, result has 57.7 percent of original size [2024-10-28 18:17:49,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 85 treesize of output 210 [2024-10-28 18:17:49,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:17:49,446 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:17:49,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:17:49,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 20 treesize of output 15 [2024-10-28 18:17:50,125 INFO L349 Elim1Store]: treesize reduction 126, result has 57.7 percent of original size [2024-10-28 18:17:50,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 229 treesize of output 318 [2024-10-28 18:17:52,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 72 treesize of output 51 [2024-10-28 18:17:54,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:17:54,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-28 18:17:56,734 INFO L349 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2024-10-28 18:17:56,735 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 13 [2024-10-28 18:17:57,152 INFO L349 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2024-10-28 18:17:57,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 9 case distinctions, treesize of input 92 treesize of output 47 [2024-10-28 18:17:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 5 proven. 54 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 18:17:57,186 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:17:57,404 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_877 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_877) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) 0))) (forall ((v_ArrVal_876 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_876) |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset| 28)) 0))) is different from false [2024-10-28 18:17:57,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:17:57,500 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:17:57,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:17:57,506 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:17:57,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-10-28 18:17:57,612 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_876 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_38| Int)) (or (< 8 |v_t_funThread1of2ForFork0_~i~0#1_38|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_876) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_38| 28) 28)) 0) (< |v_t_funThread1of2ForFork0_~i~0#1_38| 0))) is different from false [2024-10-28 18:17:58,001 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:17:58,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395178908] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:17:58,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:17:58,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 22, 12] total 39 [2024-10-28 18:17:58,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554207130] [2024-10-28 18:17:58,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:17:58,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-28 18:17:58,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:17:58,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-28 18:17:58,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1186, Unknown=21, NotChecked=146, Total=1560 [2024-10-28 18:17:58,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:17:58,004 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:17:58,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.1) internal successors, (124), 39 states have internal predecessors, (124), 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:17:58,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:58,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:17:58,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:17:58,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-28 18:17:58,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:17:58,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-10-28 18:17:58,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-28 18:17:58,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-10-28 18:17:58,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:18:01,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 18:18:03,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 18:18:05,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 18:18:10,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 18:18:12,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 18:18:14,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 18:18:17,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 18:18:19,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 18:18:22,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 18:18:24,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 18:18:26,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 18:18:28,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 18:18:30,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 18:18:30,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:18:30,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:18:30,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:18:30,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-28 18:18:30,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:18:30,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-28 18:18:30,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-28 18:18:30,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-28 18:18:30,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-28 18:18:30,429 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-28 18:18:30,442 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:18:30,629 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:18:30,631 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2024-10-28 18:18:30,631 INFO L317 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was SAFE (1/3) [2024-10-28 18:18:30,634 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:18:30,635 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 18:18:30,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-28 18:18:30,635 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;@796e2f0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:18:30,636 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-28 18:18:30,641 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:18:30,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:18:30,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1727584400, now seen corresponding path program 1 times [2024-10-28 18:18:30,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:18:30,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049014750] [2024-10-28 18:18:30,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:18:30,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:18:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:18:30,679 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:18:30,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:18:30,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049014750] [2024-10-28 18:18:30,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049014750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:18:30,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:18:30,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-28 18:18:30,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023683521] [2024-10-28 18:18:30,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:18:30,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:18:30,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:18:30,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:18:30,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:18:30,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:18:30,682 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:18:30,682 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:18:30,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:18:30,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:18:30,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-28 18:18:30,725 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:18:30,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:18:30,726 INFO L85 PathProgramCache]: Analyzing trace with hash -716273158, now seen corresponding path program 1 times [2024-10-28 18:18:30,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:18:30,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799561693] [2024-10-28 18:18:30,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:18:30,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:18:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:18:30,762 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:18:30,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:18:30,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799561693] [2024-10-28 18:18:30,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799561693] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:18:30,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612264460] [2024-10-28 18:18:30,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:18:30,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:18:30,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:18:30,765 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:18:30,767 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:18:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:18:30,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-28 18:18:30,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:18:30,884 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:18:30,885 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:18:30,894 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:18:30,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612264460] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:18:30,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:18:30,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-28 18:18:30,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046100208] [2024-10-28 18:18:30,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:18:30,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-28 18:18:30,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:18:30,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-28 18:18:30,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-28 18:18:30,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:18:30,895 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:18:30,895 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:18:30,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:18:30,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:18:30,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:18:30,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:18:30,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-28 18:18:31,134 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:18:31,135 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:18:31,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:18:31,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1260413804, now seen corresponding path program 2 times [2024-10-28 18:18:31,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:18:31,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612056018] [2024-10-28 18:18:31,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:18:31,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:18:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:18:31,197 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:18:31,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:18:31,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612056018] [2024-10-28 18:18:31,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612056018] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:18:31,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671055145] [2024-10-28 18:18:31,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 18:18:31,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:18:31,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:18:31,200 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:18:31,202 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:18:31,330 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 18:18:31,330 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:18:31,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-28 18:18:31,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:18:31,342 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:18:31,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:18:31,385 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:18:31,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671055145] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:18:31,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:18:31,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-28 18:18:31,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182302001] [2024-10-28 18:18:31,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:18:31,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 18:18:31,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:18:31,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 18:18:31,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-28 18:18:31,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:18:31,387 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:18:31,387 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:18:31,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:18:31,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:18:31,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:18:31,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:18:31,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:18:31,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:18:31,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-28 18:18:31,629 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:18:31,629 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:18:31,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:18:31,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1717665068, now seen corresponding path program 3 times [2024-10-28 18:18:31,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:18:31,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22477203] [2024-10-28 18:18:31,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:18:31,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:18:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 18:18:31,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-28 18:18:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 18:18:31,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-28 18:18:31,711 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-28 18:18:31,711 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-28 18:18:31,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-28 18:18:31,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-28 18:18:31,717 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-28 18:18:31,717 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/3) [2024-10-28 18:18:31,717 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-28 18:18:31,717 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-28 18:18:31,754 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-28 18:18:31,757 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:18:31,757 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 18:18:31,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-28 18:18:31,758 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;@796e2f0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:18:31,758 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-28 18:18:32,448 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:18:32,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:18:32,449 INFO L85 PathProgramCache]: Analyzing trace with hash 876181594, now seen corresponding path program 1 times [2024-10-28 18:18:32,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:18:32,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617013576] [2024-10-28 18:18:32,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:18:32,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:18:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:18:32,479 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:18:32,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:18:32,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617013576] [2024-10-28 18:18:32,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617013576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:18:32,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:18:32,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-28 18:18:32,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005846416] [2024-10-28 18:18:32,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:18:32,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:18:32,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:18:32,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:18:32,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:18:32,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:18:32,481 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:18:32,481 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:18:32,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:18:33,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:18:33,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-28 18:18:33,214 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:18:33,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:18:33,214 INFO L85 PathProgramCache]: Analyzing trace with hash 829167225, now seen corresponding path program 1 times [2024-10-28 18:18:33,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:18:33,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003358775] [2024-10-28 18:18:33,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:18:33,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:18:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:18:33,257 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:18:33,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:18:33,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003358775] [2024-10-28 18:18:33,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003358775] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:18:33,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920325916] [2024-10-28 18:18:33,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:18:33,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:18:33,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:18:33,260 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:18:33,262 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:18:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:18:33,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-28 18:18:33,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:18:33,423 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:18:33,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:18:33,436 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:18:33,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920325916] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:18:33,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:18:33,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-28 18:18:33,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555186624] [2024-10-28 18:18:33,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:18:33,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-28 18:18:33,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:18:33,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-28 18:18:33,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-28 18:18:33,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:18:33,437 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:18:33,437 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:18:33,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:18:33,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:18:33,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:18:33,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:18:33,508 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:18:33,690 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:18:33,691 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:18:33,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:18:33,691 INFO L85 PathProgramCache]: Analyzing trace with hash -780346266, now seen corresponding path program 2 times [2024-10-28 18:18:33,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:18:33,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612474936] [2024-10-28 18:18:33,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:18:33,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:18:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:18:33,771 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:18:33,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:18:33,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612474936] [2024-10-28 18:18:33,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612474936] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:18:33,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3072434] [2024-10-28 18:18:33,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 18:18:33,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:18:33,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:18:33,774 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:18:33,776 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:18:33,922 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 18:18:33,922 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:18:33,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-28 18:18:33,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:18:33,937 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:18:33,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:18:33,976 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:18:33,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3072434] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:18:33,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:18:33,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-28 18:18:33,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979573742] [2024-10-28 18:18:33,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:18:33,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 18:18:33,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:18:33,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 18:18:33,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-28 18:18:33,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:18:33,978 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:18:33,978 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:18:33,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:18:33,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:18:33,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:18:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:18:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:18:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:18:34,065 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:18:34,251 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:18:34,252 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 18:18:34,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:18:34,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1244894086, now seen corresponding path program 3 times [2024-10-28 18:18:34,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:18:34,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830075413] [2024-10-28 18:18:34,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:18:34,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:18:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 18:18:34,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-28 18:18:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 18:18:34,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-28 18:18:34,340 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-28 18:18:34,340 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-28 18:18:34,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-28 18:18:34,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-28 18:18:34,342 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-28 18:18:34,342 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/4) [2024-10-28 18:18:34,342 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-28 18:18:34,342 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-28 18:18:34,380 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-28 18:18:34,383 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:18:34,384 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 18:18:34,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread4of4ForFork0 ======== [2024-10-28 18:18:34,385 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;@796e2f0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 18:18:34,385 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-28 18:18:35,736 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:18:35,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:18:35,737 INFO L85 PathProgramCache]: Analyzing trace with hash 954032638, now seen corresponding path program 1 times [2024-10-28 18:18:35,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:18:35,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582980431] [2024-10-28 18:18:35,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:18:35,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:18:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:18:35,778 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:18:35,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:18:35,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582980431] [2024-10-28 18:18:35,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582980431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:18:35,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:18:35,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-28 18:18:35,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052975130] [2024-10-28 18:18:35,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:18:35,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:18:35,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:18:35,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:18:35,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:18:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:18:35,780 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:18:35,781 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:18:35,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:19:01,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:19:01,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-28 18:19:01,316 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:19:01,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:19:01,317 INFO L85 PathProgramCache]: Analyzing trace with hash 538430661, now seen corresponding path program 1 times [2024-10-28 18:19:01,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:19:01,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497166693] [2024-10-28 18:19:01,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:19:01,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:19:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:19:01,381 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:19:01,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:19:01,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497166693] [2024-10-28 18:19:01,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497166693] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:19:01,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113289286] [2024-10-28 18:19:01,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:19:01,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:19:01,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:19:01,384 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:19:01,385 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:19:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:19:01,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-28 18:19:01,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:19:01,602 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:19:01,602 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:19:01,620 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:19:01,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113289286] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:19:01,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:19:01,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-28 18:19:01,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534797520] [2024-10-28 18:19:01,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:19:01,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-28 18:19:01,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:19:01,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-28 18:19:01,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-28 18:19:01,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:19:01,622 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:19:01,622 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:19:01,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:19:01,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:19:11,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:19:11,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:19:11,064 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:19:11,251 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:19:11,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:19:11,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:19:11,252 INFO L85 PathProgramCache]: Analyzing trace with hash -364500710, now seen corresponding path program 2 times [2024-10-28 18:19:11,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:19:11,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199426533] [2024-10-28 18:19:11,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:19:11,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:19:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:19:11,348 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:19:11,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:19:11,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199426533] [2024-10-28 18:19:11,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199426533] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:19:11,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207426087] [2024-10-28 18:19:11,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 18:19:11,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:19:11,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:19:11,351 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:19:11,353 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:19:11,568 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 18:19:11,569 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:19:11,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-28 18:19:11,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:19:11,584 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:19:11,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:19:11,631 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:19:11,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207426087] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:19:11,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:19:11,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-28 18:19:11,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080959377] [2024-10-28 18:19:11,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:19:11,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 18:19:11,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:19:11,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 18:19:11,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-28 18:19:11,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:19:11,634 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:19:11,635 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:19:11,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:19:11,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:19:11,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:19:21,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:19:21,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:19:21,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:19:21,303 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:19:21,490 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:19:21,490 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:19:21,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:19:21,491 INFO L85 PathProgramCache]: Analyzing trace with hash 817625402, now seen corresponding path program 3 times [2024-10-28 18:19:21,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:19:21,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116208703] [2024-10-28 18:19:21,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:19:21,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:19:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:19:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:19:38,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:19:38,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116208703] [2024-10-28 18:19:38,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116208703] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:19:38,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696224032] [2024-10-28 18:19:38,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-28 18:19:38,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:19:38,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:19:38,523 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:19:38,525 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:19:40,367 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-28 18:19:40,368 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 18:19:40,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-10-28 18:19:40,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:19:40,902 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:19:41,043 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 18:19:41,043 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:19:41,144 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 72 treesize of output 51 [2024-10-28 18:19:41,361 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-10-28 18:19:41,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 29 [2024-10-28 18:19:41,945 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 72 treesize of output 51 [2024-10-28 18:19:42,226 INFO L349 Elim1Store]: treesize reduction 36, result has 46.3 percent of original size [2024-10-28 18:19:42,226 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 38 treesize of output 52 [2024-10-28 18:19:42,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 72 treesize of output 51 [2024-10-28 18:19:42,933 INFO L349 Elim1Store]: treesize reduction 68, result has 42.4 percent of original size [2024-10-28 18:19:42,933 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 6 case distinctions, treesize of input 52 treesize of output 77 [2024-10-28 18:19:43,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:19:43,304 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 59 treesize of output 48 [2024-10-28 18:19:43,546 INFO L349 Elim1Store]: treesize reduction 126, result has 57.7 percent of original size [2024-10-28 18:19:43,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 85 treesize of output 210 [2024-10-28 18:19:43,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:19:43,917 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 59 treesize of output 48 [2024-10-28 18:19:45,017 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 216 treesize of output 177 [2024-10-28 18:19:45,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 18:19:45,760 INFO L349 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2024-10-28 18:19:45,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 62 treesize of output 68 [2024-10-28 18:19:46,686 INFO L349 Elim1Store]: treesize reduction 162, result has 38.2 percent of original size [2024-10-28 18:19:46,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 227 treesize of output 235 [2024-10-28 18:19:49,801 INFO L349 Elim1Store]: treesize reduction 126, result has 57.7 percent of original size [2024-10-28 18:19:49,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 390 treesize of output 375 [2024-10-28 18:20:53,720 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 3741 treesize of output 2858 [2024-10-28 18:21:16,064 INFO L349 Elim1Store]: treesize reduction 162, result has 38.2 percent of original size [2024-10-28 18:21:16,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 3752 treesize of output 2072 [2024-10-28 18:21:54,555 INFO L349 Elim1Store]: treesize reduction 126, result has 57.7 percent of original size [2024-10-28 18:21:54,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 1502 treesize of output 971 [2024-10-28 18:25:14,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:25:14,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 9 case distinctions, treesize of input 12148 treesize of output 6532 [2024-10-28 18:25:36,422 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 53 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-28 18:25:36,422 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:25:36,772 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1607 Int) (v_ArrVal_1605 (Array Int Int))) (= (select (let ((.cse0 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1605) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)) v_ArrVal_1607)) (.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:25:36,799 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1607 Int) (v_ArrVal_1605 (Array Int Int))) (= (select (let ((.cse0 (let ((.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse2 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1605) |c_~#a~0.base|) .cse3 v_ArrVal_1607))) (.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:25:36,838 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1607 Int) (v_ArrVal_1602 Int) (v_ArrVal_1605 (Array Int Int))) (= (select (let ((.cse0 (let ((.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse2 (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)) v_ArrVal_1602))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1605) |c_~#a~0.base|) .cse3 v_ArrVal_1607))) (.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:25:36,856 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1607 Int) (v_ArrVal_1602 Int) (v_ArrVal_1605 (Array Int Int))) (= (select (let ((.cse0 (let ((.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse2 (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)) v_ArrVal_1602))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1605) |c_~#a~0.base|) .cse3 v_ArrVal_1607))) (.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| 28)) 0)) is different from false [2024-10-28 18:25:37,566 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1607 Int) (v_ArrVal_1600 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int) (v_ArrVal_1602 Int) (v_ArrVal_1605 (Array Int Int))) (let ((.cse4 (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28))) (or (< 8 |v_t_funThread4of4ForFork0_~i~0#1_23|) (= (select (let ((.cse0 (let ((.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse2 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1601) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)) v_ArrVal_1602))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1605) |c_~#a~0.base|) .cse3 v_ArrVal_1607))) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ |c_~#a~0.offset| 28 .cse4)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1600) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse4)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_23| 0)))) is different from false [2024-10-28 18:25:37,914 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1607 Int) (v_ArrVal_1600 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int) (v_ArrVal_1602 Int) (v_ArrVal_1605 (Array Int Int))) (let ((.cse0 (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28))) (or (< 8 |v_t_funThread4of4ForFork0_~i~0#1_23|) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1600) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse0)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_23| 0) (= (select (let ((.cse1 (let ((.cse4 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse3 (let ((.cse6 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse5 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1601) |c_~#a~0.base|) .cse6 v_ArrVal_1602)))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1605) |c_~#a~0.base|) .cse4 v_ArrVal_1607))) (.cse2 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28) 28))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))) (+ |c_~#a~0.offset| 28 .cse0)) 0)))) is different from false [2024-10-28 18:25:37,939 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1607 Int) (v_ArrVal_1600 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int) (v_ArrVal_1602 Int) (v_ArrVal_1605 (Array Int Int))) (let ((.cse0 (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28))) (or (< 8 |v_t_funThread4of4ForFork0_~i~0#1_23|) (not (= (select (select (store (store |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base|) (+ |c_t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1600) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse0)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_23| 0) (= (select (let ((.cse1 (let ((.cse4 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse3 (let ((.cse6 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse5 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1601) |c_~#a~0.base|) .cse6 v_ArrVal_1602)))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1605) |c_~#a~0.base|) .cse4 v_ArrVal_1607))) (.cse2 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28) 28))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))) (+ |c_~#a~0.offset| 28 .cse0)) 0)))) is different from false [2024-10-28 18:25:37,967 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread3of4ForFork0_~i~0#1_23| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1607 Int) (v_ArrVal_1600 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_23| Int) (v_ArrVal_1602 Int) (v_ArrVal_1605 (Array Int Int))) (let ((.cse0 (* |v_t_funThread3of4ForFork0_~i~0#1_23| 28)) (.cse1 (* |v_t_funThread4of4ForFork0_~i~0#1_23| 28))) (or (< 8 |v_t_funThread4of4ForFork0_~i~0#1_23|) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse0) 1)) |c_~#__global_lock~0.base| v_ArrVal_1600) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse1)) 0)) (< |v_t_funThread4of4ForFork0_~i~0#1_23| 0) (= (select (let ((.cse2 (let ((.cse5 (+ |c_~#a~0.offset| (* |c_t_funThread2of4ForFork0_~i~0#1| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (let ((.cse7 (+ |c_~#a~0.offset| (* |c_t_funThread1of4ForFork0_~i~0#1| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse6 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1601) |c_~#a~0.base|) .cse7 v_ArrVal_1602)))) (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1605) |c_~#a~0.base|) .cse5 v_ArrVal_1607))) (.cse3 (+ |c_~#a~0.offset| 28 .cse0))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))) (+ |c_~#a~0.offset| 28 .cse1)) 0)))) is different from false [2024-10-28 18:25:40,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:25:40,562 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 68 [2024-10-28 18:25:40,573 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 70 treesize of output 66 [2024-10-28 18:25:40,585 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 18:25:40,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 18:25:40,604 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 62 treesize of output 56 [2024-10-28 18:25:40,613 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 34 treesize of output 27 [2024-10-28 18:25:48,362 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 42 refuted. 7 times theorem prover too weak. 21 trivial. 11 not checked. [2024-10-28 18:25:48,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696224032] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:25:48,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:25:48,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27, 29] total 75 [2024-10-28 18:25:48,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888334584] [2024-10-28 18:25:48,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:25:48,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-10-28 18:25:48,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:25:48,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-10-28 18:25:48,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=4146, Unknown=121, NotChecked=1112, Total=5700 [2024-10-28 18:25:48,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:25:48,366 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:25:48,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 3.1052631578947367) internal successors, (236), 75 states have internal predecessors, (236), 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:25:48,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:25:48,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:25:48,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:25:48,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:26:32,421 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification. DAG size of input: 407 DAG size of output: 287 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-28 18:26:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:26:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:26:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:26:50,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-28 18:26:50,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-10-28 18:26:51,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:26:51,121 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:26:51,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:26:51,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2103884891, now seen corresponding path program 1 times [2024-10-28 18:26:51,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:26:51,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253814515] [2024-10-28 18:26:51,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:26:51,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:26:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:26:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-28 18:26:51,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:26:51,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253814515] [2024-10-28 18:26:51,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253814515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 18:26:51,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 18:26:51,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-28 18:26:51,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113286556] [2024-10-28 18:26:51,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 18:26:51,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 18:26:51,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:26:51,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 18:26:51,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 18:26:51,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:26:51,253 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:26:51,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 18:26:51,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:26:51,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:26:51,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:26:51,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-10-28 18:26:51,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:26:59,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:26:59,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:26:59,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:26:59,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-28 18:26:59,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:26:59,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-28 18:26:59,806 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 18:26:59,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 18:26:59,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1548562871, now seen corresponding path program 1 times [2024-10-28 18:26:59,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 18:26:59,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749649573] [2024-10-28 18:26:59,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:26:59,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 18:26:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:26:59,913 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:26:59,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 18:26:59,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749649573] [2024-10-28 18:26:59,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749649573] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 18:26:59,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237789831] [2024-10-28 18:26:59,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 18:26:59,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 18:26:59,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 18:26:59,915 INFO L229 MonitoredProcess]: Starting monitored process 23 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:26:59,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-28 18:27:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 18:27:00,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-28 18:27:00,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 18:27:00,190 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:27:00,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 18:27:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-28 18:27:00,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237789831] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 18:27:00,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 18:27:00,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-28 18:27:00,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908867054] [2024-10-28 18:27:00,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 18:27:00,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 18:27:00,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 18:27:00,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 18:27:00,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-28 18:27:00,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:27:00,278 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 18:27:00,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.0) internal successors, (156), 13 states have internal predecessors, (156), 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:27:00,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:27:00,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 18:27:00,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-28 18:27:00,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-10-28 18:27:00,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 18:27:00,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 18:27:13,654 WARN L286 SmtUtils]: Spent 9.82s on a formula simplification. DAG size of input: 450 DAG size of output: 336 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-28 18:27:32,175 WARN L286 SmtUtils]: Spent 17.13s on a formula simplification. DAG size of input: 683 DAG size of output: 542 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-28 18:27:43,089 WARN L286 SmtUtils]: Spent 9.01s on a formula simplification. DAG size of input: 452 DAG size of output: 338 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-28 18:28:00,976 WARN L286 SmtUtils]: Spent 15.94s on a formula simplification. DAG size of input: 685 DAG size of output: 544 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-28 18:28:12,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 18:28:13,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 18:28:48,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 18:29:06,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 18:29:15,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 18:29:17,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 18:29:24,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 18:29:27,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 18:29:29,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15